The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
An effective hash-based algorithm for mining association rules
Open accessAbstract
In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items which appear in a sufficient number of transactions. The problem of discovering large itemsets can be solved by constructing a candidate set of itemsets first and then, identifying, within this candidate set, those itemsets that meet the large itemset requirement. Generally this is done iteratively for each large k-itemset in increasing order of k where a large k-itemset is a large itemset with k items. To determine large itemsets from a huge number of candidate large itemsets in early iterations is usually the dominating factor for the overall data mining performance. To address this issue, we propose an effective hash-based algorithm for the candidate set generation. Explicitly, the number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck. Note that the generation of smaller candidate sets enables us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly. Extensive simulation study is conducted to evaluate performance of the proposed algorithm.
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
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Knowledge Discovery in Databases: An Attribute-Oriented Approach
Han, J., Cai, Y., & Cercone, N. J. (1992) · Very Large Data Bases · Cited by 447
An Interval Classifier for Database Mining Applications
Agrawal, R., Ghosh, S. P., Imieliński, T., Iyer, B. R., & Swami, A. K. (1992) · Very Large Data Bases · Cited by 294
File structures using hashing functions
Coffman, E. G., & Eve, J. K. (1970) · Communications of the ACM · doi:10.1145/362686.362693 · Cited by 100
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
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
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Han, J., Pei, J., Yin, Y., & Mao, R. (2004) · Data Mining and Knowledge Discovery · doi:10.1023/b:dami.0000005258.31418.83 · Cited by 2,629
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Self-citationAnalysis of recommendation algorithms for e-commerce
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2000) · Proceedings of the 2nd ACM conference on Electronic commerce · doi:10.1145/352871.352887 · Cited by 1,827
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
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
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
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
Efficiently 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
Approximate frequency counts over data streams
Manku, G. S., & Motwani, R. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367508 · Cited by 1,178
Parallel mining of association rules
Agrawal, R., & Shafer, J. C. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553164 · Cited by 1,064
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Approximate Frequency Counts over Data Streams
Manku, G. S., & Motwani, R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50038-x · Cited by 941
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
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
Maintenance of discovered association rules in large databases: an incremental updating technique
Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492094 · Cited by 800
Mining association rules with multiple minimum supports
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.312274 · Cited by 738
Exploratory mining and pruning optimizations of constrained associations rules
Ng, R. T., Lakshmanan, L. V. S., Han, J., & Pang, A. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276307 · Cited by 715
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
Fast Time Sequence Indexing for Arbitrary Lp Norms
Yi, B.-K., & Faloutsos, C. (2018) · doi:10.1184/r1/6605618 · Cited by 650
MAFIA: a maximal frequent itemset algorithm for transactional databases
Burdick, D., Calimlim, M., & Gehrke, J. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914857 · Cited by 612
Fast vertical mining using diffsets
Zaki, M. J., & Gouda, K. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956788 · Cited by 593
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Wang, J., Han, J., & Pei, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956779 · Cited by 585
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233311 · Cited by 581
Data Mining in Healthcare and Biomedicine: A Survey of the Literature
Yoo, I., Alafaireet, P., Marinov, M., Pena-Hernandez, K., Gopidi, R., Chang, J.-F., & Hua, L. (2012) · Journal of Medical Systems · doi:10.1007/s10916-011-9710-5 · Cited by 550
Parallel and distributed association mining: a survey
Zaki, M. J. (1999) · IEEE Concurrency · doi:10.1109/4434.806975 · Cited by 475
A fast distributed algorithm for mining association rules
Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568665 · Cited by 432
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
A taxonomy of sequential pattern mining algorithms
Mabroukeh, N. R., & Ezeife, C. I. (2010) · ACM Computing Surveys · doi:10.1145/1824795.1824798 · Cited by 400
Business intelligence: data mining and optimization for decision making
Vercellis, C., Ahmadi, A., & Mohebi, A. (2016) · doi:10.5281/zenodo.13983826 · Cited by 398
Efficiently mining long patterns from databases
Bayardo, R. J. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276313 · Cited by 398
Visualization techniques for mining large databases: a comparison
Keim, D. A., & Kriegel, H.-P. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553159 · Cited by 374
A General Incremental Technique for Maintaining Discovered Association Rules
Cheung, D. W., Lee, S. D., & Kao, B. (1997) · Database Systems for Advanced Applications '97 · doi:10.1142/9789812819536_0020 · Cited by 371
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
A fast high utility itemsets mining algorithm
Liu, Y., Liao, W.-K., & Choudhary, A. (2005) · Proceedings of the 1st international workshop on Utility-based data mining - UBDM '05 · doi:10.1145/1089827.1089839 · Cited by 364
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
Using association rules for product assortment decisions: a case study
Brijs, T., Swinnen, G., Vanhoof, K., & Wets, G. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312241 · Cited by 361
Efficient mining of association rules in distributed databases
Cheung, D. W., Ng, V. T., Fu, A. W., & Fu, Y. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553158 · Cited by 345
Effective Pattern Discovery for Text Mining
Zhong, N., Li, Y., & Wu, S.-T. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.211 · Cited by 340
Mining multiple-level association rules in large databases
Han, J., & Fu, Y. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.806937 · Cited by 327
Data mining for path traversal patterns in a web environment
Chen, M.-S., Park, J. S., & Yu, P. S. (2002) · Proceedings of 16th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1996.507986 · Cited by 327
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
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · ACM SIGMOD Record · doi:10.1145/253262.253327 · Cited by 308
Parallel Algorithms for Discovery of Association Rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Li, W. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009773317876 · Cited by 305
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
Pincer-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
Mining for strong negative associations in a large database of customer transactions
Savasere, A., Omiecinski, E., & Navathe, S. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655812 · Cited by 268
Isolated items discarding strategy for discovering high utility itemsets
Li, Y.-C., Yeh, J.-S., & Chang, C.-C. (2008) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.06.009 · Cited by 267
MAFIA: a maximal frequent itemset algorithm
Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., & Yiu, T. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.183 · Cited by 267
Association rules over interval data
Miller, R. J., & Yang, Y. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253361 · Cited by 266
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233313 · Cited by 265
Parallel Algorithms for Discovery of Association Rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., Li, W., Stolorz, P., & Musick, R. (1997) · Scalable High Performance Computing for Knowledge Discovery and Data Mining · doi:10.1007/978-1-4615-5669-5_1 · Cited by 264
Frequent itemset mining: A 25 years review
Luna, J. M., Fournier‐Viger, P., & Ventura, S. (2019) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1329 · Cited by 258
(2003) · Cited by 165
Constrained frequent pattern mining: a pattern-growth view
Pei, J., & Han, J. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568580 · Cited by 133
Metadata
- Authors
- Park, J. S., Chen, M.-S., & Yu, P. S.
- Venue
- Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 175-186
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2030969394
- Cited by
- 1,406
- References
- 11
- FWCI
- 40.15
- Type
- conference paper
- 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.