Mining frequent correlated-Quasi-Cliques from PPI networks

Xiaogang Lei, Xuequn Shang, Miao Wang, Jingni Diao

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

摘要

Many of the previous studies show convincing arguments that mining frequent subgraphs is especially useful. Many hidden frequent patterns which are very interesting can not be found by mining single graph. Previous studies as Quasi-Clique have little success with the hub problem. In this paper, we introduce a new conception Correlated-Quasi-Clique and develop a novel algorithm, CoClique, to address the hub problem and improve the efficiency of frequent correlated-Quasi-Cliques mining. Meanwhile, we exploit several effective techniques to prune the search space. An extensive experimental evaluation on real databases demonstrates that our algorithm outperforms previous methods.

源语言英语
主期刊名Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010
7-10
页数4
DOI
出版状态已出版 - 2010
活动2010 WASE International Conference on Information Engineering, ICIE 2010 - Beidaihe, Hebei, 中国
期限: 14 8月 201015 8月 2010

出版系列

姓名Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010
2

会议

会议2010 WASE International Conference on Information Engineering, ICIE 2010
国家/地区中国
Beidaihe, Hebei
时期14/08/1015/08/10

指纹

探究 'Mining frequent correlated-Quasi-Cliques from PPI networks' 的科研主题。它们共同构成独一无二的指纹。

引用此