• Citer

The sum-over-paths covariance kernel: A novel covariance measure between nodes of a directed graph

par Mantrach, Amin ;Yen, Luh;Callut, Jérôme;Francoisse, Kevin;Saerens, Marco ;Shimbo, Masashi
Référence IEEE transactions on pattern analysis and machine intelligence, 32, 6, page (1112-1126), 4815265
Publication Publié, 2010

Article révisé par les pairs

• Détails
• Contenu

Résumé :

This work introduces a link-based covariance measure between the nodes of a weighted directed graph, where a cost is associated with each arc. To this end, a probability distribution on the (usually infinite) countable set of paths through the graph is defined by minimizing the total expected cost between all pairs of nodes while fixing the total relative entropy spread in the graph. This results in a Boltzmann distribution on the set of paths such that long (high-cost) paths occur with a low probability while short (low-cost) paths occur with a high probability. The sum-over-paths (SoP) covariance measure between nodes is then defined according to this probability distribution: two nodes are considered as highly correlated if they often co-occur together on the samepreferably shortpaths. The resulting covariance matrix between nodes (say n nodes in total) is a Gram matrix and therefore defines a valid kernel on the graph. It is obtained by inverting an n\times n matrix depending on the costs assigned to the arcs. In the same spirit, a betweenness score is also defined, measuring the expected number of times a node occurs on a path. The proposed measures could be used for various graph mining tasks such as computing betweenness centrality, semi-supervised classification of nodes, visualization, etc., as shown in Section 7. © 2010 IEEE.