591 search results - page 7 / 119 » An Efficient Algorithm for Local Distance Metric Learning |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
NIPS
2003
14 years 11 months ago
2003
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...
125
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Multi-instance multi-label learning (MIML) refers to the
learning problems where each example is represented by a
bag/collection of instances and is labeled by multiple labels.
...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Visual dictionaries are widely employed in object recognition to map unordered bags of local region descriptors into feature vectors for image classification. Most visual dictiona...
117
click to vote
DAGM
2011
Springer
13 years 9 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...