An optimized MBE algorithm on sparse bipartite graphs

Yu He; Ronghua Li; Rui Mao

doi:10.1007/978-3-030-05755-8_21

An optimized MBE algorithm on sparse bipartite graphs

Yu He^*, Ronghua Li, Rui Mao

^*此作品的通讯作者

Shenzhen University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

2 引用（Scopus）

摘要

The maximal biclique enumeration (MBE) is a problem of identifying all maximal bicliques in a bipartite graph. Once enumerated in a bipartite graph, maximal bicliques can be used to solve problems in areas such as purchase prediction, statistic analysis of social networks, discovery of interesting structures in protein-protein interaction networks, identification of common gene-set associations, and integration of diverse functional genomes data. In this paper, we develop an optimized sequential MBE algorithm called sMBEA for sparse bipartite graphs which appear frequently in real life. The results of extensive experiments on several real-life data sets demonstrate that sMBEA outperforms the state-of-the-art sequential algorithm iMBEA.

源语言	英语
主期刊名	Smart Computing and Communication - 3rd International Conference, SmartCom 2018, Proceedings
编辑	Meikang Qiu
出版商	Springer Verlag
页	206-216
页数	11
ISBN（印刷版）	9783030057541
DOI	https://doi.org/10.1007/978-3-030-05755-8_21
出版状态	已出版 - 2018
已对外发布	是
活动	3rd International Conference on Smart Computing and Communications, SmartCom 2018 - Tokyo, 日本期限: 10 12月 2018 → 12 12月 2018

出版系列

姓名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
卷	11344 LNCS
ISSN（印刷版）	0302-9743
ISSN（电子版）	1611-3349

会议

会议	3rd International Conference on Smart Computing and Communications, SmartCom 2018
国家/地区	日本
市	Tokyo
时期	10/12/18 → 12/12/18

访问文件

10.1007/978-3-030-05755-8_21

其它文件与链接

链接到 Scopus 的出版物

引用此

He, Y., Li, R., & Mao, R. (2018). An optimized MBE algorithm on sparse bipartite graphs. 在 M. Qiu (编辑), Smart Computing and Communication - 3rd International Conference, SmartCom 2018, Proceedings (页码 206-216). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 11344 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-05755-8_21

He, Yu ; Li, Ronghua ; Mao, Rui. / An optimized MBE algorithm on sparse bipartite graphs. Smart Computing and Communication - 3rd International Conference, SmartCom 2018, Proceedings. 编辑 / Meikang Qiu. Springer Verlag, 2018. 页码 206-216 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e3c2b129ff62477fa6a0289b80d2dab0,

title = "An optimized MBE algorithm on sparse bipartite graphs",

abstract = "The maximal biclique enumeration (MBE) is a problem of identifying all maximal bicliques in a bipartite graph. Once enumerated in a bipartite graph, maximal bicliques can be used to solve problems in areas such as purchase prediction, statistic analysis of social networks, discovery of interesting structures in protein-protein interaction networks, identification of common gene-set associations, and integration of diverse functional genomes data. In this paper, we develop an optimized sequential MBE algorithm called sMBEA for sparse bipartite graphs which appear frequently in real life. The results of extensive experiments on several real-life data sets demonstrate that sMBEA outperforms the state-of-the-art sequential algorithm iMBEA.",

keywords = "Biclique enumeration, Sparse bipartite graphs",

author = "Yu He and Ronghua Li and Rui Mao",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; 3rd International Conference on Smart Computing and Communications, SmartCom 2018 ; Conference date: 10-12-2018 Through 12-12-2018",

year = "2018",

doi = "10.1007/978-3-030-05755-8_21",

language = "English",

isbn = "9783030057541",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "206--216",

editor = "Meikang Qiu",

booktitle = "Smart Computing and Communication - 3rd International Conference, SmartCom 2018, Proceedings",

address = "Germany",

}

He, Y, Li, R & Mao, R 2018, An optimized MBE algorithm on sparse bipartite graphs. 在 M Qiu (编辑), Smart Computing and Communication - 3rd International Conference, SmartCom 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 卷 11344 LNCS, Springer Verlag, 页码 206-216, 3rd International Conference on Smart Computing and Communications, SmartCom 2018, Tokyo, 日本, 10/12/18. https://doi.org/10.1007/978-3-030-05755-8_21

An optimized MBE algorithm on sparse bipartite graphs. / He, Yu; Li, Ronghua; Mao, Rui.
Smart Computing and Communication - 3rd International Conference, SmartCom 2018, Proceedings. 编辑 / Meikang Qiu. Springer Verlag, 2018. 页码 206-216 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 11344 LNCS).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

TY - GEN

T1 - An optimized MBE algorithm on sparse bipartite graphs

AU - He, Yu

AU - Li, Ronghua

AU - Mao, Rui

PY - 2018

Y1 - 2018

N2 - The maximal biclique enumeration (MBE) is a problem of identifying all maximal bicliques in a bipartite graph. Once enumerated in a bipartite graph, maximal bicliques can be used to solve problems in areas such as purchase prediction, statistic analysis of social networks, discovery of interesting structures in protein-protein interaction networks, identification of common gene-set associations, and integration of diverse functional genomes data. In this paper, we develop an optimized sequential MBE algorithm called sMBEA for sparse bipartite graphs which appear frequently in real life. The results of extensive experiments on several real-life data sets demonstrate that sMBEA outperforms the state-of-the-art sequential algorithm iMBEA.

AB - The maximal biclique enumeration (MBE) is a problem of identifying all maximal bicliques in a bipartite graph. Once enumerated in a bipartite graph, maximal bicliques can be used to solve problems in areas such as purchase prediction, statistic analysis of social networks, discovery of interesting structures in protein-protein interaction networks, identification of common gene-set associations, and integration of diverse functional genomes data. In this paper, we develop an optimized sequential MBE algorithm called sMBEA for sparse bipartite graphs which appear frequently in real life. The results of extensive experiments on several real-life data sets demonstrate that sMBEA outperforms the state-of-the-art sequential algorithm iMBEA.

KW - Biclique enumeration

KW - Sparse bipartite graphs

UR - http://www.scopus.com/inward/record.url?scp=85058551905&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-05755-8_21

DO - 10.1007/978-3-030-05755-8_21

M3 - Conference contribution

AN - SCOPUS:85058551905

SN - 9783030057541

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 206

EP - 216

BT - Smart Computing and Communication - 3rd International Conference, SmartCom 2018, Proceedings

A2 - Qiu, Meikang

PB - Springer Verlag

T2 - 3rd International Conference on Smart Computing and Communications, SmartCom 2018

Y2 - 10 December 2018 through 12 December 2018

ER -

He Y, Li R, Mao R. An optimized MBE algorithm on sparse bipartite graphs. 在 Qiu M, 编辑, Smart Computing and Communication - 3rd International Conference, SmartCom 2018, Proceedings. Springer Verlag. 2018. 页码 206-216. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-05755-8_21

An optimized MBE algorithm on sparse bipartite graphs

摘要

出版系列

会议

访问文件

其它文件与链接

指纹

引用此