A fast high utility itemsets mining algorithm
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Association rule mining (ARM) identifies frequent itemsets from databases and generates association rules by considering each item in equal value. However, items are actually different in many aspects in a number of real applications, such as retail marketing, network log, etc. The difference between items makes a strong impact on the decision making in these applications. Therefore, traditional ARM cannot meet the demands arising from these applications. By considering the different values of individual items as utilities, utility mining focuses on identifying the itemsets with high utilities. As "downward closure property" doesn't apply to utility mining, the generation of candidate itemsets is the most costly in terms of time and memory space. In this paper, we present a Two-Phase algorithm to efficiently prune down the number of candidates and can precisely obtain the complete set of high utility itemsets. In the first phase, we propose a model that applies the "transaction-weighted downward closure property" on the search space to expedite the identification of candidates. In the second phase, one extra database scan is performed to identify the high utility itemsets. We also parallelize our algorithm on shared memory multi-process architecture using Common Count Partitioned Database (CCPD) strategy. We verify our algorithm by applying it to both synthetic and real databases. It performs very efficiently in terms of speed and memory cost, and shows good scalability on multiple processors, even on large databases that are difficult for existing algorithms to handle.
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
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
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
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
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
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
What makes patterns interesting in knowledge discovery systems
Silberschatz, A., & Tuzhilin, A. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553165 · Cited by 679
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
Parallel and distributed association mining: a survey
Zaki, M. J. (1999) · IEEE Concurrency · doi:10.1109/4434.806975 · Cited by 475
Chan, R., Yang, Q., & Shen, Y.-D. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250893 · Cited by 405
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
Efficient mining of weighted association rules (WAR)
Wang, W., Yang, J., & Yu, P. S. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347149 · Cited by 233
Parallel data mining for association rules on shared-memory multi-processors
Zaki, M. J., Ogihara, M., Parthasarathy, S., & Li, W. (1996) · ACM/IEEE Conference on Supercomputing (SC) · doi:10.1145/369028.369117 · Cited by 129
A Statistical Theory for Quantitative Association Rules
Aumann, Y., & Lindell, Y. (2003) · Journal of Intelligent Information Systems · doi:10.1023/a:1022812808206 · Cited by 123
Discovering associations with numeric variables
Webb, G. I. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502569 · Cited by 93
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
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
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
Metadata
- Authors
- Liu, Y., Liao, W.-K., & Choudhary, A.
- Venue
- Proceedings of the 1st international workshop on Utility-based data mining - UBDM '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 90-99
- OpenAlex
- W2115274736
- Cited by
- 364
- References
- 18
- FWCI
- 5.93
- Type
- conference paper
- 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.