A constrained power method for community detection in complex networks (Q1719174): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59069377, #quickstatements; #temporary_batch_1706366595684 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59069377 / rank | |||
Normal rank |
Revision as of 16:52, 27 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A constrained power method for community detection in complex networks |
scientific article |
Statements
A constrained power method for community detection in complex networks (English)
0 references
8 February 2019
0 references
Summary: 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.
0 references