Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Knowledge discovery in databases: an overview
AI Magazine
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Finding interesting rules from large sets of discovered association rules
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Classifying molecular sequences using a linkage graph with their pairwise similarities
Theoretical Computer Science - Special issue: Genome informatics
Efficient mining of emerging patterns: discovering trends and differences
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Clustering by pattern similarity in large data sets
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Scalable Techniques for Mining Causal Structures
Data Mining and Knowledge Discovery
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Computing Frequent Graph Patterns from Semistructured Data
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
D(k)-index: an adaptive structural summary for graph-structured data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Scalable mining of large disk-based graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering in Dynamic Spatial Databases
Journal of Intelligent Information Systems
Mining periodic patterns with gap requirement from sequences
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Frequent Substructure-Based Approaches for Classifying Chemical Compounds
IEEE Transactions on Knowledge and Data Engineering
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
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
Discovering Frequent Episodes and Learning Hidden Markov Models: A Formal Connection
IEEE Transactions on Knowledge and Data Engineering
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Closed Constrained Gradient Mining in Retail Databases
IEEE Transactions on Knowledge and Data Engineering
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Out-of-core frequent pattern mining on a commodity PC
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
A new efficient probabilistic model for mining labeled ordered trees
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Frequent subgraph mining in outerplanar graphs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Coherent closed quasi-clique discovery from large dense graph databases
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Feature construction and δ-free sets in 0/1 samples
DS'06 Proceedings of the 9th international conference on Discovery Science
A bi-clustering framework for categorical data
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Moment+: Mining Closed Frequent Itemsets over Data Stream
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
CDPM: Finding and Evaluating Community Structure in Social Networks
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
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
Parallel community detection on large networks with propinquity dynamics
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
JCCM: Joint Cluster Communities on Attribute and Relationship Data in Social Networks
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Discovering Relevant Cross-Graph Cliques in Dynamic Networks
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Frequent subgraph pattern mining on uncertain graph data
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient mining of minimal distinguishing subgraph patterns from graph databases
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Diagnosing memory leaks using graph mining on heap dumps
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
The impact of unlinkability on adversarial community detection: effects and countermeasures
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
On dense pattern mining in graph streams
Proceedings of the VLDB Endowment
Efficient algorithms for supergraph query processing on graph databases
Journal of Combinatorial Optimization
Mining attribute-structure correlated patterns in large attributed graphs
Proceedings of the VLDB Endowment
Finding maximal k-edge-connected subgraphs from a large graph
Proceedings of the 15th International Conference on Extending Database Technology
On the maximum quasi-clique problem
Discrete Applied Mathematics
Closed and noise-tolerant patterns in n-ary relations
Data Mining and Knowledge Discovery
Efficiently computing k-edge connected components via graph decomposition
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Discovery of extreme events-related communities in contrasting groups of physical system networks
Data Mining and Knowledge Discovery
Modelling and exploring historical records to facilitate service composition
International Journal of Web and Grid Services
| Hi-index | 0.00 |
Due to the ability of graphs to represent more generic and more complicated relationships among different objects, graph mining has played a significant role in data mining, attracting increasing attention in the data mining community. In addition, 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 witnessed several applications and received considerable attention in the graph mining community recently. In this article, 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 fact that 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 subsearch spaces effectively. Meanwhile, we devise an efficient closure checking scheme to facilitate the discovery of closed quasi-cliques only. Since large databases cannot be held in main memory, we also design an out-of-core solution with efficient index structures for mining coherent closed quasi-cliques from large dense graph databases. We call this Cocain*. Thorough performance study shows that Cocain* is very efficient and scalable for large dense graph databases.