A projection-based approach for discovering high average-utility itemsets

Guo Cheng Lan*, Tzung Pei Hong, S. Tseng

*Corresponding author for this work

研究成果: Article同行評審

34 引文 斯高帕斯(Scopus)

摘要

Utility mining has recently been an important issue due to its wide applications. An itemset in traditional utility mining considers individual profits and quantities of items in transactions regardless of its length. The average-utility measure, which is the total utility of an itemset divided by its number of items within it, was then proposed to reveal a better utility effect than the original utility measure. A mining algorithm was also proposed to find high average-utility itemsets from a transaction database. However, the previous mining approach was based on the principle of level-wise processing to find high average-utility itemsets from a database. In this paper, we thus propose an efficient average-utility mining approach which adopts a projection technique and an indexing mechanism to speed up the execution and reduce the memory requirement in the mining process. The proposed approach can project relevant sub-databases for mining, thus avoiding some unnecessary checking. In addition, a pruning strategy is also designed to reduce the number of unpromising itemsets in mining. Finally, the experimental results on synthetic datasets and two real datasets show the superior performance of the proposed approach.

原文English
頁(從 - 到)193-209
頁數17
期刊Journal of Information Science and Engineering
28
發行號1
出版狀態Published - 1 一月 2012

指紋 深入研究「A projection-based approach for discovering high average-utility itemsets」主題。共同形成了獨特的指紋。

引用此