Learn More
High utility itemset mining is a challenging task in frequent pattern mining, which has wide applications. The state-of-the-art algorithm is HUI-Miner. It adopts a vertical representation and performs a depth-first search to discover patterns and calculate their utility without performing costly database scans. Although, this approach is effective, mining(More)
High-utility pattern mining is an important data mining task having wide applications. It consists of discovering patterns generating a high profit in databases. Recently, the task of high-utility sequential pattern mining has emerged to discover patterns generating a high profit in sequences of customer transactions. However, a well-known limitation of(More)
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(More)
High utility itemset (HUI) mining is a popular data mining task, which consists of discovering sets of items generating high profit in a transaction database. Recently, several efficient algorithms have been proposed for this task. But, most of them do not consider the on-shelf time periods of items, which thus lead to a bias toward items having more shelf(More)
Sequential rule mining is an important data mining task with wide applications. The current state-of-the-art algorithm (RuleGrowth) for this task relies on a pattern-growth approach to discover sequential rules. A drawback of this approach is that it repeatedly performs a costly database projection operation, which deteriorates performance for datasets(More)
In recent years, high-utility itemset mining has emerged as an important data mining task. However, it remains computationally expensive both in terms of runtime and memory consumption. It is thus an important challenge to design more efficient algorithms for this task. In this paper, we address this issue by proposing a novel algorithm named EFIM(More)
This paper presents a novel algorithm for discovering closed high-utility itemsets (CHUIs) efficiently. It proposes three strategies to mine CHUIs efficiently: <i>closure jumping</i>, <i>forward closure checking</i> and <i>backward closure checking</i>. It also relies on two new upper-bounds named <i>local utility</i> and <i>sub-tree utility</i> to prune(More)
Discovering high-utility temsets in transaction databases is a popular data mining task. A limitation of traditional algorithms is that a huge amount of high-utility itemsets may be presented to the user. To provide a concise and lossless representation of results to the user, the concept of closed high-utility itemsets was proposed. However, mining closed(More)
  • 1