High Utility Itemset Mining Research Articles

A Spark-based high utility itemset mining with multiple external utilities

A Spark-based high utility itemset mining with multiple external utilities

Retracted: High utility itemset mining using genetic algorithm assimilated with off policy reinforcement learning to adaptively calibrate crossover operation

AbstractMining high utility itemsets (HUI) is a current thrust field in data mining that has received numerous methodologies for addressing it effectively. The difficulty with HUI is to locate a number of items that have a high degree of utility in comparison to other different sets in a transaction database. Traditional accurate HUIM algorithms usually have to solve the exponential problem of big search spaces when the size or number of different items in the database is quite vast. Evolutionary computation (EC)‐based algorithms have been offered as an alternate and successful technique to solving HUIM issues since they may generate a collection of approximately optimum solutions in a short amount of time. Many genetic algorithm (GA)‐based approaches have been developed in recent years to efficiently mine HUI from transaction databases. The selection technique, crossover probability, mutation probability, and finishing criteria of the genetic algorithm have an greater impact on generating a reasonably decent solution and the processing time. Particularly crossover is a convergence operation which is intended to pull the population toward a local minimum/maximum. During HUIM using GA both low and high crossover rate will have the problem of decreasing the quality of intermediate itemset and take longer time to converge to some optima and vice versa. This problem can be solved by adjusting the crossover rate adaptively depending on environmental inputs. The proposed approach describe a hybrid system that employs a reinforcement learning (RL) agent to adaptively calibrate the crossover operation to increase the performance of a genetic algorithm. To estimate state‐action utility values, the RL agent employs Q‐learning, which it then employs to execute high‐level adaptive control over the crossover operation in the genetic algorithm. To evaluate the performance of the proposed methodology, extensive experiments were conducted on a four benchmark datasets and compared with three state‐of‐art EC approaches HUPEUMU‐GRAM, Bio‐HUIF‐GA, HUIM‐BPSO, and one exact approach HUP‐Miner . The result analysis witnessed that proposed approach outperforms EC approaches in terms of execution time, discovered HUIs and convergence.

A single‐phase algorithm for mining high utility itemsets using compressed tree structures

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+ algorithms.

Efficient algorithms for victim item selection in privacy-preserving utility mining

High-utility itemset mining has evolved as an essential and captivating research topic. It aims to extract the patterns/itemsets having high utility value; hence, they are called high utility itemsets (HUIs). From a business perspective, a utility can be the benefit associated with the sale of a particular item or the usefulness or satisfaction that a customer experiences from a product. The economic utilities are helpful to evaluate the drivers behind a customer’s purchase decision. The advances in information technology have enabled us to access the datasets related to various domains like health care, stock market, market-basket, education and bioinformatics. Companies strive to increase the utility value of their products and share their customer’s transactions data to extract high utility patterns to achieve global customer insights. However, this can lead to massive security and privacy risk if their competitors misuse the patterns that can disclose their confidential information. Privacy-preserving utility mining (PPUM) is a branch of privacy-preserving data mining (PPDM) that presents various algorithms which intend to hide sensitive high utility itemsets (SHUIs) and maintain a balance between utility-maximizing and privacy-preserving. In this paper, two SHUIs hiding algorithms, MinMax and Weighted, are proposed with three variants of each algorithm. Experiments on various datasets show that proposed algorithms perform better than the existing SHUIs hiding algorithms as fewer distortions of non-sensitive knowledge occur. This study uses six performance evaluating metrics to assess the proposed algorithms against compared algorithms.

Mining High Utility Itemsets with Hill Climbing and Simulated Annealing

High utility itemset mining (HUIM) is the task of finding all items set, purchased together, that generate a high profit in a transaction database. In the past, several algorithms have been developed to mine high utility itemsets (HUIs). However, most of them cannot properly handle the exponential search space while finding HUIs when the size of the database and total number of items increases. Recently, evolutionary and heuristic algorithms were designed to mine HUIs, which provided considerable performance improvement. However, they can still have a long runtime and some may miss many HUIs. To address this problem, this article proposes two algorithms for HUIM based on Hill Climbing (HUIM-HC) and Simulated Annealing (HUIM-SA). Both algorithms transform the input database into a bitmap for efficient utility computation and for search space pruning. To improve population diversity, HUIs discovered by evolution are used as target values for the next population instead of keeping the current optimal values in the next population. Through experiments on real-life datasets, it was found that the proposed algorithms are faster than state-of-the-art heuristic and evolutionary HUIM algorithms, that HUIM-SA discovers similar HUIs, and that HUIM-SA evolves linearly with the number of iterations.

