Sciweavers

268 search results - page 1 / 54
» Learning Pairwise Similarity for Data Clustering
Sort
View
ICPR
2006
IEEE
14 years 5 months ago
Learning Pairwise Similarity for Data Clustering
Each clustering algorithm induces a similarity between given data points, according to the underlying clustering criteria. Given the large number of available clustering technique...
Ana L. N. Fred, Anil K. Jain
IAT
2009
IEEE
13 years 11 months ago
Clustering with Constrained Similarity Learning
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...
Masayuki Okabe, Seiji Yamada
SDM
2009
SIAM
225views Data Mining» more  SDM 2009»
14 years 1 months ago
Integrated KL (K-means - Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations.
Most datasets in real applications come in from multiple sources. As a result, we often have attributes information about data objects and various pairwise relations (similarity) ...
Fei Wang, Chris H. Q. Ding, Tao Li
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
11 years 7 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
CVPR
2008
IEEE
14 years 6 months ago
Constrained spectral clustering through affinity propagation
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
Miguel Á. Carreira-Perpiñán, ...