Exploratory Mining via Constrained Frequent Set Queries
Summary: Proposes mining with constraints as a first-class paradigm for query-driven, exploratory data mining in DBMSs through constraint constructs. Demo shows constraint-pushing for mining association rules via constrained frequent sets, enabling optimized interactive queries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Raymond Ng (University of British Columbia)
- 2. Laks V.S. Lakshmanan (Concordia University)
- 3. Jiawei Han (Simon Fraser University)
- 4. Teresa Mah (University of British Columbia)
BibTeX Citation
@inproceedings{ng_sigmod99,
title = {{Exploratory Mining via Constrained Frequent Set Queries}},
author = {Ng, Raymond and Lakshmanan, Laks V.S. and Han, Jiawei and Mah, Teresa},
series = {{SIGMOD} '99},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/304182.304575},
url = {https://dl.acm.org/doi/10.1145/304182.304575},
year = {1999}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,656 | PARAS: A Parameter Space Framework for Online Association Mining | 2013 | VLDB | 5.3909781e-05 |
| 12,812 | How to Quickly Find a Witness | 2003 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.0006567919 |
| 711 | Beyond Market Baskets: Generalizing Association Rules to Correlations | 1997 | SIGMOD | 0.00014713746 |
| 980 | Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications | 1998 | SIGMOD | 0.00012844074 |
| 1,535 | Exploratory Mining and Pruning Optimizations of Constrained Association Rules | 1998 | SIGMOD | 0.00010463058 |
| 2,251 | Query Flocks: A Generalization of Association-Rule Mining | 1998 | SIGMOD | 8.8684789e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 558 | An Efficient Algorithm for Mining Association Rules in Large Databases | 1995 | VLDB |
| 2 | 9,804 | One-pass Data Mining Algorithms in a DBMS with UDFs | 2011 | SIGMOD |
| 3 | 13,712 | Database Systems Research on Data Mining | 2010 | SIGMOD |
| 4 | 4,420 | Optimization for Active Learning-based Interactive Database Exploration | 2019 | VLDB |
| 5 | 14,219 | Data Mining Techniques | 1996 | SIGMOD |
| 6 | 14,090 | Towards Data Mining Benchmarking: A Test Bed for Performance Study of Frequent Pattern Mining | 2000 | SIGMOD |
| 7 | 14,007 | Query Processing Concepts and Techniques to Support Business Intelligence Applications | 2002 | VLDB |
| 8 | 4,154 | A New SQL-like Operator for Mining Association Rules | 1996 | VLDB |
| 9 | 4,969 | Optimization of Constrained Frequent Set Queries with 2-variable Constraints | 1999 | SIGMOD |
| 10 | 1,535 | Exploratory Mining and Pruning Optimizations of Constrained Association Rules | 1998 | SIGMOD |