Review of Association Mining Methods for the Extraction of Rules Based on the Frequency and Utility Factors

Association rule defines the relationship among the items and discovers the frequent items using a support-confidence framework. This framework establishes user-interested or strong association rules with two thresholds (i.e., minimum support and minimum confidence). Traditional association rule mining methods (i.e., apriori and frequent pattern growth [FP-growth]) are widely used for discovering of frequent itemsets, and limitation of these methods is that they are not considering the key factors of the items such as profit, quantity, or cost of items during the mining process. Applications like e-commerce, marketing, healthcare, and web recommendations, etc. consist of items with their utility or profit. Such cases, utility-based itemsets mining methods, are playing a vital role in the generation of effective association rules and are also useful in the mining of high utility itemsets. This paper presents the survey on high-utility itemsets mining methods and discusses the observation study of existing methods with their experimental study using benchmarked datasets.

Mining Closed High Utility Itemsets based on Propositional Satisfiability

A high utility itemset mining problem is the question of recognizing a set of items that have utility values greater than a given user utility threshold. This generalization of the classical problem of frequent itemset mining is a useful and well-known task in data analysis and data mining, since it is used in a wide range of real applications. In this paper, we first propose to use symbolic Artificial Intelligence for computing the set of all closed high utility itemsets from transaction databases. Our approach is based on reduction to enumeration problems of propositional satisfiability. Then, we enhance the efficiency of our SAT-based approach using the weighted clique cover problem. After that, in order to improve scalability, a decomposition technique is applied to derive smaller and independent sub-problems in order to capture all the closed high utility itemsets. Clearly, our SAT-based encoding can be constantly enhanced by integrating the last improvements in powerful SAT solvers and models enumeration algorithms. Finally, through empirical evaluations on different real-world datasets, we demonstrate that the proposed approach is very competitive with state-of-the-art specialized algorithms for high utility itemsets mining, while being sufficiently flexible to take into account additional constraints to finding closed high utility itemsets.

ETKDS: An efficient algorithm of Top-K high utility itemsets mining over data streams under sliding window model

The researcher proposed the concept of Top-K high-utility itemsets mining over data streams. Users directly specify the number K of high-utility itemsets they wish to obtain for mining with no need to set a minimum utility threshold. There exist some problems in current Top-K high-utility itemsets mining algorithms over data streams including the complex construction process of the storage structure, the inefficiency of threshold raising strategies and utility pruning strategies, and large scale of the search space, etc., which still can not meet the requirement of real-time processing over data streams with limited time and memory constraints. To solve this problem, this paper proposes an efficient algorithm based on dataset projection for mining Top-K high-utility itemsets from a data stream. A data structure CIUDataListSW is also proposed, which stores the position of the item in the transaction to effectively obtain the initial projected dataset of the item. In order to improve the projection efficiency, this paper innovates a new reorganization technology for projected transactions in common batches to maintain the sort order of transactions in the process of dataset projection. Dual pruning strategy and transaction merging mechanism are also used to further reduce search space and dataset scanning costs. In addition, based on the proposed CUDHSW structure, an efficient threshold raising strategy CUD is used, and a new threshold raising strategy CUDCB is designed to further shorten the mining time. Experimental results show that the algorithm has great advantages in running time and memory consumption, and it is especially suitable for the mining of high-utility itemsets of dense datasets.

Analytics of high average-utility patterns in the industrial internet of things

