2014Advances in Social Networks Analysis and MiningRequires access

An modularity-based overlapping community structure detecting algorithm

Kui Meng, Gongshen Liu, Qiong Hu, Jianhua Li

Open publisher page 0 citations

Abstract

Many algorithms have been designed to detect community structure in social networks. However, most algorithms can only detect disjoint communities effectively. A new overlapping community structure detecting algorithm is proposed in this paper, which adopts modularity to community clustering. In order to evaluate the algorithm, Modularity by Newman and the NMI (Normalized Mutual Information) by Lancichinetti are used as the evaluation metrics. It is approved by the experiments that the proposed method works well to the real overlapping communities.

About this research paper

What this paper is about

Many algorithms have been designed to detect community structure in social networks. However, most algorithms can only detect disjoint communities effectively. A new overlapping community structure detecting algorithm is proposed in this paper, which adopts modularity to community clustering. In order to evaluate the algorithm, Modularity by Newman and the NMI (Normalized Mutual Information) by Lancichinetti are used as the evaluation metrics. It is approved by the experiments that the proposed method works well to the real overlapping communities.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Many algorithms have been designed to detect community structure in social networks. However, most algorithms can only detect disjoint communities effectively. A new overlapping community structure detecting algorithm is proposed in this paper, which adopts modularity to community clustering. In order to evaluate the algorithm, Modularity by Newman and the NMI (Normalized Mutual Information) by Lancichinetti are used as the evaluation metrics. It is approved by the experiments that the proposed method works well to the real overlapping communities.

Key concepts: Modularity (biology), Clique percolation method, Disjoint sets, Community structure, Computer science, Cluster analysis, Data mining, Algorithm design

Related papers

Back to paper searchBrowse research topicsOriginal source
An modularity-based overlapping community structure detecting algorithm — Research Paper | ScholarLens