Unsupervised Clustering on Signed Graphs with Unknown Number of Clusters

• Published in: 2020 28th European Signal Processing Conference (EUSIPCO) pp. 1060 - 1064
• Main Authors: Dittrich, Thomas, Matz, Gerald
• Format: Conference Proceeding
• Language: English
• Published: Eurasip 24.01.2021
• Subjects: Clustering algorithms; Partitioning algorithms; Signal processing; Signal processing algorithms; Simulation; Upper bound

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, aug...