Coherent closed quasi-clique discovery from large dense graph databases

Authors:
Zhiping Zeng;Jianyong Wang;Lizhu Zhou;George Karypis
Affiliations:
Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China;University of Minnesota, Minneapolis, MN
Venue:
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Year:
2006

Citing 5
Cited 21

Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
On mining cross-graph quasi-cliques

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mining closed relational graphs with connectivity constraints

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mining coherent dense subgraphs across massive biological networks for functional discovery

Bioinformatics
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering

Out-of-core coherent closed quasi-clique mining from large dense graph databases

ACM Transactions on Database Systems (TODS)
Netprobe: a fast and scalable system for fraud detection in online auction networks

Proceedings of the 16th international conference on World Wide Web
Community detection in large-scale social networks

Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
CSV: visualizing and mining cohesive subgraphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Effective Pruning Techniques for Mining Quasi-Cliques

ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
FOGGER: an algorithm for graph generator discovery

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Community detection in complex networks

Journal of Computer Science and Technology
Multi-way set enumeration in real-valued tensors

Proceedings of the 2nd Workshop on Data Mining using Matrices and Tensors
A query language for analyzing networks

Proceedings of the 18th ACM conference on Information and knowledge management
GPD: A Graph Pattern Diffusion Kernel for Accurate Graph Classification with Applications in Cheminformatics

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Structural correlation pattern mining for large graphs

Proceedings of the Eighth Workshop on Mining and Learning with Graphs
MARGIN: Maximal frequent subgraph mining

ACM Transactions on Knowledge Discovery from Data (TKDD)
DESSIN: mining dense subgraph patterns in a single graph

SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Assessing and ranking structural correlations in graphs

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A parameter-free method for discovering generalized clusters in a network

DS'11 Proceedings of the 14th international conference on Discovery science
Birds bring flues? mining frequent and high weighted cliques from birds migration networks

DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Mining attribute-structure correlated patterns in large attributed graphs

Proceedings of the VLDB Endowment
Mining coherent subgraphs in multi-layer graphs with edge labels

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
BiQL: a query language for analyzing information networks

Bisociative Knowledge Discovery
RMiCS: a robust approach for mining coherent subgraphs in edge-labeled multi-layer graphs

Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Discovery of extreme events-related communities in contrasting groups of physical system networks

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, Cocain1 Thorough performance study shows that Cocain is very efficient and scalable for large dense graph databases.