Node classification via simplicial interaction with augmented maximal clique selection
- 1 October 2025
- journal article
- Published by Elsevier in Neurocomputing
- Vol. 658
Abstract
No abstract availableAll Related Versions
Funding Information
- National Research Foundation of Korea (RS-2025-02363044)
This publication has 22 references indexed in Scilit:
- Networks beyond pairwise interactions: Structure and dynamicsPhysics Reports, 2020
- A review of stochastic block models and extensions for graph clusteringApplied Network Science, 2019
- Enhanced Community Structure Detection in Complex Networks with Partial Background InformationScientific Reports, 2013
- Computing global structural balance in large-scale signed social networksProceedings of the National Academy of Sciences of the United States of America, 2011
- Semi-supervised clustering algorithm for community structure detection in complex networksPhysica A: Statistical Mechanics and its Applications, 2010
- The worst-case time complexity for generating all maximal cliques and computational experimentsTheoretical Computer Science, 2006
- Hyper-edges and multidimensional centralitySocial Networks, 2004
- Solving Dirichlet and Poisson problems on graphs by means of equilibrium measuresEuropean Journal of Combinatorics, 2003
- Theoretical Foundations for Centrality MeasuresAmerican Journal of Sociology, 1991
- Stochastic blockmodels: First stepsSocial Networks, 1983