A TIFF-Tree Based High Utility Itemset Mining Algorithm-Reference-Cited by-同舟云学术

A TIFF-Tree Based High Utility Itemset Mining Algorithm

Published:2013-09-18 Issue: Volume:760-762 Page:1713-1717
ISSN:1662-8985
Container-title:Advanced Materials Research
language:
Short-container-title:AMR

Author:

Pan Yi¹,Zhang Bo²

Affiliation:

1. Changsha University

2. Wuhan University of Technolog

Abstract

Owing to their major contribution to the total transaction's sales profits, increasingly importance has been attached to high utility itemsets mining. This paper has proposed a TIFF-tree based algorithm, which takes two-pass database scan to obtain the transaction utility information, the conditional matrix of potential high utility is adopted, through the row-column operation, the calculation of transaction utility can be simplified. The experiment result analysis shows that as the decreasing of user-defined threshold, the performance of TIFP-Growth algorithm is much better than the two-phase algorithm.

Publisher

Trans Tech Publications, Ltd.

Subject

General Engineering

Link

https://www.scientific.net/AMR.760-762.1713.pdf

Reference9 articles.

1. R. Agrawal, R. Skrikant, Fast algorithms for mining association rules, In Proceedings of the 20th VLDB conference, (1994).

2. Yao H, Hamilton H. J, Butz C. J, A Foundational Approach to Mining Itemset Utilities from Databases, In Proceedings of 10th National Conference on Fuzzy Theory and Its Applications. Budapest, (2004).

3. Shankar S., Purusothaman T., Utility Sentient Frequent Itemset Mining and Association Rule Mining: A Literature Survey and Comparative Study, International Journal of Soft Computing Applications, 2009(4)81-95.

4. Pillai J., Vyas O.P. Overview of Itemset Utility Mining and its Applications, International Journal of Computer Application, 2010(5)9-13.

5. Yao H., Hamilton H., Geng L. A Unified Framework for Utilty-Based Measures for Mining Itemsets, In Proc. of the ACM International Conf. on Utility-Based Data Mining Workshop. (2007).