Accessibility navigation


Community detection method based on mixed-norm sparse subspace clustering

Tian, B. and Li, W. ORCID: https://orcid.org/0000-0003-2878-3185 (2018) Community detection method based on mixed-norm sparse subspace clustering. Neurocomputing, 275. pp. 2150-2161. ISSN 0925-2312

[img]
Preview
Text - Accepted Version
· Available under License Creative Commons Attribution Non-commercial No Derivatives.
· Please see our End User Agreement before downloading.

1MB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1016/j.neucom.2017.10.060

Abstract/Summary

Community or group is an important structure in disciplines such as social networks, biology gene expression, and physics systems. Community detections for different types of networks have attracted considerable interest. However, it is still challenging to find meaningful community structures in various networks. In particular, accurate community description and implementation of effective detection algorithms with huge datasets are still not solved. In this paper, we present a novel community detection algorithm based on the theory of sparse subspace clustering (SSC) with mixed-norm constraints. Inspired by the sparse representation of subspace, each community in a given network can span a subspace in some similarity measure space. If the basis of subspaces can be solved, all of the nodes can be represented as a linear combination of the nodes that span the same subspace. By introducing a novel mixed-norm constraint in SCC, the connections of nodes among different communities are modeled as noise to improve the clustering accuracy. The formulation of the basis of subspaces is derived from the self-representation property of data by using SSC. Then, the alternating directions method of multipliers (ADMM) framework is used to solve the formulation. Finally, communities are detected by subspace clustering method. The proposed method is compared with state-of-the-art algorithms on synthetic networks and real-world networks. The experimental results show the effectiveness of the proposed algorithm in accurately describing the community. The results also show that the mixed-norm SSC is a practical approach for detecting communities in huge datasets.

Item Type:Article
Refereed:Yes
Divisions:Henley Business School > Business Informatics, Systems and Accounting
ID Code:73454
Publisher:Elsevier

Downloads

Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation