Nonnegative Matrix Tri-factorization with Graph Regularization for Community Detection in Social Networks

Yulong Pei, Nilanjan Chakraborty and Katia Sycara
Conference Paper, International Joint Conference on AI (IJCAI), July, 2015

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Community detection on social media is a classic and challenging task. In this paper, we study the problem of detecting communities by combining social relations and user generated content in social networks. We propose a nonnegative matrix tri-factorization (NMTF) based clustering framework with three types of graph regularization. The NMTF based clustering framework can combine the relations and content seamlessly and the graph regularization can capture user similarity, message similarity and user interaction explicitly. In order to design regularization components, we further exploit user similarity and message similarity in social networks. A unified optimization problem is proposed by integrating the NMTF framework and the graph regularization. Then we derive an iterative learning algorithm for this optimization problem. Extensive experiments are conducted on three real-world data sets and the experimental results demonstrate the effectiveness of the proposed method.

author = {Yulong Pei and Nilanjan Chakraborty and Katia Sycara},
title = {Nonnegative Matrix Tri-factorization with Graph Regularization for Community Detection in Social Networks},
booktitle = {International Joint Conference on AI (IJCAI)},
year = {2015},
month = {July},
} 2017-09-13T10:38:37-04:00