Skip to Main content Skip to Navigation
Poster communications

Hypernode Graphs for Learning from Binary Relations between Groups in Networks

Thomas Ricatte 1 Rémi Gilleron 1, 2 Marc Tommasi 1, 2
1 MAGNET - Machine Learning in Information Networks
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : The aim of this paper is to propose methods for learning from interactions between groups in networks. We introduced hypernode graphs in Ricatte et al (2014) a formal model able to represent group interactions and able to infer individual properties as well. Spectral graph learning algorithms were extended to the case of hypern-ode graphs. As a proof-of-concept, we have shown how to model multiple players games with hypernode graphs and that spectral learning algorithms over hyper-node graphs obtain competitive results with skill ratings specialized algorithms. In this paper, we explore theoretical issues for hypernode graphs. We show that hypernode graph kernels strictly generalize over graph kernels and hypergraph kernels. We show that hypernode graphs correspond to signed graphs such that the matrix D − W is positive semidefinite. It should be noted that homophilic relations between groups may lead to non homophilic relations between individ-uals. Moreover, we also present some issues concerning random walks and the resistance distance for hypernode graphs.
Document type :
Poster communications
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Team Magnet Connect in order to contact the contributor
Submitted on : Thursday, November 27, 2014 - 11:31:52 AM
Last modification on : Thursday, January 20, 2022 - 4:13:43 PM
Long-term archiving on: : Monday, March 2, 2015 - 9:22:04 AM


Files produced by the author(s)


  • HAL Id : hal-01088036, version 1


Thomas Ricatte, Rémi Gilleron, Marc Tommasi. Hypernode Graphs for Learning from Binary Relations between Groups in Networks. Networks: From Graphs to Rich Data, NIPS Workshop., Dec 2014, Montreal, Canada. 2014. ⟨hal-01088036⟩



Les métriques sont temporairement indisponibles