Research Article
Pre-evaluation Strategy on Algorithms for Mining Top – k High Utility Item Sets
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 177 - Issue 10 |
| Published: Oct 2019 |
| Authors: M. V. Mali, H. B. Torvi |
10.5120/ijca2019919476
|
M. V. Mali, H. B. Torvi . Pre-evaluation Strategy on Algorithms for Mining Top – k High Utility Item Sets. International Journal of Computer Applications. 177, 10 (Oct 2019), 7-10. DOI=10.5120/ijca2019919476
@article{ 10.5120/ijca2019919476,
author = { M. V. Mali,H. B. Torvi },
title = { Pre-evaluation Strategy on Algorithms for Mining Top – k High Utility Item Sets },
journal = { International Journal of Computer Applications },
year = { 2019 },
volume = { 177 },
number = { 10 },
pages = { 7-10 },
doi = { 10.5120/ijca2019919476 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2019
%A M. V. Mali
%A H. B. Torvi
%T Pre-evaluation Strategy on Algorithms for Mining Top – k High Utility Item Sets%T
%J International Journal of Computer Applications
%V 177
%N 10
%P 7-10
%R 10.5120/ijca2019919476
%I Foundation of Computer Science (FCS), NY, USA
Abstract
A rising trend in data mining is a High utility item sets (HUIs) mining. It aims to find all item sets which have an utility which meets a client determined least utility edge min_util. But , for clients, it is an issue to set a min_util efficiently. So, it is not proper procedure for clients to find a least utility edge by experimentation. An excessive number of HUIs will be produced, in the case that min_util is set very low. Due to this the mining procedure may result wasteful. It is also possible that no HUIs be found, if min_util is set very high. So for addressing the above issues, we redefine the problem of high utility item sets (HUIs) mining by top-k high utility item sets ( top-k HUI ) mining. Here, desired number of HUIs to be mined is k. Two different algorithms which are named as TKU and TKO (mining Top-K Utility item sets in two stages , mining Top-K utility item sets in one stage, respectively) are proposed for mining the item sets without setting the value of min_util. We apply pre-evaluation strategy to algorithms to improve the performance.
References
- V. Kavitha, B. G. Geetha, “Review on high utility itemset mining algorithms” IEEE Trans. Knowl. Data Eng., vol. 21, no. 12, pp. 1708–1721, October 2016.
- Song Wei, Liu Yu, Li Jinhong, "Mining high utility itemsets by dynamically pruning the tree structure", Applied intelligence, vol. 40, no. 1, pp. 29-43, 2014.
- Vincent S. Tseng et al., "Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility Itemsets", Knowledge and Data Engineering IEEE Transactions on, vol. 27, no. 3, pp. 726-739, 2015.
- 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.
- M. Liu and J. Qu, “Mining high utility itemsets without candidate generation,” in Proc.ACM Int. Conf. Inf. Knowl. Manag., 2012, pp. 55–64.
- 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.
Index Terms
Keywords