Database Paper Browser

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
3153
Venue
SIGMOD
Year
1999
Pagerank
4.989399e-05
Overall Rank
6,623 | 53.93%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
8,408 PARAS: A Parameter Space Framework for Online Association Mining 2013 VLDB 4.5211041e-05
12,619 How to Quickly Find a Witness 2003 PODS 4.1945683e-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