Community Finding of Scale-Free Network: Algorithm and Evaluation Criterion

DOI10.1007/978-3-540-88067-7_13MaRDI QIDQ3627915zbMATH OpenOpenAlexFDO

Authors Sen Qin, Guanzhong Dai

Publication date 13 May 2009

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88067-7_13

zbMATH Keywords

algorithmcommunity findingcomplex networkevaluation criterionscale-free network

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Deterministic network models in operations research (90B10)

Recommendations

• Detecting network communities: a new systematic and efficient algorithm
• A fast estimation algorithm of community number in large scale-free complex networks
• COMMUNITY FINDING IN COMPLEX NETWORKS
• Community structure in social and biological networks
• Finding community structure in networks using a shortest-path-based k-means algorithm

Cites work

• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Data mining. Concepts and techniques
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks

Cited in

(1)

• A fast estimation algorithm of community number in large scale-free complex networks

This page was built for publication: Community Finding of Scale-Free Network: Algorithm and Evaluation Criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627915)