Name
Abstract | ||
|---|---|---|
Maximal clique enumeration is a long-standing problem in graph mining and knowledge discovery. Numerous classic algorithms exist for solving this problem. However, these algorithms focus on enumerating all maximal cliques, which may be computationally impractical and much of the output may be irrelevant to the user. To address this issue, we introduce the problem of knowledge-biased clique enumeration, a query-driven formulation that reduces output space, computation time, and memory usage. Moreover, we introduce a dynamic state space indexing strategy for efficiently processing multiple queries over the same graph. This strategy reduces redundant computations by dynamically indexing the constituent state space generated with each query. Experimental results over real-world networks demonstrate this strategy’s effectiveness at reducing the cumulative query-response time. Although developed in the context of maximal cliques, our techniques could possibly be generalized to other constraint-based graph enumeration tasks. |
Year | Venue | Field |
|---|---|---|
2016 | ADMA | Inverted index,Data mining,Clique,Computer science,Enumeration,Search engine indexing,Theoretical computer science,Knowledge extraction,Graph enumeration,State space,Computation |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
12 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steve Harenberg | 1 | 17 | 5.11 |
| Ramona G. Seay | 2 | 1 | 0.72 |
| Gonzalo A. Bello | 3 | 3 | 1.07 |
| Rada Chirkova | 4 | 450 | 36.53 |
| p murali doraiswamy | 5 | 6 | 2.40 |
| Nagiza F. Samatova | 6 | 861 | 74.04 |