mlsanityData to 7 Oct 2026

A Correlation Clustering Approach to Link Classification in Signed Networks -- Full Version --

arXiv 1301.4769 ↗First posted 21 Jan 2013cs.LG cs.DS stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

Motivated by social balance theory, we develop a theory of link classification in signed networks using the correlation clustering index as measure of label regularity. We derive learning bounds in terms of correlation clustering within three fundamental transductive learning settings: online, batch and active. Our main algorithmic contribution is in the active setting, where we introduce a new family of efficient link classifiers based on covering the input graph with small circuits. These are the first active algorithms for link classification with mistake bounds that hold for arbitrary signed networks.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Jan 2013.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 0; 2025: 1.

4 papers.