Detecting communities in 2-mode networks via fast nonnegative matrix trifactorization

DOI10.1155/2015/937090MaRDI QIDQ1667002zbMATH OpenOpenAlexWikidataFDO

Authors Yang Liu, Tao Wang, Xin-sheng Ji, Caixia Liu, Mingyan Xu

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2015/937090

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Detection theory in information and communication theory (94A13)

Review text

Summary: With the rapid development of the Internet and communication technologies, a large number of multitype relational networks widely emerge in real world applications. The bipartite network is one representative and important kind of complex networks. Detecting community structure in bipartite networks is crucial to obtain a better understanding of the network structures and functions. Traditional nonnegative matrix factorization methods usually focus on homogeneous networks, and they are subject to several problems such as slow convergence and large computation. It is challenging to effectively integrate the network information of multiple dimensions in order to discover the hidden community structure underlying heterogeneous interactions. In this work, we present a novel fast nonnegative matrix trifactorization (F-NMTF) method to cocluster the 2-mode nodes in bipartite networks. By constructing the affinity matrices of 2-mode nodes as manifold regularizations of NMTF, we manage to incorporate the intratype and intratype information of 2-mode nodes to reveal the latent community structure in bipartite networks. Moreover, we decompose the NMTF problem into two subproblems, which are involved with much less matrix multiplications and achieve faster convergence. Experimental results on synthetic and real bipartite networks show that the proposed method improves the slow convergence of NMTF and achieves high accuracy and stability on the results of community detection.

Recommendations

• Community discovery using nonnegative matrix factorization
• A spectral method to find communities in bipartite networks
• Community detection enhancement using non-negative matrix factorization with graph regularization
• Searching for communities in bipartite networks
• Similarity-based local community detection for bipartite networks

Cites work

• Combined feedback-feedforward tracking control for networked control systems with probabilistic delays
• Fast unfolding of communities in large networks
• Graph dual regularization non-negative matrix factorization for co-clustering
• Multiple graph regularized nonnegative matrix factorization
• Observer-based tracking controller design for networked predictive control systems with uncertain Markov delays

Cited in

(1)

• Community discovery using nonnegative matrix factorization

This page was built for publication: Detecting communities in 2-mode networks via fast nonnegative matrix trifactorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667002)