Database Paper Browser

Back to papers

How to Quickly Find a Witness

Summary: Introduce the "witness" concept to decouple traversal from pruning in constrained itemset mining, enabling existing algorithms to handle arbitrary, non-(anti)monotone/convertible constraints. Provide efficient witness-finding for stable functions and variance constraints (var(S) ≤ c, ≥ c) with heuristics to accelerate mining. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1299
Venue
PODS
Year
2003
Pagerank
4.1945683e-05
Overall Rank
12,619 | 12.22%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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