Node Classification in Networks via Simplicial Interactions
- 15 January 2025
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (8) , 14428-14439
Abstract
In the node classification task, it is natural to presume that densely connected nodes tend to exhibit similar attributes. Given this, it is crucial to first define what constitutes a dense connection and to develop a reliable mathematical tool for assessing node cohesiveness. In this article, we propose a probability-based objective function for semi-supervised node classification that takes advantage of higher order networks’ capabilities. The proposed function reflects the philosophy aligned with the intuition behind classifying within higher order networks, as it is designed to reduce the likelihood of nodes interconnected through higher order networks bearing different labels. In addition, we propose the stochastic block tensor model (SBTM) as a graph generation model designed specifically to address a significant limitation of the traditional stochastic block model (SBM), which does not adequately represent the distribution of higher order structures in real networks. We evaluate the objective function using networks generated by the SBTM, which include both balanced and imbalanced scenarios. Furthermore, we present an approach that integrates the objective function with graph neural network (GNN)-based semi-supervised node classification methodologies, aiming for additional performance gains. Our results demonstrate that in challenging classification scenarios—characterized by a low probability of homo-connections, a high probability of hetero-connections, and limited prior node information—models based on the higher order network outperform pairwise interaction-based models. Furthermore, the experimental results suggest that integrating our proposed objective function with existing GNN-based node classification approaches enhances the classification performance by efficiently learning higher order structures distributed in the network.Keywords
All Related Versions
Funding Information
- Korea Institute for Advanced Study (AP086801)
This publication has 40 references indexed in Scilit:
- Networks beyond pairwise interactions: Structure and dynamicsPhysics Reports, 2020
- The many facets of community detection in complex networksApplied Network Science, 2017
- Community detection in networks: A user guidePhysics Reports, 2016
- Semi-supervised community detection based on discrete potential theoryPhysica A: Statistical Mechanics and its Applications, 2014
- Stochastic blockmodels and community structure in networksPhysical Review E, 2011
- Semi-supervised clustering algorithm for community structure detection in complex networksPhysica A: Statistical Mechanics and its Applications, 2010
- Finding hypergraph communities: a Bayesian approach and variational solutionJournal of Statistical Mechanics: Theory and Experiment, 2009
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Modularity and community structure in networksProceedings of the National Academy of Sciences of the United States of America, 2006
- Solving Dirichlet and Poisson problems on graphs by means of equilibrium measuresEuropean Journal of Combinatorics, 2003