Discovering latent blockmodels in sparse and noisy graphs using non-negative matrix factorisation

Authors:
Jeffrey Chan;Wei Liu;Andrey Kan;Christopher Leckie;James Bailey;Kotagiri Ramamohanarao
Affiliations:
University of Melbourne, Melbourne, Australia;NICTA, Sydney, Australia;Walter and Eliza Hall Institute, Melbourne, Australia;University of Melbourne, Melbourne, Australia;University of Melbourne, Melbourne, Australia;University of Melbourne, Melbourne, Australia
Venue:
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Year:
2013

Citing 7
Cited 0

Orthogonal nonnegative matrix t-factorizations for clustering

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Mixed Membership Stochastic Blockmodels

The Journal of Machine Learning Research
A general framework for relation graph clustering

Knowledge and Information Systems
Community discovery using nonnegative matrix factorization

Data Mining and Knowledge Discovery
Fast coordinate descent methods with variable selection for non-negative matrix factorization

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Overlapping community detection via bounded nonnegative matrix tri-factorization

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Blockmodelling is an important technique in social network analysis for discovering the latent structure in graphs. A blockmodel partitions the set of vertices in a graph into groups, where there are either many edges or few edges between any two groups. For example, in the reply graph of a question and answer forum, blockmodelling can identify the group of experts by their many replies to questioners, and the group of questioners by their lack of replies among themselves but many replies from experts. Non-negative matrix factorisation has been successfully applied to many problems, including blockmodelling. However, these existing approaches can fail to discover the true latent structure when the graphs have strong background noise or are sparse, which is typical of most real graphs. In this paper, we propose a new non-negative matrix factorisation approach that can discover blockmodels in sparse and noisy graphs. We use synthetic and real datasets to show that our approaches have much higher accuracy and comparable running times.