A fast high utility itemsets mining algorithm

504 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases (2009, background): “Maintaining downward closure property in high utility pattern mining is more challenging as it considers nonbinary frequency values of an item in transactions.”
Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases (2013, methodology): “Index Terms—Candidate pruning, frequent itemset, high utility itemset, utility mining, data mining Ç”
Isolated items discarding strategy for discovering high utility itemsets (2008, methodology): “presented a Two-Phase (TP) algorithm for the same purpose [27,28].”
Mining high utility itemsets without candidate generation (2012, background): “Since the downward closure property cannot be directly applied, Liu et al. proposed an important property [17] for pruning the search space of the high utility itemset mining problem.”
UP-Growth: an efficient algorithm for high utility itemset mining (2010, background): “Existing studies [2, 4, 6, 7, 9] applied overestimated methods to facilitate the mining performance of utility mining.”