期刊
IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 70, 期 -, 页码 4321-4336出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2022.3200215
关键词
K-means clustering; combinatorial optimization; community detection; coupled matrix-tensor factorization; identifiability; matrix factorization; nonnegative matrix factorization; unsupervised learning
资金
- ARO [W911NF1910407]
- NSF [ECCS-1807660]
- U.S. Department of Defense (DOD) [W911NF1910407] Funding Source: U.S. Department of Defense (DOD)
A new SBMF model is proposed for community detection, which can handle overlapping communities effectively, and its effectiveness is demonstrated through experiments.
Community detection is a fundamental problem in knowledge discovery and data mining. In this paper we propose a semi-binary matrix factorization (SBMF) model for community detection, which can be understood as a marriage between K-means clustering and (semi-)nonnegative matrix factorization. This leads to an easy-to-interpret factorization that can naturally handle overlapping communities. Unlike K-means, the proposed approach does not restrict each individual to belong to only a single community, nor does it restrict the sum of soft membership values to add up to one. We derive relatively easy-to-check uniqueness conditions suggesting that meaningful communities can be obtained via SBMF. Computing a (least-squares) optimal SBMF is a hard mixed integer nonconvex optimization problem. We bypass this challenge by converting the problem into a coupled matrix-tensor factorization form, which only involves continuous variables and can be tackled using tensor decomposition tools, and can also be used to initialize optimization based methods. We present experiments with real data to demonstrate the effectiveness of the proposed approach for community detection in coauthorship networks and in financial stock market data.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据