An indexed set representation based multi-objective evolutionary approach for mining diversified top-k high utility patterns

Abstract How to discover top-k patterns with the largest utility values, namely, mining top-k high utility patterns, is a hot topic in data mining. However, most of the existing works for mining top-k high utility patterns consider each pattern separately during the mining process, thus many mined patterns are highly similar and lack diversity. In this paper, we propose to mine top-k high utility patterns with high diversity for enhancing users’satisfaction in recommendation. Specifically, we first introduce a simple measure of coverage to quantify the diversity of the whole set, that is, the top-k patterns as a complete entity. Then we propose an i ndexed s et r epresentation based m ulti-o bjective e volutionary a pproach named ISR-MOEA to mine diversified top-k high utility patterns, due to the fact that the two measures utility and coverage are conflicting. In ISR-MOEA, an indexed set individual representation scheme is suggested for fast encoding and decoding the top-k pattern set. Experimental results on six real-world and two synthetic datasets demonstrate the effectiveness of the proposed approach. The proposed approach can obtain several groups of top-k pattern set with different trade-offs between utility and diversity in only one run, which would further enhance the satisfaction of users.

[1]  Philip S. Yu,et al.  UP-Growth: an efficient algorithm for high utility itemset mining , 2010, KDD.

[2]  Aijun An,et al.  Mining top-k high utility patterns over data streams , 2014, Inf. Sci..

[3]  Enhong Chen,et al.  Revisiting bound estimation of pattern measures: A generic framework , 2016, Inf. Sci..

[4]  Ye Tian,et al.  A Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization , 2015, IEEE Transactions on Evolutionary Computation.

[5]  Ye Tian,et al.  An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization , 2015, IEEE Transactions on Evolutionary Computation.

[6]  Maoguo Gong,et al.  Personalized Recommendation Based on Evolutionary Multi-Objective Optimization [Research Frontier] , 2015, IEEE Computational Intelligence Magazine.

[7]  Nicholas Jing Yuan,et al.  Relevance Meets Coverage , 2016, ACM Trans. Intell. Syst. Technol..

[8]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[9]  Kandhasamy Premalatha,et al.  Discovery of High Utility Itemsets Using Genetic Algorithm with Ranked Mutation , 2014, Appl. Artif. Intell..

[10]  Young-Koo Lee,et al.  Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases , 2009, IEEE Transactions on Knowledge and Data Engineering.

[11]  Dmitriy Fradkin,et al.  Under Consideration for Publication in Knowledge and Information Systems Mining Sequential Patterns for Classification , 2022 .

[12]  Antonio Gomariz,et al.  SPMF: a Java open-source pattern mining library , 2014, J. Mach. Learn. Res..

[13]  Teresa Bernarda Ludermir,et al.  A new evolutionary algorithm for mining top-k discriminative patterns in high dimensional data , 2017, Appl. Soft Comput..

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

[15]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[16]  Luca G. Tallini,et al.  A Fuzzy Gravitational Search Algorithm to Design Optimal IIR Filters , 2018 .

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

[18]  Arno J. Knobbe,et al.  Diverse subgroup set discovery , 2012, Data Mining and Knowledge Discovery.

[19]  Behrouz Minaei-Bidgoli,et al.  Mining numerical association rules via multi-objective genetic algorithms , 2013, Inf. Sci..

[20]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

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

[23]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[24]  Hossein Nezamabadi-pour,et al.  BGSA: binary gravitational search algorithm , 2010, Natural Computing.

[25]  Philip S. Yu,et al.  Efficient Algorithms for Mining Top-K High Utility Itemsets , 2016, IEEE Transactions on Knowledge and Data Engineering.

[26]  Takashi Washio,et al.  State of the art of graph-based data mining , 2003, SKDD.

[27]  Ujjwal Maulik,et al.  A Survey of Multiobjective Evolutionary Clustering , 2015, ACM Comput. Surv..

[28]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[29]  Ujjwal Maulik,et al.  A Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I , 2014, IEEE Transactions on Evolutionary Computation.

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

[31]  Bernhard Sendhoff,et al.  A Multiobjective Evolutionary Algorithm Using Gaussian Process-Based Inverse Modeling , 2015, IEEE Transactions on Evolutionary Computation.

[32]  Markus Wagner,et al.  Seeding the initial population of multi-objective evolutionary algorithms: A computational study , 2015, Appl. Soft Comput..

[33]  María José del Jesús,et al.  NMEEF-SD: Non-dominated Multiobjective Evolutionary Algorithm for Extracting Fuzzy Rules in Subgroup Discovery , 2010, IEEE Transactions on Fuzzy Systems.

[34]  Ajith Abraham,et al.  Neural network and fuzzy system for the tuning of Gravitational Search Algorithm parameters , 2018, Expert Syst. Appl..