Một phương pháp mới khai thác các mẫu hữu ích cao thú vị

  • Lê Hoài Bắc
  • Huỳnh Xuân Cảnh
  • Võ Đình Bảy

Abstract

Mining high utility itemsets is an important problem in datamining. This supplies more benefit itemsets than the traditional itemsets, but many high utility itemsets is not important because the poor relations among the items inside them. Recently, the theory of the high utility and interesting itemsets and the mining method have been proposed. A high utility and interesting itemset is a subset of a high utility itemset, and its relations are strong. In this paper, we introduce the KWU-Mining algorithm to mine the high utility and interesting itemsets based on the WIT tree structure. The experiment results of  the KWU-Mining algorithm show that they are effective in many transaction databases.

Author Biography

Lê Hoài Bắc
thông tin di động, MIMO

References

Y. Liu, W.-K. Liao, A. Choudhary, “A two phase algorithm for fast discovery of high utility of itemsets”, Proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD’05), 2005, pp. 689–695.

B. Le, H. Nguyen, T.A. Cao, B. Vo, “A novel algorithm for mining high utility itemsets”, The first Asian Conference on Intelligent Information and Database Systems, published by IEEE, 2009, pp. 13–16.

C. F. Ahmed, S. K. Tbeer, B. S. Jeong, H. J. Choi, “A framework for mining interesting high utility patterns with a strong frequency affinity”, Information Sciences, 181, 2011, pp. 4878–4894.

B. Vo, F. Coenen, B. Le, “A new method for mining frequent weighted itemsets based on wit-trees”, Expert Systems with Applications, 40(4), 2013, pp. 1256-1264.

Frequent itemset mining dataset repository. Available from: http://fimi.cs.helsinki.fi/data/.

J. Pisharath, Y. Liu, J. Parhi, W.-K. Liao, A. Choudhary, G. Memik, NU-MineBench version 2.0 source code and datasets. Available from: http://cucis.ece.northwestern.edu/projects/DMS/MineBench.html.

M. J. Zaki, C. J. Hsiao, “Efficient algorithms for mining closed itemsets and their lattice structure”, IEEE Transactions on Knowledge and Data Engineering, 17(4), April 2005, 2005, pp. 462–478.

H. Yao, H. J. Hamilton, C. J. Butz, “A foundational approach to mining itemset utilities from databases”, Proceedings 2004 SIAM International Conference on Data Mining, 2004, pp. 482 – 486.

M. J. Zaki, K. Gouda, “Fast vertical mining using diffsets”, SIGKDD’03, 2003, pp. 326–335.

Published
2014-12-30
Section
Bài báo