Data clustering by scaled adjacency matrix

Authors:
Jian Yu;Caiyan Jia
Affiliations:
Department of Computer Science, Beijing Jiaotong University, Beijing, P.R. China;Department of Computer Science, Beijing Jiaotong University, Beijing, P.R. China
Venue:
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Year:
2011

Citing 6
Cited 0

Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Robust Path-Based Spectral Clustering with Application to Image Segmentation

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Optimum cut-based clustering

Signal Processing
Clustering and Embedding Using Commute Times

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Similarity based clustering, which is to find the extrinsic clusters in data by taking as input a collection of real-valued similarities between data points, has been playing an important role in data analysis and engineering. Lots of work had been done in this field. However, data clustering is an rather challenge problem as there is no labeled data available. We observe that an ideal similarity matrix should be close to an adjacency matrix up to a scale. Based on this idea, we develop a scaled adjacency matrix (SAM) clustering algorithm that could find an optimal adjacency matrix in some sense for a given similarity matrix. Based on the learnt adjacency matrix, clustering could be performed straightforwardly. Upon three assumptions on the similarity matrix, we prove that the performance of SAM is robust. Experimental results also show that SAM is effective.