Abstract

Utility mining is a current emerging field in data mining. Utility mining raises various forms. They are high utility itemset mining, utility frequent itemset mining, negative utility itemsets mining, rare high utility itemset mining etc. All these itemset mining does not consider the size of itemsets. A recent development in utility mining is high average-utility itemset mining. This average utility mining considers length of itemsets along with the utility of itemsets. There are several algorithms proposed to retrieve high average utility itemsets in a database. The main objective of this work is to compare three high average-utility patterns algorithms: high average-utility patterns (HAUP) algorithm, high average-utility itemset-miner (HAUI-Miner) algorithm and efficient high average-utility pattern mining (EHAUPM) algorithm. The execution time and memory space are considered as performance measures for the comparison. It was found that EHAUPM algorithm performs better than other algorithms.

Keyword

Utility mining, High average utility mining, Average high utility itemsets, Length of itemsets, HAUP algorithm, HAUI-miner algorithm, EHAUPM algorithm.

Cite this article

Refference

[1][1]Agrawal R, Imieliński T, Swami A. Mining association rules between sets of items in large databases. In ACM SIGMOD record 1993 (pp. 207-16). ACM.

[2][2]Ahmed CF, Tanbeer SK, Jeong BS, Lee YK. Efficient tree structures for high utility pattern mining in incremental databases. IEEE Transactions on Knowledge and Data Engineering. 2009; 21(12):1708-21.

[3][3]Krishnamoorthy S. Pruning strategies for mining high utility itemsets. Expert Systems with Applications. 2015; 42(5):2371-81.

[4][4]Sivamathi C, Vijayarani S. Performance analysis of utility mining algorithms. In international conference on inventive computation technologies 2016 (pp. 1-4). IEEE.

[5][5]Lin JC, Li T, Fournier-Viger P, Hong TP, Su JH. Efficient mining of high average-utility itemsets with multiple minimum thresholds. In industrial conference on data mining 2016 (pp. 14-28). Springer, Cham.

[6][6]Fournier-Viger P, Wu CW, Zida S, Tseng VS. FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In international symposium on methodologies for intelligent systems 2014 (pp. 83-92). Springer, Cham.

[7][7]Lan GC, Hong TP, Tseng VS. Efficiently mining high average-utility itemsets with an improved upper-bound strategy. International Journal of Information Technology & Decision Making. 2012; 11(5):1009-30.

[8][8]Han J, Pei J, Yin Y, Mao R. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery. 2004; 8(1):53-87.

[9][9]Hong TP, Lee CH, Wang SL. Mining high average-utility itemsets. In international conference on systems, man and cybernetics 2009 (pp. 2526-30). IEEE.

[10][10]Lu T, Vo B, Nguyen HT, Hong TP. A new method for mining high average utility itemsets. In IFIP international conference on computer information systems and industrial management 2014 (pp. 33-42). Springer, Berlin, Heidelberg.

[11][11]Lin JC, Li T, Fournier-Viger P, Hong TP, Zhan J, Voznak M. An efficient algorithm to mine high average-utility itemsets. Advanced Engineering Informatics. 2016; 30(2):233-43.

[12][12]Lin CW, Hong TP, Lu WH. Efficiently mining high average utility itemsets with a tree structure. In Asian conference on intelligent information and database systems 2010 (pp. 131-9). Springer, Berlin, Heidelberg.