Learning Bregman distance functions for semi-supervised clustering
Learning distance functions with side information plays a key role in many data mining applications. Conventional distance metric learning approaches often assume that the target distance function is represented in some form of Mahalanobis distance. These approaches usually work well when data are i...
Saved in:
Main Authors: | Wu, Lei., Hoi, Steven C. H., Jin, Rong., Zhu, Jianke., Yu, Nenghai. |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/84506 http://hdl.handle.net/10220/13469 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Learning Bregman Distance Functions and its Application for Semi-Supervised Clustering
by: WU, Lei, et al.
Published: (2009) -
Learning Bregman distance functions for semi-supervised clustering
by: Wu, Lei, et al.
Published: (2012) -
Semi-supervised distance metric learning for collaborative image retrieval and clustering
by: HOI, Steven C. H., et al.
Published: (2010) -
Semi-supervised SVM batch mode active learning for image retrieval
by: HOI, Steven, et al.
Published: (2008) -
Semi-supervised distance metric learning based on local linear regression for data clustering
by: Yu, Jun., et al.
Published: (2013)