Recently, revealing more valuable information except for quantity value for a database is an essential research field. High utility itemset mining (HAUIM) was suggested to reveal useful patterns by average-utility measure for pattern analytics and evaluations. HAUIM provides a more fair assessment than generic high utility itemset mining and ignores the influence of the length of itemsets. There are several high-performance HAUIM algorithms proposed to gain knowledge from a disorganized database. However, most existing works do not concern the uncertainty factor, which is one of the characteristics of data gathered from IoT equipment. In this work, an efficient algorithm for HAUIM to handle the uncertainty databases in IoTs is presented. Two upper-bound values are estimated to early diminish the search space for discovering meaningful patterns that greatly solve the limitations of pattern mining in IoTs. Experimental results showed several evaluations of the proposed approach compared to the existing algorithms, and the results are acceptable to state that the designed approach efficiently reveals high average utility itemsets from an uncertain situation.

Efficient algorithms for mining closed high utility itemsets in dynamic profit databases

The problem of discovering high-utility itemsets (HUIs) in transaction databases, which is an extension of Frequent Itemset Mining, is a commonly encountered mining task. Researchers have proposed algorithms to efficiently mine highly profitable itemsets in customer transaction databases, in which the unit profits of items are fixed. However, this assumption does not reflect the true nature of the utility measure of items in real-life transaction databases, which might vary over time. Moreover, since this important characteristic is ignored by all the current HUI mining algorithms, they are either not applicable to this type of database, or they generate inaccurate results. In addition, the HUI mining algorithms’ traditional limitation is that they produce a huge number of HUIs for users. In this paper, we define the problem of mining a lossless, concise and compact representation of HUIs, called closed HUIs (CHUIs), in dynamic unit profit databases. Based on newly defined of utility measure, a novel algorithm, called iEFIM-Closed, is introduced. This relies on this new utility measure, a novel compact database format to reduce the cost of database scans and increase the efficiency of the mining process. Experimental evaluations show that iEFIM-Closed significantly outperforms state-of-the-art algorithms for mining CHUIs on sparse databases with dynamic profit, and has competitive performance in dense databases in terms of runtime, the cost of database scans and scalability.

A Survey of incremental high-utility pattern mining based on storage structure

Traditional association rule mining has been widely studied, but this is not applicable to practical applications that must consider factors such as the unit profit of the item and the purchase quantity. High-utility itemset mining (HUIM) aims to find high-utility patterns by considering the number of items purchased and the unit profit. However, most high-utility itemset mining algorithms are designed for static databases. In real-world applications (such as market analysis and business decisions), databases are usually updated by inserting new data dynamically. Some researchers have proposed algorithms for finding high-utility itemsets in dynamically updated databases. Different from the batch processing algorithms that always process the databases from scratch, the incremental HUIM algorithms update and output high-utility itemsets in an incremental manner, thereby reducing the cost of finding high-utility itemsets. This paper provides the latest research on incremental high-utility itemset mining algorithms, including methods of storing itemsets and utilities based on tree, list, array and hash set storage structures. It also points out several important derivative algorithms and research challenges for incremental high-utility itemset mining.

Efficient Utility Tree-Based Algorithm to Mine High Utility Patterns Having Strong Correlation

High Utility Itemset Mining (HUIM) is one of the most investigated tasks of data mining. It has broad applications in domains such as product recommendation, market basket analysis, e-learning, text mining, bioinformatics, and web click stream analysis. Insights from such pattern analysis provide numerous benefits, including cost cutting, improved competitive advantage, and increased revenue. However, HUIM methods may discover misleading patterns as they do not evaluate the correlation of extracted patterns. As a consequence, a number of algorithms have been proposed to mine correlated HUIs. These algorithms still suffer from the issue of the computational cost in terms of both time and memory consumption. This paper presents an algorithm, named Efficient Correlated High Utility Pattern Mining (ECoHUPM), to efficiently mine the high utility patterns having strong correlation items. A new data structure based on utility tree (UTtree) named CoUTlist is proposed to store sufficient information for mining the desired patterns. Three pruning properties are introduced to reduce the search space and improve the mining performance. Experiments on sparse, very sparse, dense, and very dense datasets indicate that the proposed ECoHUPM algorithm is efficient as compared to the state-of-the-art CoHUIM and CoHUI-Miner algorithms in terms of both time and memory consumption.

The Efficient Mining of Skyline Patterns from a Volunteer Computing Network

In the ever-growing world, the concepts of High-utility Itemset Mining (HUIM) as well as Frequent Itemset Mining (FIM) are fundamental works in knowledge discovery. Several algorithms have been designed successfully. However, these algorithms only used one factor to estimate an itemset. In the past, skyline pattern mining by considering both aspects of frequency and utility has been extensively discussed. In most cases, however, people tend to focus on purchase quantities of itemsets rather than frequencies. In this article, we propose a new knowledge called skyline quantity-utility pattern (SQUP) to provide better estimations in the decision-making process by considering quantity and utility together. Two algorithms, respectively, called SQU-Miner and SKYQUP are presented to efficiently mine the set of SQUPs. Moreover, the usage of volunteer computing is proposed to show the potential in real supermarket applications. Two new efficient utility-max structures are also mentioned for the reduction of the candidate itemsets, respectively, utilized in SQU-Miner and SKYQUP. These two new utility-max structures are used to store the upper-bound of utility for itemsets under the quantity constraint instead of frequency constraint, and the second proposed utility-max structure moreover applies a recursive updated process to further obtain strict upper-bound of utility. Our in-depth experimental results prove that SKYQUP has stronger performance when a comparison is made to SQU-Miner in terms of memory usage, runtime, and the number of candidates.

RETRACTED ARTICLE: Utilizing Index-Based Periodic High Utility Mining to Study Frequent Itemsets

The potential employability in different applications has garnered more significance for Periodic High-Utility Itemset Mining (PHUIM). It is to be noted that the conventional utility mining algorithms focus on an itemset’s utility value rather than that of its periodicity in the transaction. A MEAN periodicity measure is added to the minimum (MIN) and maximum (MAX) periodicity to incorporate the periodicity feature into PHUIM in this proposed work. The MEAN-periodicity measure brings a new dimension to the periodicity factor and is arrived at by dividing itemset’s period value by the total number of transactions in that dataset. Further, an algorithm to mine Index-Based Periodic High Utility Itemset Mining (IBPHUIM) from the database using an indexing approach is also proposed in this paper. The proposed IBPHUIM algorithm employs a projection-based technique and indexing procedure to increase memory and execution speed efficiency. The proposed model avoids redundant database scans by generating sub-databases using an indexing data structure. The proposed IBPHUIM model has experimented with test datasets, and the results drawn show that the proposed IBPHUIM model performs considerably better.

High Utility Mining of Streaming Itemsets in Data Streams

The traditional models for mining frequent itemsets mainly focus on the frequency of the items listed in the respective dataset. However, market basket analysis and other domains generally prefer utility obtained from items regardless of their frequencies in the transactions. One of the main options of utility in these domains could be profit. Therefore, it is significant to extract items that generate more profit than items that occurs more frequently in the dataset. Thus, mining high utility itemset has emerged recently as a prominent research topic in the field of data mining. Many of the existing researches have been proposed for mining high utility itemset from static data. However, with the recent advanced technologies, streaming data has become a good source for data in many applications. Mining high utility itemset over data streams is a more challenging task because of the uncertainty in data streams, processing time, and many more. Although some works have been proposed for mining high utility itemset over data streams, many of these works require multiple database scans and they require long processing time. In respect to this, we proposed a single-pass fast-search model in which we introduced a utility factor known as utility stream level for tracing the utility value of itemsets from data streams. The simulation study shows that the performance of the proposed model is more significant compared with the contemporary method. The comparison has been performed based on metrics like process-completion time and utilized search space.

Dynamic maintenance model for high average-utility pattern mining with deletion operation

The high average-utility itemset mining (HAUIM) was established to provide a fair measure instead of genetic high-utility itemset mining (HUIM) for revealing the satisfied and interesting patterns. In practical applications, the database is dynamically changed when insertion/deletion operations are performed on databases. Several works were designed to handle the insertion process but fewer studies focused on processing the deletion process for knowledge maintenance. In this paper, we then develop a PRE-HAUI-DEL algorithm that utilizes the pre-large concept on HAUIM for handling transaction deletion in the dynamic databases. The pre-large concept is served as the buffer on HAUIM that reduces the number of database scans while the database is updated particularly in transaction deletion. Two upper-bound values are also established here to reduce the unpromising candidates early which can speed up the computational cost. From the experimental results, the designed PRE-HAUI-DEL algorithm is well performed compared to the Apriori-like model in terms of runtime, memory, and scalability in dynamic databases.

A General Method for mining high-Utility itemsets with correlated measures

ABSTRACT Discovering high-utility itemsets from a transaction database is one of the important tasks in High-Utility Itemset Mining (HUIM). The discovered high-utility itemsets (HUIs) must meet a user-defined given minimum utility threshold. Several methods have been proposed to solve the problem efficiently. However, they focused on exploring and discovering the set of HUIs. This research proposes a more generalized approach to mine HUIs using any user-specified correlated measure, named the General Method for Correlated High-utility itemset Mining (GMCHM). This proposed approach has the ability to discover HUIs that are highly correlated, based on the all_confidence and bond measures (and 38 other correlated measures). Evaluations were carried out on the standard datasets for HUIM, such as Accidents, BMS_utility and Connect. The results proved the high effectiveness of GMCHM in terms of running time, memory usage and the number of scanned candidates.

Application of Utility Mining using Frequent Itemset and Association Rules: A Survey

Mining on data reveals patterns that provide useful information for analysis, decision making and forecasting in various domains. Association Rule Mining (ARM) identifies patterns on itemsets which are either frequent or have interesting relationship amongst them based on strong rules and conceptually form a basis for Frequent Itemset mining (FIM) problems. FIM extracts binary values from transaction databases to identify frequently bought items but provides insufficient information for identifying infrequent items that generate maximum profit. So a latter problem, High utility itemsets (HUI) mining was developed to focus on the itemsets that generate huge profit to the business. Even though HUI is related to Business Intelligence, its application extends to Web Server Logs, Biological Gene Databases, Network Traffic Measurements and many other fields. This paper presents a survey on the algorithms from different aspects and perspectives based on Utility mining, Frequent Itemset generation and Association Rule Mining

Efficient closed high-utility pattern fusion model in large-scale databases

High-Utility Itemset Mining (HUIM) is considered a major issue in recent decades since it reveals profit strategies for use in industry for decision-making. Most existing works have focused on mining high-utility itemsets from databases showing large amount of patterns; however exact decisions are still challenging to make from that large amounts of discovered knowledge. Closed High-utility itemset mining (CHUIM) provides a smart way to present concise high-utility itemsets that can be more effective for making correct decisions. However, none of the existing works have focused on handling large-scale databases to integrate discovered knowledge from several distributed databases. In this paper, we first present a large-scale information fusion architecture to integrate discovered closed high-utility patterns from several distributed databases. The generic composite model is used to cluster transactions regarding their relevant correlation that can ensure correctness and completeness of the fusion model. The well-known MapReduce framework is then deployed in the developed DFM-Miner algorithm to handle big datasets for information fusion and integration. Experiments are then compared to the state-of-the-art CHUI-Miner and CLS-Miner algorithms for mining closed high-utility patterns and the results indicated that the designed model is well designed for handling large-scale databases with less memory usage. Moreover, the designed MapReduce framework can speed up the mining performance of closed high-utility patterns in the developed fusion system.

High utility itemset mining using binary differential evolution: An application to customer segmentation

In this paper, high utility itemset mining (HUIM) algorithms driven by Binary Differential Evolution (BDE) and an Adaptive Binary Differential Evolution (ABDE) are proposed separately. These are compared with the HUIM algorithms of (i) Binary Particle Swarm Optimization, (ii) Genetic Algorithm and (iii) a two-phase HUIM found in the literature. The proposed HUIM algorithms are applied on seven datasets, where OnlineRetail dataset is a real-life dataset and the objective there is to segment high value customers based on monetary value. From the results, it is clear that BDE based HUIM outperformed the extant algorithms in literature and also the ABDE HUIM algorithm on all datasets with respect to the maximum number of itemsets mined.