.png){kind=icon}
.png){kind=icon}
Return
An overlapping network community partition algorithm based on semi-supervised matrix factorization and random walk
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2017.09.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The discovery of community structure is the basis of understanding the topology structure and social function of the network. It is also an important factor for recommendation technology, information dissemination, event prediction, and more. In this paper, we consider the structure and characteristics of the social network and propose an algorithm based on semi-supervised matrix factorization and random walk. The proposed method first calculates the transition probability between nodes through the topology of the network. The random walk model is then used to obtain the final walk probability, and the feature matrix is constructed. At the same time, we combine a priori content information in the network to build a must-link matrix and a cannot-link matrix. We then merge them into the feature matrix of the random walk to form a new feature matrix. Finally, the expectation of the number of edges is defined according to the factorized membership matrix. Results demonstrate the effectiveness and better performance of our method. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Matrix factorization
Random walk
Node convergence degree
Node influence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W