Flow-Based Clustering and Spectral Clustering: A Comparison
Loading...
Access rights
openAccess
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Authors
Date
2021
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
5
1292-1296
1292-1296
Series
55th Asilomar Conference on Signals, Systems and Computers, ACSSC 2021, Conference Record - Asilomar Conference on Signals, Systems and Computers, Volume 2021-October
Abstract
We propose and study a novel graph clustering method for data with an intrinsic network structure. Similar to spectral clustering, we exploit an intrinsic network structure of data to construct Euclidean feature vectors. These feature vectors can then be fed into basic clustering methods such as k-means or Gaussian mixture model (GMM) based soft clustering. What sets our approach apart from spectral clustering is that we do not use the eigenvectors of a graph Laplacian to construct the feature vectors. Instead, we use the solutions of total variation minimization problems to construct feature vectors that reflect connectivity between data points. Our motivation is that the solutions of total variation minimization are piece-wise constant around a given set of seed nodes. These seed nodes can be obtained from domain knowledge or by simple heuristics that are based on the network structure of data. Our results indicate that our clustering methods can cope with certain graph structures that are challenging for spectral clustering methods.Description
Publisher Copyright: © 2021 IEEE.
Keywords
clustering, community detection, complex networks, machine learning, non-smooth optimization
Other note
Citation
Sarcheshmehpour, Y, Tian, Y, Zhang, L & Jung, A 2021, Flow-Based Clustering and Spectral Clustering : A Comparison . in M B Matthews (ed.), 55th Asilomar Conference on Signals, Systems and Computers, ACSSC 2021 . Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2021-October, IEEE, pp. 1292-1296, Asilomar Conference on Signals, Systems & Computers, Pacific Grove, California, United States, 31/10/2021 . https://doi.org/10.1109/IEEECONF53345.2021.9723162