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

01/21/2013
by   Nicolò Cesa-Bianchi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2014

On a correlational clustering of integers

Correlation clustering is a concept of machine learning. The ultimate go...
research
01/21/2013

A Linear Time Active Learning Algorithm for Link Classification -- Full Version --

We present very efficient active learning algorithms for link classifica...
research
03/23/2023

PAC-Bayes Bounds for High-Dimensional Multi-Index Models with Unknown Active Dimension

The multi-index model with sparse dimension reduction matrix is a popula...
research
01/18/2020

A Classification-Based Approach to Semi-Supervised Clustering with Pairwise Constraints

In this paper, we introduce a neural network framework for semi-supervis...
research
11/05/2018

Motif and Hypergraph Correlation Clustering

Motivated by applications in social and biological network analysis, we ...
research
02/27/2019

Improved algorithms for Correlation Clustering with local objectives

Correlation Clustering is a powerful graph partitioning model that aims ...

Please sign up or login with your details

Forgot password? Click here to reset