Sciweavers

733 search results - page 27 / 147
» Learning Riemannian Metrics
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Learning Metrics via Discriminant Kernels and Multidimensional Scaling: Toward Expected Euclidean Representation
Distance-based methods in machine learning and pattern recognition have to rely on a metric distance between points in the input space. Instead of specifying a metric a priori, we...
Zhihua Zhang
CVPR
2008
IEEE
14 years 10 months ago
Semi-supervised distance metric learning for Collaborative Image Retrieval
Typical content-based image retrieval (CBIR) solutions with regular Euclidean metric usually cannot achieve satisfactory performance due to the semantic gap challenge. Hence, rele...
Steven C. H. Hoi, Wei Liu, Shih-Fu Chang
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
13 years 10 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
CVPR
2012
IEEE
11 years 11 months ago
Learning hierarchical similarity metrics
Categories in multi-class data are often part of an underlying semantic taxonomy. Recent work in object classification has found interesting ways to use this taxonomy structure t...
Nakul Verma, Dhruv Mahajan, Sundararajan Sellamani...
ICDM
2009
IEEE
154views Data Mining» more  ICDM 2009»
13 years 6 months ago
GSML: A Unified Framework for Sparse Metric Learning
There has been significant recent interest in sparse metric learning (SML) in which we simultaneously learn both a good distance metric and a low-dimensional representation. Unfor...
Kaizhu Huang, Yiming Ying, Colin Campbell