Mining High Utility Itemsets Based on the Pre-large Concept
In this paper, an incremental mining algorithm is proposed for efficiently maintaining the discovered high utility itemsets based on the pre-large concept. It first partitions itemsets into nine cases according to whether they are large (high), pre-large or small transaction-weighted utilization in the original database and in the inserted transactions. Each part is then performed by its own procedure. Experimental results also show that the designed incremental high utility mining algorithm has better performance than the bach one for handling inserted transactions.
KeywordsUtility mining pre-large itemset high utility itemset incremental mining two-phase approach
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)Google Scholar
- 3.Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: IEEE International Conference on Data Mining, pp. 19–26 (2003)Google Scholar
- 5.Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: an incremental updating technique. In: The International Conference on Data Engineering, pp. 106–114 (1996)Google Scholar
- 7.Hong, T.P., Wang, C.Y.: Maintenance of association rules using pre-large itemsets. In: Intelligent Databases: Technologies and Applications, pp. 44–60 (2006)Google Scholar
- 8.IBM quest data mining project, Quest synthetic data generation code, http://www.almaden.ibm.com/cs/quest/syndata.html
- 13.Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: The SIAM International Conference on Data Mining, pp. 211–225 (2004)Google Scholar