Paper Info
Title
Unsupervised Clustering On Signed Graphs With Unknown Number Of Clusters
Abstract
We consider the problem of unsupervised clustering on signed graphs, i.e., graphs with positive and negative edge weights. Motivated by signed cut minimization, we propose an optimization problem that minimizes the total variation of the cluster labels subject to constraints on the cluster size, augmented with a regularization that prevents clusters consisting of isolated nodes. We estimate the unknown number of clusters by tracking the change of total variation with successively increasing putative cluster numbers. Simulation results indicate that our method yields excellent results for moderately unbalanced graphs.
Year
DOI
Venue
2020
10.23919/Eusipco47968.2020.9287424
28TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2020)
DocType
ISSN
Citations 
Conference
2076-1465
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Thomas Dittrich101.69
Gerald Matz296687.40