Database Paper Browser

Back to papers

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
3004
Venue
SIGMOD
Year
1998
Pagerank
0.00016058396
Overall Rank
840 | 94.16%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Rank Citing Paper Year Venue Pagerank
181 Mining Frequent Patterns without Candidate Generation 2000 SIGMOD 0.00036992674
277 Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications 1998 SIGMOD 0.00029311426
3,055 Mining Compressed Frequent-Pattern Sets 2005 VLDB 7.6448739e-05
3,100 Crowd Mining 2013 SIGMOD 7.5634778e-05
3,454 Traversing Itemset Lattices with Statistical Metric Pruning 2000 PODS 7.0778482e-05
3,623 Cache-conscious Frequent Pattern Mining on a Modern Processor 2005 VLDB 6.9062146e-05
4,258 Online Association Rule Mining 1999 SIGMOD 6.3148619e-05
4,565 Constructing and Exploring Composite Items 2010 SIGMOD 6.081125e-05
4,919 Optimization of Constrained Frequent Set Queries with 2-variable Constraints 1999 SIGMOD 5.8256934e-05
5,149 Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach 2021 VLDB 5.6627295e-05
5,483 rho-uncertainty: Inference-Proof Transaction Anonymization 2010 VLDB 5.4828795e-05
8,315 Computational Complexity of Itemset Frequency Satisfiability 2004 PODS 4.5435639e-05
8,321 A Condensed Representation to Find Frequent Patterns 2001 PODS 4.5435639e-05
8,732 Relative Risk and Odds Ratio: A Data Mining Perspective 2005 PODS 4.4576449e-05
9,064 Feasible Itemset Distributions in Data Mining: Theory and Application 2003 PODS 4.4039656e-05
12,645 Mining Long Sequential Patterns in a Noisy Environment 2002 SIGMOD 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.

Rank Cited Paper Year Venue Pagerank
13 Mining Association Rules between Sets of Items in Large Databases 1993 SIGMOD 0.0010864752
36 Fast Algorithms for Mining Association Rules 1994 VLDB 0.00076161096
117 An Effective Hash-Based Algorithm for Mining Association Rules 1995 SIGMOD 0.00045896865
547 An Efficient Algorithm for Mining Association Rules in Large Databases 1995 VLDB 0.00020420717
657 Dynamic Itemset Counting and Implication Rules for Market Basket Data 1997 SIGMOD 0.00018553891
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
4,307 Mining Periodic Patterns with Gap Requirement from Sequences 2005 SIGMOD 6.2885419e-05
13,889 Towards Data Mining Benchmarking: A Test Bed for Performance Study of Frequent Pattern Mining 2000 SIGMOD -
12,043 A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery 2013 SIGMOD 4.1945683e-05
7,246 Finding Relevant Patterns in Bursty Sequences 2008 VLDB 4.790704e-05
3,055 Mining Compressed Frequent-Pattern Sets 2005 VLDB 7.6448739e-05
5,772 Mining Frequent Patterns with Differential Privacy 2013 VLDB 5.3322378e-05
10,975 Language-Model Based Informed Partition of Databases to Speed Up Pattern Mining 2024 SIGMOD 4.1945683e-05
547 An Efficient Algorithm for Mining Association Rules in Large Databases 1995 VLDB 0.00020420717
36 Fast Algorithms for Mining Association Rules 1994 VLDB 0.00076161096
181 Mining Frequent Patterns without Candidate Generation 2000 SIGMOD 0.00036992674