Sciweavers

114 search results - page 1 / 23
» Nonlinear adaptive distance metric learning for clustering
Sort
View
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 7 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
CVPR
2007
IEEE
14 years 8 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
PR
2006
164views more  PR 2006»
13 years 6 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
ICMLC
2005
Springer
14 years 16 hour ago
Kernel-Based Metric Adaptation with Pairwise Constraints
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...
Hong Chang, Dit-Yan Yeung
PR
2010
156views more  PR 2010»
13 years 4 months ago
Semi-supervised clustering with metric learning: An adaptive kernel method
Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel met...
Xuesong Yin, Songcan Chen, Enliang Hu, Daoqiang Zh...