The Spectral Clustering Based on the Most Similar Relation Diagram

Wei Hong Xu; Min Zhu; Ya Ruo Jiang; Yu Shan Bai; Yan Yu

doi:10.4028/www.scientific.net/AMR.403-408.2577

Paper Titles

Research on Schedule Planning Management of Railway Construction Project Based on CAS
p.2560

Architecture and Data Vitalization of Smart City
p.2564

A Weak Current Detection Circuit Design of Organophosphorous Pesticides Rapid Detection Portable Instrument
p.2569

An Intelligent Chinese Text File Inquiry System
p.2573

The Spectral Clustering Based on the Most Similar Relation Diagram
p.2577

An Extended Belief Network Approach for Keyword-Based Search over PLM Databases
p.2581

An Intelligent System of Mobile Publishing
p.2585

Condition for the Coverage and Connectivity of Wireless Sensor Network
p.2589

Video-Based Human Motion Analysis
p.2593

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 403-408The Spectral Clustering Based on the Most Similar...

The Spectral Clustering Based on the Most Similar Relation Diagram

Abstract:

In this paper we present a spectral clustering method based on the MSRD (Most Similar Relation Diagram). The feature of this method is that both the constructing of the adjacency matrix and the clustering are achieved by spectral algorithm. Experiment on an artificial datasets demonstrate that our method can generate balanced partition and detect the manifold clusters no matter the unnormalized or normalized Laplassian is used and can generate partitions with different features if different MSRD is used. Experiments on some real datasets proved that our method is valid and effective.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

2577-2580

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.403-408.2577

Citation:

Cite this paper

Online since:

November 2011

Authors:

Wei Hong Xu, Min Zhu, Ya Ruo Jiang, Yu Shan Bai, Yan Yu

Keywords:

Adjacency Matrix, MSRD, Similarity Graph, Spectral Clustering

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Donath W.E., Hoffman A.J. Lower Bounds for the Partitioning of Graphs [J]. IBM Journal of Research and Development, 1973, 17(5), 420-425.

DOI: 10.1147/rd.175.0420

Google Scholar

[2] Shi J., Malik J. Normalized Cuts and Image Segmentation [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(8), 888-905.

DOI: 10.1109/34.868688

Google Scholar

[3] Ng A.Y., Jordan M.I., Weiss Y. On spectral clustering: Analysis and an algorithm[C]. In: Proc of NIPS 2001, Columbia, 2001, 849-856.

Google Scholar

[4] M. Meila, J. Shi, Learning segmentation by random walks, in: NIPS, 2000, p.873–879.

Google Scholar

[5] R. Kannan, S. Vempala, A. Vetta, On clusterings: good, bad, and spectral, in: Proceedings of the 41st Annual Symposium on the Foundation of Computer Science, IEEE Computer Society, Silver Spring, MD, November 2000, p.367–380.

DOI: 10.1109/sfcs.2000.892125

Google Scholar

[6] Yan Yu, Yu Shan Bai, Wei Hong Xu. et al. A Clustering Method Based on the Most Similar Relation Diagram of Datasets. 2010 IEEE International Conference on Granular Computing. San Jose, California. August 14-16 2010. pp.598-603.

DOI: 10.1109/grc.2010.77

Google Scholar