A Correlation Clustering Approach to Link Classification in Signed Networks -- Full Version --
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
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 0; 2025: 1.
4 papers.
- 2021Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oraclecited by 6
- 2025CoRet: Improved Retriever for Code Editingcited by 3
- 2022Sublinear-Time Clustering Oracle for Signed Graphscited by 2
- 2021Active clustering for labeling training datacited by 1
- 2025CoRet: Improved Retriever for Code Editing30 May 2025
- 2022Sublinear-Time Clustering Oracle for Signed Graphs28 Jun 2022
- 2021Active clustering for labeling training data27 Oct 2021
- 2021Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle18 Jun 2021