Mining Frequent Itemsets with Bit Strings and Trie

Summary: Parameterized frequent-itemset mining using a transaction trie whose nodes store compressed itemset bitmaps and frequencies. Traverses multiple lattice levels to evaluate candidates in fewer passes than level-wise methods. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 9131
Venue: VLDB
Year: 2002
Pagerank: -
Overall Rank: 13,997 | 3.97%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. Nuansri Denwattana (University of Wollongong)

BibTeX Citation

@article{denwattana_vldb02,
        title = {{Mining Frequent Itemsets with Bit Strings and Trie}},
        author = {Denwattana, Nuansri},
        journal = {PVLDB},
        series = {{VLDB} '02},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,292	A Performance Study of Three Disk-based Structures for Indexing and Querying Frequent Itemsets	2013	VLDB
2	2,366	On Differentially Private Frequent Itemset Mining	2013	VLDB
3	12,882	Mining Frequent Itemsets Using Support Constraints	2000	VLDB
4	9,212	Feasible Itemset Distributions in Data Mining: Theory and Application	2003	PODS
5	122	Approximate Frequency Counts over Data Streams	2002	VLDB
6	240	An Effective Hash-Based Algorithm for Mining Association Rules	1995	SIGMOD
7	12,176	Resource-oriented Approximation for Frequent Itemset Mining from Bursty Data Streams	2014	SIGMOD
8	161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD
9	885	Finding Frequent Items in Data Streams	2008	VLDB
10	4,683	False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams	2004	VLDB