Network Representation Learning Algorithm Based on Complete Subgraph Folding

Dongming Chen, Mingshuo Nie, Jiarui Yan, Dongqi Wang and Qianqian Gan
Additional contact information
Dongming Chen: Software College, Northeastern University, Shenyang 110169, China
Mingshuo Nie: Software College, Northeastern University, Shenyang 110169, China
Jiarui Yan: Software College, Northeastern University, Shenyang 110169, China
Dongqi Wang: Software College, Northeastern University, Shenyang 110169, China
Qianqian Gan: Software College, Northeastern University, Shenyang 110169, China

Mathematics, 2022, vol. 10, issue 4, 1-13

Abstract: Network representation learning is a machine learning method that maps network topology and node information into low-dimensional vector space. Network representation learning enables the reduction of temporal and spatial complexity in the downstream data mining of networks, such as node classification and graph clustering. Existing algorithms commonly ignore the global topological information of the network in network representation learning, leading to information loss. The complete subgraph in the network commonly has a community structure, or it is the component module of the community structure. We believe that the structure of the community serves as the revealed structure in the topology of the network and preserves global information. In this paper, we propose SF-NRL, a network representation learning algorithm based on complete subgraph folding. The algorithm preserves the global topological information of the original network completely, by finding complete subgraphs in the original network and folding them into the super nodes. We employ the network representation learning algorithm to study the node embeddings on the folded network, and then merge the embeddings of the folded network with those of the original network to obtain the final node embeddings. Experiments performed on four real-world networks prove the effectiveness of the SF-NRL algorithm. The proposed algorithm outperforms the baselines in evaluation metrics on community detection and multi-label classification tasks. The proposed algorithm can effectively generalize the global information of the network and provides excellent classification performance.

Keywords: network representation learning; complete subgraph; graph folding (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/4/581/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/4/581/ (text/html)

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:gam:jmathe:v:10:y:2022:i:4:p:581-:d:748305

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().