A Constrained Power Method for Community Detection in Complex Networks
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-04-22
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
For an undirected complex network made up with vertices and edges, we developed a fast computing algorithm that divides vertices into different groups by maximizing the standard “modularity” measure of the resulting partitions.
The algorithm is based on a simple constrained power method which maximizes a quadratic objective function while satisfying given linear constraints.
We evaluated the performance of the algorithm and compared it with a number of state-of-the-art solutions.
The new algorithm reported both high optimization quality and fast running speed, and thus it provided a practical tool for community detection and network structure analysis.
American Psychological Association (APA)
Li, Wenye. 2014. A Constrained Power Method for Community Detection in Complex Networks. Mathematical Problems in Engineering،Vol. 2014, no. 2014, pp.1-6.
https://search.emarefa.net/detail/BIM-499380
Modern Language Association (MLA)
Li, Wenye. A Constrained Power Method for Community Detection in Complex Networks. Mathematical Problems in Engineering No. 2014 (2014), pp.1-6.
https://search.emarefa.net/detail/BIM-499380
American Medical Association (AMA)
Li, Wenye. A Constrained Power Method for Community Detection in Complex Networks. Mathematical Problems in Engineering. 2014. Vol. 2014, no. 2014, pp.1-6.
https://search.emarefa.net/detail/BIM-499380
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-499380