Sciweavers

Share
KDD
2006
ACM

Coherent closed quasi-clique discovery from large dense graph databases

11 years 1 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large dense graph databaseshas been witnessedseveral applicationsand received considerable attention in the graph mining community recently. In this paper, we study how to efficiently mine the complete set of coherent closed quasi-cliques from large dense graph databases, which is an especially challenging task due to the downward-closure property no longer holds. By fully exploring some properties of quasicliques, we propose several novel optimization techniques, which can prune the unpromising and redundant sub-search spaces effectively. Meanwhile, we devise an efficient closure checking scheme to facilitate the discovery of only closed quasi-cliques. We also develop a coherent closed quasi-clique mining algorithm, Cocain 1 . Thorough performance study shows that Cocain is very efficient and scalable for large d...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka
Added 30 Nov 2009
Updated 30 Nov 2009
Type Conference
Year 2006
Where KDD
Authors Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Karypis
Comments (0)
books