Through this design, CDNE incorporates local node proximity and mesoscopic community semantics without relying on an open-ended iterative procedure, and achieves strong performance in link prediction, cross-layer network reconstruction, and community-quality evaluation.
Abstract
Community structure provides important mesoscopic information for network representation learning, yet most community-aware embedding methods use detected communities as fixed contexts or auxiliary regularizers. This paper proposes CDNE, a Community-Driven Network Embedding framework based on two-stage community structure refinement. In the first stage, CDNE applies the Louvain algorithm to obtain initial community partitions and designs a community-guided random walk strategy to sample both topological neighbors and same-community nodes. The generated sequences are used to learn preliminary node embeddings with the skip-gram model. In the second stage, these preliminary embeddings are clustered to refine community assignments, and the refined communities guide a new round of community-aware embedding learning. Through this design, CDNE incorporates local node proximity and mesoscopic community semantics without relying on an open-ended iterative procedure. Experiments on multiple real-world networks show that CDNE achieves strong performance in link prediction, cross-layer network reconstruction, and community-quality evaluation. Ablation analyses further indicate that meaningful community partitions, community-guided walks, and second-stage refinement jointly contribute to the observed improvements, suggesting that community refinement is an effective strategy for learning discriminative node representations.
A combined HGT-based framework incorporating contrastive representation learning and deep clustering with multi-round training via pseudo-labels is presented, enabling the model to better deal with label scarcity, heterogeneous dependencies, and overlapping semantics in practical, complex, attributed networks.
Hamza Haddad, Hicham Attariuas, A. Younes· Edelweiss Applied Science an...· 0 citations
D2GSL constructs a semantic similarity channel and a spectral feature channel to model node relationships from both local semantic and global spectral views and introduces a hyperadjacency matrix that explicitly models inter-layer node correspondences and enables joint structural reconstruction across channels.
Jun-Chen Zhang, Xuhao Wei, Xiaolei Gu et al.· Computer Modeling in Enginee...· 0 citations
An adaptive community search framework ECHO is proposed, which consistently outperforms state-of-the-art methods in terms of community quality while achieving superior search efficiency.
Chengyang Luo, Zi-Xing Ding, Qing Liu et al.· Proceedings of the 32nd ACM...· 0 citations
LUCID, an LLM-guided, interpretable, training-free, and unsupervised community detection method, designed as a four-stage pipeline that achieves state-of-the-art performance and consistently outperforms leading unsupervised and semi-supervised baselines.
Aoting Zeng, Kai Wang, Jianwei Wang et al.· 0 citations
A generative model for temporal networks that jointly controls community evolution and dynamic node sets and is used as a benchmark to study the impact of the rate at which nodes join/leave the network on the performance of dynamic community detection algorithms.
Pei-Jie Zhong, Raul J. Mondragón, Richard G. Clegg· arXiv.org· 0 citations
This study offers a practical recipe for node-level JEPA-style latent prediction on graphs, and clarifies when structural conditioning helps representation learning.
Ting-He Zhang, Jian Xu, Jia-Heng Chen et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.