非负矩阵分解
矩阵分解
计算机科学
图形
因式分解
离群值
网络拓扑
非负矩阵
理论计算机科学
算法
数学
对称矩阵
人工智能
特征向量
物理
操作系统
量子力学
作者
Kamal Berahmand,Mehrnoush Mohammadi,Farid Saberi-Movahed,Yuefeng Li,Yan Xu
出处
期刊:IEEE Transactions on Network Science and Engineering
[Institute of Electrical and Electronics Engineers]
日期:2023-01-01
卷期号:10 (1): 372-385
被引量:36
标识
DOI:10.1109/tnse.2022.3210233
摘要
Community detection has become an important research topic in machine learning due to the proliferation of network data. However, most existing methods have been developed based on only exploiting the topology structures of the network, which can result in missing the advantage of using the nodes' attribute information. As a result, it is expected that much valuable information that could be used to improve the quality of discovered communities will be ignored. To solve this limitation, we propose a novel Augment Graph Regularization Nonnegative Matrix Factorization for Attributed Networks (AGNMF-AN) method, which is simple yet effective. Firstly, Augment Attributed Graph (AAG) is applied to combine both the topological structure and attributed nodes of the network. Secondly, we introduced an effective framework to update the affinity matrix, in which the affinity matrix's weight in each iteration is modified adaptively instead of using a fixed affinity matrix in the classical graph regularization-based nonnegative matrix factorization methods. Thirdly, the $l_{2,1}$ -norm is utilized to reduce the effect of random noise and outliers in the quality of structure community. Experimental results show that our method performs unexpectedly well in comparison to existing state-of-the-art methods in attributed networks.
科研通智能强力驱动
Strongly Powered by AbleSci AI