An MDL approach to efficiently discover communities in bipartite network

An minimum description length (MDL) criterion is proposed to choose a good partition for a bipartite network. A heuristic algorithm based on combination theory is presented to approach the optimal partition. As the heuristic algorithm automatically searches for the number of partitions, no user inte...

Full description

Saved in:
Bibliographic Details
Published inJournal of Central South University Vol. 21; no. 4; pp. 1353 - 1367
Main Authors Xu, Kai-kuo, Zeng, Chun-qiu, Yuan, Chang-an, Li, Chuan, Tang, Chang-jie
Format Journal Article
LanguageEnglish
Published Heidelberg Central South University 01.04.2014
Subjects
Engineering
Metallic Materials
bipartite network
community detection
minimum description length
Online AccessGet full text
ISSN2095-2899
2227-5223
DOI10.1007/s11771-014-2073-6

Cover

More Information
Summary:An minimum description length (MDL) criterion is proposed to choose a good partition for a bipartite network. A heuristic algorithm based on combination theory is presented to approach the optimal partition. As the heuristic algorithm automatically searches for the number of partitions, no user intervention is required. Finally, experiments are conducted on various datasets, and the results show that our method generates higher quality results than the state-of-art methods, cross-association and bipartite, recursively induced modules. Experiment results also show the good scalability of the proposed algorithm. The method is applied to traditional Chinese medicine (TCM) formula and Chinese herbal network whose community structure is not well known, and found that it detects significant and it is informative community division.
ISSN:2095-2899
2227-5223
DOI:10.1007/s11771-014-2073-6