DBScholar

Back to papers

Traversing Itemset Lattices with Statistical Metric Pruning

Summary: Introduces tight upper-bound estimation for statistical measures (chi-square, correlation) over supersets of an itemset, enabling pruning despite non-antimonotonicity. Uses these bounds to traverse/prune the itemset lattice efficiently; experiments show substantial speedups. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1212
Venue
PODS
Year
2000
Pagerank
6.907339e-05
Overall Rank
4,092 | 71.93%
DOI
10.1145/335168.335226

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{morishita_pods00,
        address = {New York, NY, USA},
        series = {{PODS} '00},
        title = {{Traversing Itemset Lattices with Statistical Metric Pruning}},
        url = {https://dl.acm.org/doi/10.1145/335168.335226},
        doi = {10.1145/335168.335226},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Morishita, Shinichi and Sese, Jun},
        year = {2000}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
1,972 Mining Significant Graph Patterns by Leap Search 2008 SIGMOD 9.3708222e-05
5,603 Output Space Sampling for Graph Patterns 2009 VLDB 6.153476e-05
12,765 FARMER: Finding Interesting Rule Groups in Microarray Datasets 2004 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 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
240 An Effective Hash-Based Algorithm for Mining Association Rules 1995 SIGMOD 0.0002366381
704 Dynamic Itemset Counting and Implication Rules for Market Basket Data 1997 SIGMOD 0.00014837704
711 Beyond Market Baskets: Generalizing Association Rules to Correlations 1997 SIGMOD 0.00014713746
886 Efficiently Mining Long Patterns from Databases 1998 SIGMOD 0.0001340645
1,535 Exploratory Mining and Pruning Optimizations of Constrained Association Rules 1998 SIGMOD 0.00010463058
1,626 Scalable Techniques for Mining Causal Structures 1998 VLDB 0.00010190299
2,251 Query Flocks: A Generalization of Association-Rule Mining 1998 SIGMOD 8.8684789e-05
4,509 Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules 1996 VLDB 6.6548619e-05
4,565 Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization 1996 SIGMOD 6.6278063e-05
4,766 Mining Optimized Association Rules for Numeric Attributes 1996 PODS 6.5181854e-05
4,969 Optimization of Constrained Frequent Set Queries with 2-variable Constraints 1999 SIGMOD 6.4201643e-05
5,034 Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases 1998 VLDB 6.3930337e-05
5,633 A New Framework For Itemset Generation 1998 PODS 6.1414792e-05
6,280 Efficient Construction of Regression Trees with Range and Region Splitting 1997 VLDB 5.928365e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 704 Dynamic Itemset Counting and Implication Rules for Market Basket Data 1997 SIGMOD
2 7,231 Mining Statistically Significant Connected Subgraphs in Vertex Labeled Graphs 2014 SIGMOD
3 4,354 Online Association Rule Mining 1999 SIGMOD
4 7,466 Mining Attribute-structure Correlated Patterns in Large Attributed Graphs 2012 VLDB
5 12,882 Mining Frequent Itemsets Using Support Constraints 2000 VLDB
6 13 Mining Association Rules between Sets of Items in Large Databases 1993 SIGMOD
7 27 Fast Algorithms for Mining Association Rules 1994 VLDB
8 5,633 A New Framework For Itemset Generation 1998 PODS
9 5,179 An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets 2009 PODS
10 711 Beyond Market Baskets: Generalizing Association Rules to Correlations 1997 SIGMOD