|標題:||EFIM: A Highly Efficient Algorithm for High-Utility Itemset Mining|
Lin, Jerry Chun-Wei
Tseng, Vincent S.
Department of Computer Science
|關鍵字:||High-utility mining;Itemset mining;Pattern mining|
|摘要:||High-utility itemset mining (HUIM) is an important data mining task with wide applications. In this paper, we propose a novel algorithm named EFIM (EFficient high-utility Itemset Mining), which introduces several new ideas to more efficiently discovers high-utility itemsets both in terms of execution time and memory. EFIM relies on two upper-bounds named sub-tree utility and local utility to more effectively prune the search space. It also introduces a novel array-based utility counting technique named Fast Utility Counting to calculate these upper-bounds in linear time and space. Moreover, to reduce the cost of database scans, EFIM proposes efficient database projection and transaction merging techniques. An extensive experimental study on various datasets shows that EFIM is in general two to three orders of magnitude faster and consumes up to eight times less memory than the state-of-art algorithms d 2 HUP, HUI-Miner, HUP-Miner, FHM and UP-Growth+.|
|期刊:||ADVANCES IN ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, MICAI 2015, PT I|
|Appears in Collections:||Conferences Paper|