The Random Forest Kernel and other kernels for big data from random partitions

We present Random Partition Kernels, a new class of kernels derived by demonstrating a natural connection between random partitions of objects and kernels between those objects. We show how the construction can be used to create kernels from methods that would not normally be viewed as random partitions, such as Random Forest. To demonstrate the potential of this method, we propose two new kernels, the Random Forest Kernel and the Fast Cluster Kernel, and show that these kernels consistently outperform standard kernels on problems involving real-world datasets. Finally, we show how the form of these kernels lend themselves to a natural approximation that is appropriate for certain big data problems, allowing $O(N)$ inference in methods such as Gaussian Processes, Support Vector Machines and Kernel PCA.

A reversible infinite HMM using normalised random measures

Copyright 2014 by the author(s). We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Markov chain. The resulting prior over infinite transition matrices is closely related to the hierarchical Dirichlet process but enforces reversibility. A reinforcement scheme has recently been proposed with similar properties, but the de Finetti measure is not well characterised. We take the alternative approach of explicitly constructing the mixing measure, which allows more straightforward and efficient inference at the cost of no longer having a closed form predictive distribution. We use our process to construct a reversible infinite HMM which we apply to two real datasets, one from epigenomics and one ion channel recording.

The forming of variable cross-section I-beams by hot rolling

A process is presented for the forming of variable cross-section I-beams by hot rolling. Optimized I-beams with variable cross-section offer a significant weight advantage over prismatic beams. By tailoring the cross-section to the bending moment experienced within the beam, around 30% of the material can be saved compared to a standard section. Production of such beams by hot rolling would be advantageous, as It combines high volume capacity with high material yields. Through controlled variation of the roll gap during multiple passes, beams with a variable cross-section have been created using shaped rolls similar to those used for conventional I-beam rolling. The process was tested experimentally on a small scale rolling mill, using plasticine as the modelling material. These results were then compared to finite element simulations of individual stages of the process conducted using Abaqus/Standard. Results here show that the process can successfully form a beam with a variable depth web. The main failure modes of the process, and the limitations on the achievable variations In geometry are also presented. Finally, the question of whether or not optimal beam geometries can be created by this process Is discussed. © 2011 Wiley-VCH Verlag GmbH & Co. KGaA. Weinheim.

A derivation of the asymptotic random-coding prefactor

This paper studies the subexponential prefactor to the random-coding bound for a given rate. Using a refinement of Gallager's bounding techniques, an alternative proof of a recent result by Altuǧ and Wagner is given, and the result is extended to the setting of mismatched decoding. © 2013 IEEE.