EA-HUFIM: Optimization for Fuzzy-Based High-Utility Itemsets Mining
- 7 January 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in International Journal of Fuzzy Systems
- Vol. 23 (6), 1652-1668
- https://doi.org/10.1007/s40815-020-01003-8
Abstract
High-utility itemsets mining (HUIM) has attracted considerable attention due to its superior performance in discovering the profitable itemsets from databases. Generally, an itemset is discovered as a high-utility itemset (HUI) by HUIM only if its utility (such as profit) is higher than a predefined utility threshold. The previous HUIM methods cannot address the sharp boundary problem and the efficiency problem simultaneously. To tackle the above problems, we take the attempt to combine the fuzzy set theory and the evolutionary algorithms (EAs) in the HUIM method, which is called EA-HUFIM. For the proposed EA-HUFIM, it is challenging to design an appropriate EA and a suitable fitness function. Therefore, we focus on analyzing the characteristics of fuzzy-based HUI (i.e., HUFI) and present a theorem and a lemma based on a new concept, the high database-max utility fuzzy itemsets (HDFIs). The fitness function adopted in the EA-HUFIM method is inspired by the proposed lemma. Besides, we present a general EA framework with considering the elite learning strategy. The top K 1-HUFIs and top K 1-HDFIs are stored as an elite archive for further offspring production. To improve efficiency, we further employ a fuzzy map and a transaction map to propose a novel preprocessing method, and thus, the computational costs can be reduced. Experiments on several datasets and the results demonstrate that the EA-HUFIM method is effective in quantitative databases.Keywords
Funding Information
- National Key Research and Development Program of China (2018AAA0100101)
- National Natural Science Foundation of China (61772434, 61806169)
- China Postdoctoral Science Foundation (2018M643085)
- Fundamental Research Funds for the Central Universities (XDJK2019C020)
- National Natural Science Foundation of China (61932006)
This publication has 23 references indexed in Scilit:
- Efficient Algorithms for Mining Top-K High Utility ItemsetsIEEE Transactions on Knowledge and Data Engineering, 2015
- Competitive and cooperative particle swarm optimization with information sharing mechanism for global optimization problemsInformation Sciences, 2015
- Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databasesAdvanced Engineering Informatics, 2015
- Incremental high utility pattern mining with static and dynamic databasesApplied Intelligence, 2014
- Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility ItemsetsIEEE Transactions on Knowledge and Data Engineering, 2014
- Novel Concise Representations of High Utility Itemsets Using Generator PatternsLecture Notes in Computer Science, 2014
- An efficient projection-based indexing approach for mining high utility itemsetsKnowledge and Information Systems, 2013
- Mining interesting user behavior patterns in mobile commerce environmentsApplied Intelligence, 2012
- An effective tree structure for mining high utility itemsetsExpert Systems with Applications, 2011
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993