The Spectral Clustering Based on the Most Similar Relation Diagram
2011 ◽
Vol 403-408
◽
pp. 2577-2580
Keyword(s):
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.
2019 ◽
Vol 18
(01)
◽
pp. 1941019
Keyword(s):
2013 ◽
Vol 237
(1)
◽
pp. 145-161
◽
2017 ◽
Vol 10
(11)
◽
pp. 11-22
2021 ◽
Vol 5
(3)
◽
pp. 315
Keyword(s):
2021 ◽
Vol 126
◽
pp. 106495