The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
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 · cited 3×
“Level-wise algorithms (Agrawal et al., 1993a) operate level-by-level, bottom-up, in the itemset lattice.”
BackgroundFast 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
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Knowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
Mining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
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
Cited by
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Selecting the right interestingness measure for association patterns
Tan, P.-N., Kumar, V., & Srivastava, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775053 · Cited by 862
A Fast Fixed-Point Algorithm for Independent Component Analysis of Complex Valued Signals
Bingham, E. (2000) · International Journal of Neural Systems · doi:10.1016/s0129-0657(00)00002-8 · Cited by 854
Selecting the right objective measure for association analysis
Tan, P.-N., Kumar, V., & Srivastava, J. (2004) · Information Systems · doi:10.1016/s0306-4379(03)00072-3 · Cited by 568
arules- A Computational Environment for Mining Association Rules and Frequent Item Sets
Hahsler, M., Grün, B., & Hornik, K. (2005) · Journal of Statistical Software · doi:10.18637/jss.v014.i15 · Cited by 552
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
Business intelligence: data mining and optimization for decision making
Vercellis, C., Ahmadi, A., & Mohebi, A. (2016) · doi:10.5281/zenodo.13983826 · Cited by 398
Detecting Group Differences: Mining Contrast Sets
Bay, S. D., & Pazzani, M. J. (2001) · Data Mining and Knowledge Discovery · doi:10.1023/a:1011429418057 · Cited by 370
Finding interesting associations without support pruning
Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J. D., & Yang, C. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.908981 · Cited by 341
Self-citationFuzzy association rules: general model and applications
Delgado, M., Marin, N., Sanchez, D., & Vila, M.-A. (2003) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2003.809896 · Cited by 325
Mining frequent patterns with counting inference
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., & Lakhal, L. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381017 · Cited by 303
Empirical bayes screening for multi-item associations
DuMouchel, W., & Pregibon, D. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502526 · Cited by 266
Metadata
- Authors
- Silverstein, C., Brin, S., & Motwani, R.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 1998-01
- Volume
- 2
- Issue
- 1
- Pages
- 39-68
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1511277043
- Cited by
- 368
- References
- 23
- FWCI
- 40.21
- Type
- journal article
- Language
- en
- Open access
- closed
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.