Efficient Mining of Pareto-Front High Expected Utility Patterns

[1]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[2]  Vincent S. Tseng,et al.  EFIM: A Highly Efficient Algorithm for High-Utility Itemset Mining , 2015, MICAI.

[3]  Muhammad Arshad Islam,et al.  RALB‐HC: A resource‐aware load balancer for heterogeneous cluster , 2019 .

[4]  Lu Yang,et al.  Mining high-utility itemsets based on particle swarm optimization , 2016, Eng. Appl. Artif. Intell..

[5]  Lu Yang,et al.  A binary PSO approach to mine high-utility itemsets , 2017, Soft Comput..

[6]  Antonio Gomariz,et al.  The SPMF Open-Source Data Mining Library Version 2 , 2016, ECML/PKDD.

[7]  Vincent S. Tseng,et al.  Mining High Utility Itemsets in Big Data , 2015, PAKDD.

[8]  Yansen Su,et al.  A multi-objective evolutionary approach for mining frequent and high utility itemsets , 2018, Appl. Soft Comput..

[9]  Thomas Stützle,et al.  Ant Colony Optimization: Overview and Recent Advances , 2018, Handbook of Metaheuristics.

[10]  Vincent S. Tseng,et al.  FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning , 2014, ISMIS.

[11]  Heungmo Ryang,et al.  Top-k high utility pattern mining with effective threshold raising strategies , 2015, Knowl. Based Syst..

[12]  Justin Zhijun Zhan,et al.  An ACO-based approach to mine high-utility itemsets , 2017, Knowl. Based Syst..

[13]  Osmar R. Zaïane,et al.  UAPRIORI: AN ALGORITHM FOR FINDING SEQUENTIAL PATTERNS IN PROBABILISTIC DATA , 2012 .