The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Beyond market baskets: generalizing association rules to correlations
Open accessAbstract
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confidence, are intended to identify rules of the type, “A customer purchasing item A often also purchases item B.” Motivated by the goal of generalizing beyond market baskets and the association rules used with them, we develop the notion of mining rules that identify correlations (generalizing associations), and we consider both the absence and presence of items as a basis for generating rules. We propose measuring significance of associations via the chi-squared test for correlation from classical statistics. This leads to a measure that is upward closed in the itemset lattice, enabling us to reduce the mining problem to the search for a border between correlated and uncorrelated itemsets in the lattice. We develop pruning strategies and devise an efficient algorithm for the resulting problem. We demonstrate its effectiveness by testing it on census data and finding term dependence in a corpus of text documents, as well as on synthetic data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Pearson, K. (1900) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440009463897 · Cited by 4,069
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
Database mining: a performance perspective
Agrawal, R., Imielinski, T., & Swami, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250074 · Cited by 1,505
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223813 · Cited by 1,406
A Survey of Exact Inference for Contingency Tables
Agresti, A. (1992) · Statistical Science · doi:10.1214/ss/1177011454 · Cited by 1,097
Knowledge discovery in databases
FrawleyWilliam, J., Piatetsky-ShapiroGregory, & MatheusChristopher, J. (1992) · AI Magazine · doi:10.5555/140629.140633 · Cited by 1,055
Discovery of Multiple-Level Association Rules from Large Databases
Han, J., & Fu, Y. (1995) · Cited by 922
Storing a Sparse Table with 0 (1) Worst Case Access Time
Fredman, M. L., Komlós, J., & Szemerédi, E. (1984) · Journal of the ACM · doi:10.1145/828.1884 · Cited by 748
Finding interesting rules from large sets of discovered association rules
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., & Verkamo, A. I. (1994) · Proceedings of the third international conference on Information and knowledge management - CIKM '94 · doi:10.1145/191246.191314 · Cited by 712
Proceedings of the International Conference on Very Large Data Bases
Kerr, D. S. (1975) · ACM eBooks · Cited by 701
Research problems in data warehousing
Widom, J. (1995) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/221270.221319 · Cited by 698
Proceedings of the 30th IEEE symposium on Foundations of computer science
Galil, Z., & Blum, E. K. (1994) · Cited by 677
Efficient algorithms for discovering association rules
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1994) · Cited by 624
Dynamic Perfect Hashing: Upper and Lower Bounds
Dietzfelbinger, M., Karlin, A. R., Mehlhorn, K., der Heide, F. M. A., Rohnert, H., & Tarjan, R. E. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21968 · Cited by 421
Proceedings of the 31st international conference on Very large data bases
Bratbergsengen, K. (2005) · International Conference on Multimodal Interfaces · Cited by 414
Mining optimized association rules for numeric attributes
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996) · Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/237661.237708 · Cited by 210
Cited by
Alternative interest measures for mining associations in databases
Omiecinski, E. R. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1161582 · Cited by 429
Borgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
Profiling relational data: a survey
Abedjan, Z., Golab, L., & Naumann, F. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0389-y · Cited by 283
On the credibility perception of news on Twitter: Readers, topics and features
Shariff, S. M., Zhang, X., & Sanderson, M. (2017) · Computers in Human Behavior · doi:10.1016/j.chb.2017.06.026 · Cited by 49
Detecting Systematic Deviations in Data and Models
Speakman, S., Tadesse, G. A., Cintas, C., Ogallo, W., Akumu, T., & Oshingbesan, A. (2023) · Computer · doi:10.1109/mc.2022.3213209 · Cited by 9
Metadata
- Authors
- Brin, S., Motwani, R., & Silverstein, C.
- Venue
- ACM SIGMOD Record
- Published
- 1997-06
- Volume
- 26
- Issue
- 2
- Pages
- 265-276
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2997709717
- Cited by
- 308
- References
- 19
- FWCI
- 4.42
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.