COMPLEX NETWORK CLASSIFICATION USING DENG ENTROPY AND BIDIRECTIONAL LONG SHORT-TERM MEMORY

Marã A-Del-Carmen Soto-Camacho, Marcell Nagy, Roland Molontay and Aldo Ramirez-Arellano
Additional contact information
Marã A-Del-Carmen Soto-Camacho: SEPI–UPIICSA, Instituto Politecnico Nacional, Av. Te 950, Granjas Mexico, Iztacalco, 08400 Ciudad de México, México
Marcell Nagy: Department of Stochastics, Institute of Mathematics, Budapest University of Technology and Economics, Műegyetem rkp. 3., H-1111 Budapest, Hungary
Roland Molontay: Department of Stochastics, Institute of Mathematics, Budapest University of Technology and Economics, Műegyetem rkp. 3., H-1111 Budapest, Hungary
Aldo Ramirez-Arellano: SEPI–UPIICSA, Instituto Politecnico Nacional, Av. Te 950, Granjas Mexico, Iztacalco, 08400 Ciudad de México, México

FRACTALS (fractals), 2025, vol. 33, issue 01, 1-15

Abstract: Network classification plays a crucial role in various domains like social network analysis and bioinformatics. While Graph Neural Networks (GNNs) have achieved significant success, they struggle with the problem of over-smoothing and capturing global information. Additionally, GNNs require a large amount of data, hindering performance on small datasets. To address these limitations, we propose a novel approach utilizing Deng’s entropy, capturing network topology and node/edge information. This entropy is calculated at multiple scales, resulting in an entropy sequence that incorporates both local and global features. We embed the networks by combining the entropy sequences for edges and nodes into a matrix, which then are fed into a bidirectional long short-term memory network to perform network classification. Our method outperforms GNNs in the bioinformatics, social, and molecule domains, achieving superior classification power on nine out of eleven benchmark datasets. Further experiments with both real-world and synthetic datasets highlight its exceptional performance, achieving an accuracy of 97.24% on real-world complex networks and 100% on synthetic complex networks. Additionally, our approach proves effective on datasets with a small number of networks and unbalanced classes and excels at distinguishing between synthetic and real-world networks.

Keywords: Complex Networks; Deng Entropy; Network Classification; BiLSTM; Box-Covering (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0218348X25500070
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:fracta:v:33:y:2025:i:01:n:s0218348x25500070

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0218348X25500070

Access Statistics for this article

FRACTALS (fractals) is currently edited by Tara Taylor

More articles in FRACTALS (fractals) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().