Sciweavers

ICML
2006
IEEE
15 years 5 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
ICML
2006
IEEE
15 years 9 months ago
The support vector decomposition machine
In machine learning problems with tens of thousands of features and only dozens or hundreds of independent training examples, dimensionality reduction is essential for good learni...
Francisco Pereira, Geoffrey J. Gordon
92
Voted
ICML
2006
IEEE
15 years 9 months ago
Pachinko allocation: DAG-structured mixture models of topic correlations
Latent Dirichlet allocation (LDA) and other related topic models are increasingly popular tools for summarization and manifold discovery in discrete data. However, LDA does not ca...
Wei Li, Andrew McCallum
ICML
2006
IEEE
15 years 2 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
ICML
2006
IEEE
15 years 9 months ago
R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization
Principal component analysis (PCA) minimizes the sum of squared errors (L2-norm) and is sensitive to the presence of outliers. We propose a rotational invariant L1-norm PCA (R1-PC...
Chris H. Q. Ding, Ding Zhou, Xiaofeng He, Hongyuan...
Machine Learning
Top of PageReset Settings