125
click to vote
ICML
15 years 5 months ago
2006 IEEE
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...
ICML
15 years 9 months ago
2006 IEEE
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...
92
Voted
ICML
15 years 9 months ago
2006 IEEE
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...
ICML
2006 IEEE Automatic basis function construction for approximate dynamic programming and reinforcement learning
15 years 2 months ago
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 ...
ICML
15 years 9 months ago
2006 IEEE
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...
|