The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
arules- A Computational Environment for Mining Association Rules and Frequent Item Sets
Open accessAbstract
Mining frequent itemsets and association rules is a popular and well researched approach for discovering interesting relationships between variables in large databases. The R package arules presented in this paper provides a basic infrastructure for creating and manipulating input data sets and for analyzing the resulting itemsets and rules. The package also includes interfaces to two fast mining algorithms, the popular C implementations of Apriori and Eclat by Christian Borgelt. These algorithms can be used to mine frequent itemsets, maximal frequent itemsets, closed frequent itemsets and association 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
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
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
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
Scalable algorithms for association mining
Zaki, M. J. (2000) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.846291 · Cited by 1,751
Knowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
Data Mining Techniques: For Marketing, Sales, and Customer Support
Berry, M. J., & Linoff, G. S. (1997) · University of Maribor digital library (University of Maribor) · Cited by 1,736
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
UML Distilled: A Brief Guide to the Standard Object Modeling Language
Fowler, M. (1997) · Cited by 1,472
Discovering Frequent Closed Itemsets for Association Rules
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_25 · Cited by 1,378
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Algorithms for association rule mining — a general survey and comparison
Hipp, J., Güntzer, U., & Nakhaeizadeh, G. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360421 · Cited by 962
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
Pruning and summarizing the discovered associations
Liu, B., Hsu, W., & Ma, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312216 · Cited by 418
EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT
Borgelt, C. (2003) · Cited by 394
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
Silverstein, C., Brin, S., & Motwani, R. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009713703947 · Cited by 368
Constraint-based rule mining in large, dense databases
Bayardo, R. J., Agrawal, R., & Gunopulos, D. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754924 · Cited by 362
Induction of Association Rules: Apriori Implementation
Borgelt, C., & Kruse, R. (2002) · Compstat · doi:10.1007/978-3-642-57489-4_59 · Cited by 288
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
Advances in frequent itemset mining implementations: report on FIMI'03
Goethals, B., & Zaki, M. J. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007744 · Cited by 240
Information and Computer Science
Kimble, G. W. (1975) · Medical Entomology and Zoology · Cited by 200
Finding localized associations in market basket data
Aggarwal, C. C., Procopiuc, C. M., & Yu, P. S. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.979972 · Cited by 126
Relationship-Based Clustering and Visualization for High-Dimensional Data Mining
Strehl, A. L., & Ghosh, J. (2003) · INFORMS journal on computing · doi:10.1287/ijoc.15.2.208.14448 · Cited by 120
Mining quantitative association rules
Yong, N. (2000) · Journal of Guangxi University · Cited by 86
New probabilistic interest measures for association rules
Hahsler, M., & Hornik, K. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11502 · Cited by 70
Self-citationVisual Comparison of Association Rules
Hofmann, H., & Wilhelm, A. (2001) · Computational Statistics · doi:10.1007/s001800100075 · Cited by 37
Cited by
Open-source machine learning: R meets Weka
Hornik, K., Buchta, C., & Zeileis, A. (2009) · Computational Statistics · doi:10.1007/s00180-008-0119-7 · Cited by 385
Self-citationNoguchi, Y., Tachi, T., & Teramachi, H. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab347 · Cited by 285
A Taxonomy of Evaluation Methods for Information Systems Artifacts
Prat, N., Comyn-Wattiau, I., & Akoka, J. (2015) · Journal of Management Information Systems · doi:10.1080/07421222.2015.1099390 · Cited by 278
Gao, Y., Xu, A., Hu, P. J.-H., & Cheng, T.-H. (2017) · Decision Support Systems · doi:10.1016/j.dss.2017.01.007 · Cited by 26
An extended transcription factor regulatory network controls hepatocyte identity
Dubois‐Chevalier, J., Gheeraert, C., Berthier, A., Boulet, C., Dubois, V., Guille, L., Fourcot, M., Marot, G., Gauthier, K., Dubuquoy, L., et al. (2023) · EMBO Reports · doi:10.15252/embr.202357020 · Cited by 6
Metadata
- Authors
- Hahsler, M., Grün, B., & Hornik, K.
- Venue
- Journal of Statistical Software
- Publisher
- Foundation for Open Access Statistic
- Published
- 2005
- Volume
- 14
- Issue
- 15
- ISSN
- 1548-7660 (ISSN-L)
- OpenAlex
- W2133610185
- Cited by
- 552
- References
- 32
- FWCI
- 12.57
- Type
- journal article
- Language
- en
- Open access
- diamond
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.