Name
Abstract | ||
|---|---|---|
Association rule mining is known to be computationally intensive, yet real-time decision-making applications are increasingly intolerant to delays. In this paper, we introduce the parameter space model, called PARAS. PARAS enables efficient rule mining by compactly maintaining the final rulesets. The PARAS model is based on the notion of stable region abstractions that form the coarse granularity ruleset space. Based on new insights on the redundancy relationships among rules, PARAS establishes a surprisingly compact representation of complex redundancy relationships while enabling efficient redundancy resolution at query-time. Besides the classical rule mining requests, the PARAS model supports three novel classes of exploratory queries. Using the proposed PSpace index, these exploratory query classes can all be answered with near real-time responsiveness. Our experimental evaluation using several benchmark datasets demonstrates that PARAS achieves 2 to 5 orders of magnitude improvement over state-of-the-art approaches in online association rule mining. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.14778/2535569.2448953 | PVLDB |
Keywords | DocType | Volume |
redundancy relationship,efficient redundancy resolution,classical rule mining request,parameter space framework,coarse granularity ruleset space,association rule mining,paras model,online association mining,efficient rule mining,parameter space model,complex redundancy relationship,online association rule mining | Journal | 6 |
Issue | ISSN | Citations |
3 | 2150-8097 | 10 |
PageRank | References | Authors |
0.57 | 15 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xika Lin | 1 | 23 | 3.51 |
| Abhishek Mukherji | 2 | 79 | 6.27 |
| Elke A. Rundensteiner | 3 | 4076 | 700.65 |
| Carolina Ruiz | 4 | 111 | 12.85 |
| Matthew O. Ward | 5 | 1757 | 189.48 |