The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases
Abstract
Recently, high utility pattern (HUP) mining is one of the most important research issues in data mining due to its ability to consider the nonbinary frequency values of items in transactions and different profit values for every item. On the other hand, incremental and interactive data mining provide the ability to use previous data structures and mining results in order to reduce unnecessary calculations when a database is updated, or when the minimum threshold is changed. In this paper, we propose three novel tree structures to efficiently perform incremental and interactive HUP mining. The first tree structure, Incremental HUP Lexicographic Tree ({\rm IHUP}_{{\rm {L}}}-Tree), is arranged according to an item's lexicographic order. It can capture the incremental data without any restructuring operation. The second tree structure is the IHUP Transaction Frequency Tree ({\rm IHUP}_{{\rm {TF}}}-Tree), which obtains a compact size by arranging items according to their transaction frequency (descending order). To reduce the mining time, the third tree, IHUP-Transaction-Weighted Utilization Tree ({\rm IHUP}_{{\rm {TWU}}}-Tree) is designed based on the TWU value of items in descending order. Extensive performance analyses show that our tree structures are very efficient and scalable for incremental and interactive HUP mining.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
Chan, R., Yang, Q., & Shen, Y.-D. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250893 · Cited by 405
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
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
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
Fast and memory efficient mining of frequent closed itemsets
Lucchese, C., Orlando, S., & Perego, R. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.10 · Cited by 231
TFP: an efficient algorithm for mining top-k frequent closed itemsets
Wang, J., Han, J., Lu, Y., & Tzvetkov, P. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.81 · Cited by 218
Incremental mining of frequent patterns without candidate generation or support constraint
Cheung, W., & Zaiane, O. R. (2003) · Seventh International Database Engineering and Applications Symposium, 2003. Proceedings. · doi:10.1109/ideas.2003.1214917 · Cited by 216
Incrementally fast updated frequent pattern trees☆
HONG, T., LIN, C., & WU, Y. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2007.04.009 · Cited by 185
Xiong, H., Tan, P., & Kumar, V. (2006) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0043-9 · Cited by 154
WFIM: Weighted Frequent Itemset Mining with a weight range and a minimum weight
Yun, U., & Leggett, J. J. (2005) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.76 · Cited by 151
CanTree: a canonical-order tree for incremental frequent-pattern mining
Leung, C. K.-S., Khan, Q., Li, Z., & Hoque, T. (2006) · Knowledge and Information Systems · doi:10.1007/s10115-006-0032-8 · Cited by 140
An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures
Koh, J.-L., & Shieh, S.-F. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24571-1_38 · Cited by 127
BitTableFI: An efficient mining frequent itemsets algorithm
Dong, J., & Han, M. (2006) · Knowledge-Based Systems · doi:10.1016/j.knosys.2006.08.005 · Cited by 121
A transaction mapping algorithm for frequent itemsets mining
Song, M., & Rajasekaran, S. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.1599386 · Cited by 104
High-utility pattern mining: A method for discovery of high-utility item sets
Hu, J., & Mojsilović, A. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.02.003 · Cited by 102
CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach
Erwin, A., Gopalan, R. P., & Achuthan, N. R. (2007) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2007.120 · Cited by 97
Efficient mining of weighted interesting patterns with a strong weight and/or support affinity
Yun, U. (2007) · Information Sciences · doi:10.1016/j.ins.2007.03.018 · Cited by 89
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
CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining
Tanbeer, S. K., Ahmed, C. F., Jeong, B.-S., & Lee, Y.-K. (2008) · Springer eBooks · doi:10.1007/978-3-540-68125-0_108 · Cited by 74
Self-citationWAR: Weighted Association Rules for Item Intensities
Wang, W. W., Yang, J., & Yu, P. S. (2004) · Knowledge and Information Systems · doi:10.1007/bf02637156 · Cited by 55
Hardware-Enhanced Association Rule Mining with Hashing and Pipelining
Wen, Y.-H., Huang, J.-W., & Chen⋆, M.-S. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.39 · Cited by 38
A Fast Algorithm for Maintenance of Association Rules in Incremental Databases
Li, X., Deng, Z., & Tang, S. (2006) · Lecture notes in computer science · doi:10.1007/11811305_5 · Cited by 37
EDUA: An efficient algorithm for dynamic database mining
Zhang, S., Zhang, J., & Chengqi Zhang, B. (2007) · Information Sciences · doi:10.1016/j.ins.2007.01.034 · Cited by 31
Cited by
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
- Ahmed, C. F., Tanbeer, S. K., Jeong, B.-S., & Lee, Y.-K.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2009-12
- Volume
- 21
- Issue
- 12
- Pages
- 1708-1721
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2151028259
- Cited by
- 583
- References
- 30
- FWCI
- 23.83
- 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.