document: Coherent closed quasi-clique discovery from large dense graph databases Frequent coherent subgraphs can provide valuable knowledge about the underlying internal structure of a graph database , and mining frequently occurring coherent subgraphs from large dense graph databases has been witnessed several applications and 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 quasi-cliques , 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 , ( B ) Cocain ( \/ B ) 1 Thorough performance study shows that Cocain is very efficient and scalable for large dense graph databases .
doc_bio_tags: O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O