Email this article An Suitable Minimum Utility Threshold By Trial And Error Is A Tedious Process For Users
Abstract
We address the above issues by proposing another system for top-k high utility itemset mining, where k is the coveted number of HUIs to be mined. Two sorts of effective calculations named TKU (mining Top-K Utility item sets) and TKO (mining Top-K utility item sets in One stage) are proposed for mining such item sets without the need to set min util. We give a basic correlation of the two calculations with exchanges on their preferences and constraints. Exact assessments on both genuine and engineered datasets demonstrate that the execution of the proposed calculations is near that of the ideal instance of cutting edge utility mining algorithms.
References
R. Agrawal and R. Srikant, “Fast algorithms for mining association rules,†in Proc. Int. Conf. Very Large Data Bases, 1994, pp. 487– 499.
C. Ahmed, S. Tanbeer, B. Jeong, and Y. Lee, “Efficient tree structures for high-utility pattern mining in incremental databases,†IEEE Trans. Knowl. Data Eng., vol. 21, no. 12, pp. 1708–1721, Dec. 2009.
K. Chuang, J. Huang, and M. Chen, “Mining top-k frequent patterns in the presence of the memory constraint,†VLDB J., vol. 17, pp. 1321–1344, 2008.
R. Chan, Q. Yang, and Y. Shen, “Mining high-utility itemsets,†in Proc. IEEE Int. Conf. Data Mining, 2003, pp. 19–26.
P. Fournier-Viger and V. S. Tseng, “Mining top-k sequential rules,†in Proc. Int. Conf. Adv. Data Mining Appl., 2011, pp. 180–194.
P. Fournier-Viger, C.Wu, and V. S. Tseng, “Mining top-k association rules,†in Proc. Int. Conf. Can. Conf. Adv. Artif. Intell., 2012, pp. 61–73.
P. Fournier-Viger, C. Wu, and V. S. Tseng, “Novel concise representations of high utility itemsets using generator patterns,†in Proc. Int. Conf. Adv. Data Mining Appl. Lecture Notes Comput. Sci., 2014, vol. 8933, pp. 30–43.
J. Han, J. Pei, and Y. Yin, “Mining frequent patterns without candidate generation,†in Proc. ACM SIGMOD Int. Conf. Manag. Data, 2000, pp. 1–12.
J. Han, J. Wang, Y. Lu, and P. Tzvetkov, “Mining top-k frequent closed patterns without minimum support,†in Proc. IEEE Int. Conf. Data Mining, 2002, pp. 211–218.
S. Krishnamoorthy, “Pruning strategies for mining high utility itemsets,†Expert Syst. Appl., vol. 42, no. 5, pp. 2371–2381, 2015.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.
Â