Exploratory Mining and Pruning Optimizations of Constrained Association Rules
Summary: Constraint-based, human-centered exploratory mining replaces black-box association-rule mining with constrained association queries (domain, class, and SQL-style aggregates) to guide discovery. CAP uses anti-monotonicity and succinctness to classify constraints into four categories and prune aggressively, delivering up to 80× speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Raymond T. Ng
- 2. Laks V. S. Lakshmanan
- 3. Jiawei Han
- 4. Alex Pang
Incoming Citations (Sorted by Pagerank)
Showing 21 of 21 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 117 | An Effective Hash-Based Algorithm for Mining Association Rules | 1995 | SIGMOD | 0.00045896865 |
| 403 | Mining Generalized Association Rules | 1995 | VLDB | 0.00024148455 |
| 473 | Sampling Large Databases for Association Rules | 1996 | VLDB | 0.0002233798 |
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.0010864752 |
| 4,218 | Mining Optimized Association Rules for Numeric Attributes | 1996 | PODS | 6.3511866e-05 |
| 547 | An Efficient Algorithm for Mining Association Rules in Large Databases | 1995 | VLDB | 0.00020420717 |
| 227 | Discovery of Multiple-Level Association Rules from Large Databases | 1995 | VLDB | 0.00032284058 |
| 3,871 | A New SQL-like Operator for Mining Association Rules | 1996 | VLDB | 6.6794637e-05 |
| 4,919 | Optimization of Constrained Frequent Set Queries with 2-variable Constraints | 1999 | SIGMOD | 5.8256934e-05 |
| 6,623 | Exploratory Mining via Constrained Frequent Set Queries | 1999 | SIGMOD | 4.989399e-05 |