Mining High Utility Itemsets Based on Transaction Deletion
In the past, an incremental algorithm for mining high utility itemsets was proposed to derive high utility itemsets in an incrementally inserted way. In real-world applications, transactions are not only inserted into but also deleted from a database. In this paper, a maintenance algorithm is thus proposed for reducing the execution time of maintaining high utility itemsets due to transaction deletion. Experimental results also show that the proposed maintenance algorithm runs much faster than the batch approach.
KeywordsUtility mining Maintenance Transaction deletion Two-phase approach FUP concept
This research was partially supported by Shenzhen peacock project, China, under contract No. KQC201109020055A, and Shenzhen Strategic Emerging Industries Program under Grants No. ZDSY20120613125016389.
- 2.Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the international conference on very large data bases, pp 487–499Google Scholar
- 5.Liu Y, Liao WK, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proceedings of the international workshop on utility-based data mining, pp 90–99Google Scholar
- 6.Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the siam international conference on data mining. pp 211–225Google Scholar
- 7.Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Proceedings of IEEE international conference on data mining, pp 19–26Google Scholar
- 8.Lan GC, Hong TP, Tseng VS (2011) Discovery of high utility itemsets from on-shelf time periods of products. Expert Syst Appl 38(5):5851–5857Google Scholar
- 12.Cheung DW, Jiawei H, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the international conference on data engineering, pp 106–114Google Scholar
- 13.Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: Proceedings of the international conference on database systems for advanced applications, pp 185–194Google Scholar
- 14.Hong TP, Wu CH (2010) An improved weighted clustering algorithm for determination of application nodes in heterogeneous sensor networks. J Inf Hiding Multimedia Sig Process 2(2):173–184Google Scholar
- 15.Lin CW, Hong TP, Chang CC, Wang SL (2013) A greedy-based approach for hiding sensitive itemsets by transaction insertion. J Inf Hiding Multimedia Sig Process 4(4):201–227Google Scholar
- 17.IBM: quest synthetic data generation code (1996) Available: http://www.almaden.ibm.com/cs/quest/syndata.html