Clustering signed networks with the geometric mean of Laplacians

Pedro Mercado, Francesco Tudisco, Matthias Hein

Research output: Contribution to conferencePaperpeer-review

20 Citations (Scopus)
28 Downloads (Pure)


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.
Original languageEnglish
Publication statusPublished - 5 Dec 2016
EventNIPS 2016 - Neural Information Processing Systems - Centre Convencions Internacional Barcelona, Barcelona, Spain
Duration: 5 Dec 201610 Dec 2016


ConferenceNIPS 2016 - Neural Information Processing Systems
Abbreviated titleNIPS


  • signed networks
  • spectral clustering
  • Laplacians
  • geometric mean
  • neural networks


Dive into the research topics of 'Clustering signed networks with the geometric mean of Laplacians'. Together they form a unique fingerprint.

Cite this