Node classification in networks via simplicial interactions
Preprint
Abstract
In the node classification task, it is intuitively understood that densely connected nodes tend to exhibit similar attributes. However, it is crucial to first define what constitutes a dense connection and to develop a reliable mathematical tool for assessing node cohesiveness. In this paper, we propose a probability-based objective function for semi-supervised node classification that takes advantage of higher-order networks' capabilities. The proposed function embodies the philosophy most 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. We evaluate the function using both balanced and imbalanced datasets generated by the Planted Partition Model (PPM), as well as a real-world political book dataset. According to the results, in challenging classification contexts characterized by low homo-connection probability, high hetero-connection probability, and limited prior information of nodes, higher-order networks outperform pairwise interactions in terms of objective function performance. Notably, the objective function exhibits elevated Recall and F1-score relative to Precision in the imbalanced dataset, indicating its potential applicability in many domains where detecting false negatives is critical, even at the expense of some false positives.Keywords
All Related Versions
This publication has 23 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
- Enhanced Community Structure Detection in Complex Networks with Partial Background InformationScientific Reports, 2013
- From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networksScientific Reports, 2013
- Semi-supervised clustering algorithm for community structure detection in complex networksPhysica A: Statistical Mechanics and its Applications, 2010
- Hyper-edges and multidimensional centralitySocial Networks, 2004
- Solving Dirichlet and Poisson problems on graphs by means of equilibrium measuresEuropean Journal of Combinatorics, 2003
- Stochastic blockmodels: First stepsSocial Networks, 1983