Improving Single and Multi-View Blockmodelling by Algebraic Simplification
Lists
Only you see this
Abstract
Blockmodelling is an important technique in social network analysis for discovering the latent structures and groupings in graphs. State-of-the-art approaches approximate the graph using matrix factorisation, which can discover both the latent graph structures and vertex groupings. However, factorisation is a one-way approximation, in that it only approximates the graph with a lossy model that removes the background noise. Traditional Blockmodelling methods rely on an alternating 2-step optimization that involves iteratively updating the matrix representing membership while fixing the matrix representing the graph's underlying structure, and then updating the structure matrix while keeping the membership matrix fixed. We propose a single step optimization method, which uses algebraic simplifi-cation to directly update the lower dimensional, latent structure representation. This helps improve both the convergence and accuracy of blockmodelling. We also show that this approach can solve multi-view blockmodelling problems, involving multiple graphs over the same vertices. We use real datasets to show that our approach has much higher accuracy and comparable running times to competing approaches.
BibTeX
@inproceedings{ramteke2020improving,
author = {Rishabh Ramteke and Peter J. Stuckey and Jeffrey Chan and Kotagiri Ramamohanarao and James Bailey and Christopher Leckie and Emir Demirovic},
title = {{Improving Single and Multi-View Blockmodelling by Algebraic Simplification}},
booktitle = {IJCNN},
year = {2020},
doi = {10.1109/ijcnn48605.2020.9207065},
}Loading related content...