EUVIMEDEUVIMED entdecken
Crossref

Relative Entropy-based Regularized Non-negative Matrix Factorization for Attributed Graph Clustering

Kamal Berahmand, Mehrnoush Mohammadi, Razieh Sheikhpour, Mahdi Jalili, Richi Nayak, Hassan Khosravi

ACM Transactions on Knowledge Discovery from Data · 30.11.2025 · 19 (9) · 1-28

DOI: 10.1145/3765742 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Knowledge Discovery from Data, online erschienen am 07.10.2025. Verfasst von Kamal Berahmand und 5 weiteren Autor:innen. Die Arbeit wurde bisher 21-mal zitiert (Crossref) und nennt 71 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Attributed graph clustering is a fundamental task in network mining, essential for uncovering valuable insights in various applications. However, the heterogeneity of information from structural and attribute spaces poses significant challenges in achieving consistent and meaningful clustering. To address this, we propose Relative Entropy-based Regularized Non-negative Matrix Factorization (RENMF), a novel approach that integrates structural and attribute information through advanced matrix factorization techniques. RENMF employs Symmetric NMF and Projective NMF to extract community membership distributions from the structural and attribute spaces, respectively. By treating these distributions as homogeneous, RENMF preserves distinct, denoised information from both spaces while considering their heterogeneous complementary information. We introduce Relative Entropy (RE) as a novel regularization term to facilitate interaction between these spaces, aiming to maximize consistency between the discovered latent distributions. In this interaction, we leverage the asymmetric property of RE to emphasize attributes as essential complementary information for structural clustering. The RENMF model is solved using a new iterative multiplicative update rule, with convergence theoretically proven. We evaluate RENMF’s effectiveness through extensive experiments on 10 real-world networks, comparing it to 11 state-of-the-art clustering methods. The results demonstrate RENMF’s superiority in ground truth matching and key quality metrics, outperforming existing methods.

Zitieren

APA

Berahmand, K., Mohammadi, M., Sheikhpour, R., Jalili, M., Nayak, R., & Khosravi, H. (2025). Relative Entropy-based Regularized Non-negative Matrix Factorization for Attributed Graph Clustering. ACM Transactions on Knowledge Discovery from Data, 19(9), 1-28. https://doi.org/10.1145/3765742

Vancouver

Berahmand K, Mohammadi M, Sheikhpour R, Jalili M, Nayak R, Khosravi H. Relative Entropy-based Regularized Non-negative Matrix Factorization for Attributed Graph Clustering. ACM Transactions on Knowledge Discovery from Data. 2025;19(9):1-28. doi:10.1145/3765742

BibTeX
@article{Berahmand2025,
  author = {Berahmand, Kamal and Mohammadi, Mehrnoush and Sheikhpour, Razieh and Jalili, Mahdi and Nayak, Richi and Khosravi, Hassan},
  title = {Relative Entropy-based Regularized Non-negative Matrix Factorization for Attributed Graph Clustering},
  journal = {ACM Transactions on Knowledge Discovery from Data},
  year = {2025},
  volume = {19},
  number = {9},
  pages = {1--28},
  doi = {10.1145/3765742}
}
Kostenlos starten →