DBScholar

Back to papers

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)

Paper ID
3215
Venue
SIGMOD
Year
1999
Pagerank
5.7944032e-05
Overall Rank
6,719 | 53.91%
DOI
10.1145/304182.304575

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers