Sciweavers


Publication
263views
11 years 6 months ago
Person Re-Identification by Manifold Ranking
Existing person re-identification methods conventionally rely on labelled pairwise data to learn a task-specific distance metric for ranking. The value of unlabelled gallery instan...
Chen Change Loy, Chunxiao Liu, Shaogang Gong
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 12 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
ICML
2007
IEEE
15 years 10 days ago
A transductive framework of distance metric learning by spectral dimensionality reduction
Distance metric learning and nonlinear dimensionality reduction are two interesting and active topics in recent years. However, the connection between them is not thoroughly studi...
Fuxin Li, Jian Yang, Jue Wang
ECCV
2008
Springer
15 years 1 months ago
Output Regularized Metric Learning with Side Information
Distance metric learning has been widely investigated in machine learning and information retrieval. In this paper, we study a particular content-based image retrieval application ...
Wei Liu, Steven C. H. Hoi, Jianzhuang Liu
CVPR
2008
IEEE
15 years 1 months ago
Rank-based distance metric learning: An application to image retrieval
We present a novel approach to learn distance metric for information retrieval. Learning distance metric from a number of queries with side information, i.e., relevance judgements...
Jung-Eun Lee, Rong Jin, Anil K. Jain
CVPR
2007
IEEE
15 years 1 months ago
Adaptive Distance Metric Learning for Clustering
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
Jieping Ye, Zheng Zhao, Huan Liu