Efficient Algorithm for Mining High Utility Pattern Considering Length Constraints

Abstract

High utility itemset (HUI) mining is one of the popular and important data mining tasks. Several studies have been carried out on this topic, which often discovers a very large number of itemsets and rules, which reduces not only the efficiency but also the effectiveness of HUI mining. In order to increase the efficiency and discover more interesting HUIs, constraint-based mining plays an important role. To address this issue, the authors propose an algorithm to discover HUIs with length constraints named EHIL (Efficient High utility Itemsets with Length constraints) to decrease the number of HUIs by removing tiny itemsets. EHIL adopts two new upper bound named sub-tree and local utility for pruning and modify them by incorporating length constraints. To reduce the dataset scans, the proposed algorithm uses transaction merging and dataset projection techniques. The execution time improvements ranged from a modest five percent to two orders of magnitude across benchmark datasets. The memory usage is up to twenty-eight times less than state-of-the-art algorithm FHM+.

Cockroach Swarm Optimization Algorithm for High Utility Association Rule Mining

“…ThetraditionalARMisadataminingtechnique,whichisaimedtoretrievehighlyrelatedobjectsin adatabasebasedonitsoccurrences.Thisdoesnottakesemanticsignificanceofobjectsintoaccount. Recentlyutilitybasedassociationruleswereattractingresearchers,whichconsidersignificantfactors oftheobjectsinadatabase.Preliminariesinutilityminingcalculationscanbefoundin( (Kumari, Sanjeevi&Rao,(2019); (Zhang,Fang,Sun&Wang(2019); Singh(2019); (Nguyen,Nguyen,Nguyen, Vo, Fournier-Viger, &Tseng (2019)). Generation of utility association rules contain two phases.…”