41 citations · 73 across the 6 of their papers we have counts for
5 papers · 1 filter
See the Tree Through the Lines: The Shazoo Algorithm -- Full Version --
Fabio Vitale, Nicolo Cesa-Bianchi, Claudio Gentile +1
Predicting the nodes of a given graph is a fascinating theoretical problem with applications in several domains. Since graph sparsification via spanning trees retains enough inform…
A Correlation Clustering Approach to Link Classification in Signed Networks -- Full Version --
Nicolo Cesa-Bianchi, Claudio Gentile, Fabio Vitale +1
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 l…
A Linear Time Active Learning Algorithm for Link Classification -- Full Version --
Nicolo Cesa-Bianchi, Claudio Gentile, Fabio Vitale +1
We present very efficient active learning algorithms for link classification in signed networks. Our algorithms are motivated by a stochastic model in which edge labels are obtaine…
Active Learning on Trees and Graphs
Nicolo Cesa-Bianchi, Claudio Gentile, Fabio Vitale +1
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we ch…
Random Spanning Trees and the Prediction of Weighted Graphs
Nicolo' Cesa-Bianchi, Claudio Gentile, Fabio Vitale +1
We investigate the problem of sequentially predicting the binary labels on the nodes of an arbitrary weighted graph. We show that, under a suitable parametrization of the problem,…