ACM Home Page
Please provide us with feedback. Feedback
Semi-supervised metric learning by maximizing constraint margin
Full text PdfPdf (143 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
POSTER SESSION: Poster session 2/knowledge management table of contents
Pages 1457-1458  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Fei Wang  Tsinghua University, Beijing, China
Shouchun Chen  Tsinghua University, Beijing, China
Changshui Zhang  Tsingua University, Beijing, China
Tao Li  Florida International University, Miami, FL, USA
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 73,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458331
What is a DOI?

ABSTRACT

Distance metric learning is an old problem that has been researched in the supervised learning field for a very long time. In this paper, we consider the problem of learning a proper distance metric under the guidance of some weak supervisory information. Specifically, those information are in the form of pairwise constraints which specify whether a pair of data points are in the same class (must link constraints) or in the different classes (cannot link constraints). Given those constraints, our algorithm aims to learn a distance metric under which the points with must link constraints are pushed as close as possible, while simultaneously the points with cannot link constraints are pulled away as far as possible. Finally the experimental results are presented to show the effectiveness of our method.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Blake, E. Keogh, and C. J. Merz, UCI repository of machine learning databases. Department of Information and Computer Science, UC Irvine, 1998.
2
 
3
K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. knowledge. In proceedings of ICML, 2001.
 
4
F. Wang, C. Zhang. Feature Extraction by Maximizing the Constraint Margin. CVPR 2007.
 
5
K. Q. Weinberger and L. K. Saul. An Introduction to Nonlinear Dimensionality Reduction by Maximum Variance Unfolding.In proceedings of AAAI, 2006.

Collaborative Colleagues:
Fei Wang: colleagues
Shouchun Chen: colleagues
Changshui Zhang: colleagues
Tao Li: colleagues