1310 search results - page 133 / 262 » Learning the k in k-means |
172
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper, we propose a novel classification method, called local manifold matching (LMM), for face recognition. LMM has great representational capacity of available prototypes...
168
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider a sequential decision problem where the rewards are generated by a piecewise-stationary distribution. However, the different reward distributions are unknown and may c...
166
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Subgroup discovery is the task of identifying the top k patterns in a database with most significant deviation in the distribution of a target attribute Y . Subgroup discovery is ...
222
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
203
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...