The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Mining frequent patterns with counting inference
Abstract
ACB(D,?E= A&F"=@F" CI J"FCA; 8:HKMLONQPR1NQSEDT:H; U:V; W 8GA&F XHYHU?</>Z71FC["?I\\F"= 8; K]; ^>C8&; F"7VF*_8&:1?`D?I I W\tab71FDc7d>*I J"F*A&; 8&:1K e = A&; F*A&;gfih:1; C8&; F"7; * .7H?Dk C8&?J*lU>*I I ?X mHn*o opqrks&t*u rHogv r wxv rCypqpr@sp 8:1>C8TA?I ; ?<.F*7z8&:1?/UF"7HU?=H8{F*_c| p} mHn*o opqrH~ f?9 C8]8&:H?9 C8G8?A&7HC7j@?x; _ ?AGA&?X_ AF*KM_ A&?bYH?7b8a?l=1>C8G8&?A&71<`DT; 8&: W F"Y 8E>*UU? 8>Cj@>C<&?"f\\H=@?A&; KE?7b8&<`UF"KE=1>CA&; 71JLNP R1NS/8&F8&:1?T8: A&??`>*I J"F*A&; 8&:HK]< e = A&; F*A&;gB@,I F*<&?`>*71Xzz>CbWGZ; 71?AB C8xLNQPR1NS; <]>*KEF"7HJ8&:1?ZKEF"<8?EU; ?7b8]>CI J"F*A&; 8&:HK]< _ FCA{KE; 7H; 71J`_ A?Y1?78T=1>C8G8?A&7H
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
Formal Concept Analysis: Mathematical Foundations
Ganter, B., Wille, R., & Franzke, C. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,245
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
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
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
Discovery of Frequent Episodes in Event Sequences
Mannila, H., Toivonen, H., & Inkeri Verkamo, A. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009748302351 · Cited by 1,463
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
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
Self-citationEfficiently mining long patterns from databases
Bayardo, R. J. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276313 · Cited by 1,302
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
Pei, J. (2000) · Cited by 828
Efficient mining of association rules using closed itemset lattices
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Information Systems · doi:10.1016/s0306-4379(99)00003-4 · Cited by 768
Self-citationMining the most interesting rules
Bayardo, R. J., & Agrawal, R. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312219 · Cited by 653
Lent, B., Swami, A., & Widom, J. (2002) · Proceedings 13th International Conference on Data Engineering · doi:10.1109/icde.1997.581756 · Cited by 374
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
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., & Lakhal, L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44957-4_65 · Cited by 348
Self-citationPincer-search: A new algorithm for discovering the maximum frequent set
Lin, D.-I., & Kedem, Z. M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0100980 · Cited by 277
Metarule-Guided Mining of Multi-Dimensional Association RulesUsing Data Cubes
Kamber, M., Han, J., & Chiang, J. Y. (1997) · Cited by 209
Cited by
CHARM: An Efficient Algorithm for Closed Itemset Mining
Zaki, M. J., & Hsiao, C.-J. (2002) · Proceedings of the 2002 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.27 · Cited by 929
Efficient algorithms for mining closed itemsets and their lattice structure
Zaki, M. J., & Hsiao, C.-J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.60 · Cited by 681
Ceglar, A., & Roddick, J. F. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132958 · Cited by 324
Mining All Non-derivable Frequent Itemsets
Calders, T., & Goethals, B. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45681-3_7 · Cited by 295
Borgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
Metadata
- Authors
- Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., & Lakhal, L.
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2000-12
- Volume
- 2
- Issue
- 2
- Pages
- 66-75
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W2129555316
- Cited by
- 303
- References
- 24
- FWCI
- 35.35
- 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.