Talks and Poster Presentations (with Proceedings-Entry):
T. Dittrich, G. Matz:
"Unsupervised Clustering on Signed Graphs with Unknown Number of Clusters";
Poster: 28th European Signal Processing Conference (EUSIPCO 2020),
- 01-22-2021; in: "2020 28th European Signal Processing Conference (EUSIPCO)",
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.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Created from the Publication Database of the Vienna University of Technology.