Sciweavers

39 search results - page 3 / 8
» Distance Metric Learning with Eigenvalue Optimization
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
ICML
2007
IEEE
15 years 10 months ago
Dirichlet aggregation: unsupervised learning towards an optimal metric for proportional data
Proportional data (normalized histograms) have been frequently occurring in various areas, and they could be mathematically abstracted as points residing in a geometric simplex. A...
Hua-Yan Wang, Hongbin Zha, Hong Qin
ICML
2003
IEEE
15 years 10 months ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...
ICML
2010
IEEE
14 years 10 months ago
Metric Learning to Rank
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Brian McFee, Gert R. G. Lanckriet
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon