期刊
DATA MINING AND KNOWLEDGE DISCOVERY
卷 22, 期 3, 页码 493-521出版社
SPRINGER
DOI: 10.1007/s10618-010-0181-y
关键词
Community discovery; Nonnegative matrix factorization
资金
- NSF [IIS-0546280, CCF-0830659, DMS-0915110]
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0830659] Funding Source: National Science Foundation
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [0915110] Funding Source: National Science Foundation
Complex networks exist in a wide range of real world systems, such as social networks, technological networks, and biological networks. During the last decades, many researchers have concentrated on exploring some common things contained in those large networks include the small-world property, power-law degree distributions, and network connectivity. In this paper, we will investigate another important issue, community discovery, in network analysis. We choose Nonnegative Matrix Factorization (NMF) as our tool to find the communities because of its powerful interpretability and close relationship between clustering methods. Targeting different types of networks (undirected, directed and compound), we propose three NMF techniques (Symmetric NMF, Asymmetric NMF and Joint NMF). The correctness and convergence properties of those algorithms are also studied. Finally the experiments on real world networks are presented to show the effectiveness of the proposed methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据