80 search results - page 9 / 16 » Adaptive Distance Metric Learning for Clustering |
IPM
2006
13 years 7 months ago
2006
We consider a challenging clustering task: the clustering of muti-word terms without document co-occurrence information in order to form coherent groups of topics. For this task, ...
ALT
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
ICCV
2009
IEEE
15 years 13 days ago
2009
IEEE
Face identification is the problem of determining
whether two face images depict the same person or not.
This is difficult due to variations in scale, pose, lighting,
background...
PAKDD
2009
ACM
14 years 2 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
DAGM
2011
Springer
12 years 7 months ago
2011
Springer
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...