Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness

10/16/2012
by   Bertrand Lebichot, et al.
0

This paper introduces a novel, well-founded, betweenness measure, called the Bag-of-Paths (BoP) betweenness, as well as its extension, the BoP group betweenness, to tackle semisupervised classification problems on weighted directed graphs. The objective of semi-supervised classification is to assign a label to unlabeled nodes using the whole topology of the graph and the labeled nodes at our disposal. The BoP betweenness relies on a bag-of-paths framework assigning a Boltzmann distribution on the set of all possible paths through the network such that long (high-cost) paths have a low probability of being picked from the bag, while short (low-cost) paths have a high probability of being picked. Within that context, the BoP betweenness of node j is defined as the sum of the a posteriori probabilities that node j lies in-between two arbitrary nodes i, k, when picking a path starting in i and ending in k. Intuitively, a node typically receives a high betweenness if it has a large probability of appearing on paths connecting two arbitrary nodes of the network. This quantity can be computed in closed form by inverting a n x n matrix where n is the number of nodes. For the group betweenness, the paths are constrained to start and end in nodes within the same class, therefore defining a group betweenness for each class. Unlabeled nodes are then classified according to the class showing the highest group betweenness. Experiments on various real-world data sets show that BoP group betweenness outperforms all the tested state of-the-art methods. The benefit of the BoP betweenness is particularly noticeable when only a few labeled nodes are available.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2013

A bag-of-paths framework for network data analysis

This work develops a generic framework, called the bag-of-paths (BoP), f...
research
02/08/2019

Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism

This work derives closed-form expressions computing the expectation of c...
research
01/04/2013

The Sum-over-Forests density index: identifying dense regions in a graph

This work introduces a novel nonparametric density index defined on grap...
research
06/07/2018

Randomized Optimal Transport on a Graph: Framework and New Distance Measures

The recently developed bag-of-paths framework consists in setting a Gibb...
research
09/10/2017

Robust Routing in Interdependent Networks

We consider a model of two interdependent networks, where every node in ...
research
10/22/2019

Simplification of networks via conservation of path diversity and minimisation of the search information

Alternative paths in a network play an important role in its functionali...
research
05/19/2023

An Ensemble Semi-Supervised Adaptive Resonance Theory Model with Explanation Capability for Pattern Classification

Most semi-supervised learning (SSL) models entail complex structures and...

Please sign up or login with your details

Forgot password? Click here to reset