跳到主要导航 跳到搜索 跳到主要内容

An optimized MBE algorithm on sparse bipartite graphs

  • Yu He*
  • , Ronghua Li
  • , Rui Mao
  • *此作品的通讯作者
  • Shenzhen University

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

摘要

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
出版状态已出版 - 2018
已对外发布
活动3rd International Conference on Smart Computing and Communications, SmartCom 2018 - Tokyo, 日本
期限: 10 12月 201812 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/1812/12/18

学术指纹

探究 'An optimized MBE algorithm on sparse bipartite graphs' 的科研主题。它们共同构成独一无二的学术指纹。

引用此