Efficiently Mining Long Patterns from Databases

Summary: Pattern-mining algorithm scales linearly with the number of maximal patterns, independent of longest pattern length. Compared to Apriori, whose cost grows exponentially with pattern length, it achieves order-of-magnitude speedups for long patterns. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3066
Venue: SIGMOD
Year: 1998
Pagerank: 0.0001340645
Overall Rank: 886 | 93.93%
DOI: 10.1145/276304.276313

Incoming Non-self Citations Over Time

Authors

1. Roberto J. Bayardo Jr. (IBM)

BibTeX Citation

@inproceedings{jr_sigmod98,
        title = {{Efficiently Mining Long Patterns from Databases}},
        author = {Bayardo, Jr., Roberto J.},
        series = {{SIGMOD} '98},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/276304.276313},
        url = {https://dl.acm.org/doi/10.1145/276304.276313},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027981772
304	Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications	1998	SIGMOD	0.00021917388
2,789	Crowd Mining	2013	SIGMOD	8.1203892e-05
3,324	Mining Compressed Frequent-Pattern Sets	2005	VLDB	7.5198821e-05
3,969	Cache-conscious Frequent Pattern Mining on a Modern Processor	2005	VLDB	6.9837297e-05
4,092	Traversing Itemset Lattices with Statistical Metric Pruning	2000	PODS	6.907339e-05
4,354	Online Association Rule Mining	1999	SIGMOD	6.7479905e-05
4,758	Constructing and Exploring Composite Items	2010	SIGMOD	6.521122e-05
4,969	Optimization of Constrained Frequent Set Queries with 2-variable Constraints	1999	SIGMOD	6.4201643e-05
5,197	Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach	2021	VLDB	6.3229492e-05
5,494	rho-uncertainty: Inference-Proof Transaction Anonymization	2010	VLDB	6.1997164e-05
8,551	Computational Complexity of Itemset Frequency Satisfiability	2004	PODS	5.4119882e-05
8,557	A Condensed Representation to Find Frequent Patterns	2001	PODS	5.4119882e-05
8,993	Relative Risk and Odds Ratio: A Data Mining Perspective	2005	PODS	5.3372281e-05
9,212	Feasible Itemset Distributions in Data Mining: Theory and Application	2003	PODS	5.3058708e-05
12,838	Mining Long Sequential Patterns in a Noisy Environment	2002	SIGMOD	5.093636e-05

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
27	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00052255472
240	An Effective Hash-Based Algorithm for Mining Association Rules	1995	SIGMOD	0.0002366381
558	An Efficient Algorithm for Mining Association Rules in Large Databases	1995	VLDB	0.00016530269
704	Dynamic Itemset Counting and Implication Rules for Market Basket Data	1997	SIGMOD	0.00014837704

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,230	Mining Periodic Patterns with Gap Requirement from Sequences	2005	SIGMOD
2	14,090	Towards Data Mining Benchmarking: A Test Bed for Performance Study of Frequent Pattern Mining	2000	SIGMOD
3	12,241	A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery	2013	SIGMOD
4	7,691	Finding Relevant Patterns in Bursty Sequences	2008	VLDB
5	3,324	Mining Compressed Frequent-Pattern Sets	2005	VLDB
6	5,538	Mining Frequent Patterns with Differential Privacy	2013	VLDB
7	11,188	Language-Model Based Informed Partition of Databases to Speed Up Pattern Mining	2024	SIGMOD
8	558	An Efficient Algorithm for Mining Association Rules in Large Databases	1995	VLDB
9	27	Fast Algorithms for Mining Association Rules	1994	VLDB
10	161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD