DeepAI AI Chat
Log In Sign Up

Clustering Signed Networks with the Geometric Mean of Laplacians

by   Pedro Mercado, et al.

Signed networks allow to model positive and negative relationships. We analyze existing extensions of spectral clustering to signed networks. It turns out that existing approaches do not recover the ground truth clustering in several situations where either the positive or the negative network structures contain no noise. Our analysis shows that these problems arise as existing approaches take some form of arithmetic mean of the Laplacians of the positive and negative part. As a solution we propose to use the geometric mean of the Laplacians of positive and negative part and show that it outperforms the existing approaches. While the geometric mean of matrices is computationally expensive, we show that eigenvectors of the geometric mean can be computed efficiently, leading to a numerical scheme for sparse matrices which is of independent interest.


page 1

page 2

page 3

page 4


Spectral Clustering of Signed Graphs via Matrix Power Means

Signed graphs encode positive (attractive) and negative (repulsive) rela...

Classification of Existing Virtualization Methods Used in Telecommunication Networks

This article studies the existing methods of virtualization of different...

Geometric construction of canonical 3D gadgets in origami extrusions

In a series of our three previous papers, we presented several construct...

Prototypical Networks for Multi-Label Learning

We propose to address multi-label learning by jointly estimating the dis...

Election Manipulation on Social Networks with Positive and Negative Messages

We study the problem of election control through social influence when t...

Learning Overcomplete HMMs

We study the problem of learning overcomplete HMMs---those that have man...

The Forward-Forward Algorithm: Some Preliminary Investigations

The aim of this paper is to introduce a new learning procedure for neura...