Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 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
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
A clustering algorithm based on graph connectivity
Information Processing Letters
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
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 large dense subgraphs in massive graphs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Coherent closed quasi-clique discovery from large dense graph databases
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Improving functional modularity in protein-protein interactions graphs using hub-induced subgraphs
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Discovering Relevant Cross-Graph Cliques in Dynamic Networks
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Mining attribute-structure correlated patterns in large attributed graphs
Proceedings of the VLDB Endowment
Subgraph mining on directed and weighted graphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Mining coherent subgraphs in multi-layer graphs with edge labels
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
On the maximum quasi-clique problem
Discrete Applied Mathematics
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
Redundancy-aware maximal cliques
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
Many real-world datasets, such as biological networks and social networks, can be modeled as graphs. It is interesting to discover densely connected subgraphs from these graphs, as such subgraphs represent groups of objects sharing some common properties. Several algorithms have been proposed to mine quasi-cliques from undirected graphs, but they have not fully utilized the minimum degree constraint for pruning. In this paper, we propose an efficient algorithm called Quickto find maximal quasi-cliques from undirected graphs. The Quickalgorithm uses several effective pruning techniques based on the degree of the vertices to prune unqualified vertices as early as possible, and these pruning techniques can be integrated into existing algorithms to improve their performance as well. Our experiment results show that Quickis orders of magnitude faster than previous work on mining quasi-cliques.