On Spectral Bipartite Clustering Algorithm and Automatic Determination of the Number of Clusters (CROSBI ID 587733)
Prilog sa skupa u zborniku | sažetak izlaganja sa skupa | međunarodna recenzija
Podaci o odgovornosti
Mirošević, Ivančica ; Jakovčević Stor, Nevena
engleski
On Spectral Bipartite Clustering Algorithm and Automatic Determination of the Number of Clusters
The main idea of spectral clustering is in modeling of a data set in a form of a simple undirected weighted graph, and observing the graph Laplacian spectrum. Usually, data partition can be reconstructed from dominant eigenvectors. We introduce several heuristic algorithms for accurate determination of number of clusters. The algorithms are based on properties of coupling matrix introduced in [1]. In this presentation we give several examples of datasets sucessfully clustered by our algorithms, both artificial and real-world ones.
Spectral Bipartite Clustering; Number of Clusters
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
2008.
objavljeno
Podaci o matičnoj publikaciji
IWASEP 7, International Workshop on Accurate Solution of Eigenvalue Problems VII
Podaci o skupu
7th International Workshop on Accurate Solution of Eigenvalue Problems
predavanje
09.06.2008-12.06.2008
Dubrovnik, Hrvatska