The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Isolated items discarding strategy for discovering high utility itemsets
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
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170072 · Cited by 4,551
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
Integrating classification and association rule mining
Liu, B., Hsu, W., & Ma, Y. (1998) · Cited by 2,247
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
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 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
Data Mining: Concepts, Models, Methods, and Algorithms
(2003) · Technometrics · doi:10.1198/tech.2003.s785 · Cited by 1,369
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur⋆, S. (1997) · ACM SIGMOD Record · doi:10.1145/253262.253325 · Cited by 639
A Foundational Approach to Mining Itemset Utilities from Databases
Yao, H., Hamilton, H. J., & Butz, C. J. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.51 · Cited by 569
Fast algorithms for frequent itemset mining using FP-trees
Grahne, G., & Zhu, J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.166 · Cited by 549
A Tree Projection Algorithm for Generation of Frequent Item Sets
Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1693 · Cited by 510
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · ACM SIGMOD Record · doi:10.1145/568271.223813 · Cited by 491
Chan, R., Yang, Q., & Shen, Y.-D. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250893 · Cited by 405
CAEP: Classification by Aggregating Emerging Patterns
Dong, G., Zhang, X., Wong, L., & Li, J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46846-3_4 · Cited by 379
Mining itemset utilities from transaction databases
Yao, H., & Hamilton, H. J. (2005) · Data & Knowledge Engineering · doi:10.1016/j.datak.2005.10.004 · Cited by 371
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
Weighted Association Rule Mining using weighted support and significance framework
Feng, T., Murtagh, F. D., & Farid, M. M. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956836 · Cited by 352
Mining frequent item sets by opportunistic projection
Liu, J., Pan, Y., Wang, K., & Han, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775081 · Cited by 189
A Unified Framework for Utility Based Measures for Mining Itemsets
Yao, H., Hamilton, H. J., & Geng, L. (2006) · Cited by 105
TBAR: An efficient method for association rule mining in relational databases
Berzal, F., Cubero, J.-C., Marín, N., & Serrano, J.-M. (2001) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(00)00055-0 · Cited by 94
Mining weighted association rules
Lu, S., Hu, H., & Li, F. (2001) · Intelligent Data Analysis · doi:10.3233/ida-2001-5303 · Cited by 85
Extracting Share Frequent Itemsets with Infrequent Subsets
Barber, B., & Hamilton, H. J. (2003) · Data Mining and Knowledge Discovery · doi:10.1023/a:1022419032620 · Cited by 78
Objective-oriented utility-based association mining
Shen, Y.-D., Zhang, Z., & Yang, Q. (2003) · Proceedings · doi:10.1109/icdm.2002.1183938 · Cited by 76
Share based measures for itemsets
Carter, C. L., Hamilton, H. J., & Cercone, N. J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63223-9_102 · Cited by 48
Cited by
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases
Ahmed, C. F., Tanbeer, S. K., Jeong, B.-S., & Lee, Y.-K. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.46 · Cited by 583
Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases
Tseng, V. S., Shie, B.-E., Wu, C.-W., & Yu, P. S. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.59 · Cited by 570
UP-Growth: an efficient algorithm for high utility itemset mining
Tseng, V. S., Wu, C.-W., Shie, B.-E., & Yu, P. S. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835839 · Cited by 442
A Survey of Utility-Oriented Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V. S., & Yu, P. S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2942594 · Cited by 257
Metadata
- Authors
- Li, Y.-C., Yeh, J.-S., & Chang, C.-C.
- Venue
- Data & Knowledge Engineering
- Publisher
- Elsevier BV
- Published
- 2008-01
- Volume
- 64
- Issue
- 1
- Pages
- 198-217
- ISSN
- 0169-023X (ISSN-L)
- OpenAlex
- W2076404872
- Cited by
- 267
- References
- 28
- FWCI
- 15.09
- 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.