Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...
Recently a class of multiscale stochastic models has been introducedin which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a...
Paul W. Fieguth, William W. Irving, Alan S. Willsk...
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...