A New Framework For Itemset Generation
Summary: Introduce “strongly collective itemsets”: a criterion prioritizing inter-item correlation over absolute support for association discovery. Provide an efficient, statistically robust algorithm using relative measures that scales to dense/heterogeneous databases and uncovers negative associations. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Charu C. Aggarwal (IBM)
- 2. Philip S. Yu (IBM)
BibTeX Citation
@inproceedings{aggarwal_pods98,
address = {New York, NY, USA},
series = {{PODS} '98},
title = {{A New Framework For Itemset Generation}},
url = {https://dl.acm.org/doi/10.1145/275487.275490},
doi = {10.1145/275487.275490},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Aggarwal, Charu C. and Yu, Philip S.},
year = {1998}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,180 | Traversing Itemset Lattices with Statistical Metric Pruning | 2000 | PODS | 6.7554731e-05 |
| 5,302 | An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets | 2009 | PODS | 6.1889036e-05 |
| 13,172 | Mining Frequent Itemsets Using Support Constraints | 2000 | VLDB | 4.9793485e-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.00064420972 |
| 475 | Mining Generalized Association Rules | 1995 | VLDB | 0.00017672519 |
| 620 | Mining Quantitative Association Rules in Large Relational Tables | 1996 | SIGMOD | 0.00015502611 |
| 721 | Dynamic Itemset Counting and Implication Rules for Market Basket Data | 1997 | SIGMOD | 0.0001452081 |
| 731 | Beyond Market Baskets: Generalizing Association Rules to Correlations | 1997 | SIGMOD | 0.00014394521 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 473 | Sampling Large Databases for Association Rules | 1996 | VLDB |
| 2 | 13,172 | Mining Frequent Itemsets Using Support Constraints | 2000 | VLDB |
| 3 | 475 | Mining Generalized Association Rules | 1995 | VLDB |
| 4 | 731 | Beyond Market Baskets: Generalizing Association Rules to Correlations | 1997 | SIGMOD |
| 5 | 573 | An Efficient Algorithm for Mining Association Rules in Large Databases | 1995 | VLDB |
| 6 | 29 | Fast Algorithms for Mining Association Rules | 1994 | VLDB |
| 7 | 721 | Dynamic Itemset Counting and Implication Rules for Market Basket Data | 1997 | SIGMOD |
| 8 | 4,444 | Online Association Rule Mining | 1999 | SIGMOD |
| 9 | 250 | An Effective Hash-Based Algorithm for Mining Association Rules | 1995 | SIGMOD |
| 10 | 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD |