Search

Mining patterns with high utilization (or called high-utility itemset mining, HUIM) is considered a major issue in recent decades especially in the market (e.g., supermarket) engineering since it reveals the profitable information/products for decision-making. Many existing works focused on mining high-utility itemsets from databases that revealed a very large amount of patterns. This process cannot make the precise decision in a short time, e.g., real-time and online decision-making system, since it is not a trivial task to find the appropriate and useful information from a huge amount of the discovered knowledge in a limited time. Mining closed patterns with high utilization (or called closed high-utility pattern mining) is an alternative way to reveal fewer and concise patterns with high utilization in market engineering. However, many past works considered the complete mining progress of all HUIs and they do not consider the correlation between transactions thus when the transactions are not highly relevant, the trained model could not be perfectly used for the predication, which shows inappropriate results in machine learning tasks. In this paper, we consider the clustering models that can divide the transactions into the proper groups based on their correlation, which can be used to make a better accuracy model for prediction. To reduce the mining progress of the CHUIs, a compact GA model is also used in the mining progress, thus in the large-scale situation, a sufficient number of satisfied CHUIs can be discovered in a limited time. Based on the designed framework, the designed model can, not only mine the good enough CHUIs in the limited time for the large-scale environment but also the adopted clustering concept can make a better predictive model in the machine learning process, thus higher accuracy results can be obtained. Experimental results are then evaluated to compare the state-of-the-art CHUI-Miner and CLS-Miner with the developed DcGA model, and the designed DcGA achieves the best runtime performance and satisfied mining results. • A clustering model is utilized to group the transactions with high correlation. • A compact GA is utilized to find the satisfied patterns in a limit time. • Better performance is obtained compared to the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

It is uncertain whether products will be manufactured as defective products. Producing the defective products causes the waste of time and finance in the industrial fields. When the financial crisis occurs in the manufacturing plants, production lines of the less profitable products should be stopped. To overcome the financial crisis, it is required to find the production lines that manufacture the less profitable commodities and are likely to produce the faulty merchandises and remove the corresponding production lines in order to increase the profit. Erasable pattern mining has been suggested to analyze and solve the financial problems by discovering patterns with low profit. As databases become more diverse due to the environment and characteristics of data, demands for erasable pattern mining that processes the various databases increase. An uncertain database, which is one of diverse types of databases, includes the probability related to the item, such as the probability of existence and the probability of defects. Erasable pattern mining, which considers the probability of each item, can discover pattern results which are more suitable for purpose of users. Motivated by this, we propose an efficient tree-based erasable pattern mining algorithm from the uncertain database. Considering the probability of the item, the suggested algorithm extracts erasable patterns with low profits from the uncertain database. Since both profit of the product and the probability of the item are considered, the discovered patterns are more meaningful than the patterns found by the existing erasable pattern mining. Moreover, the proposed method improves the mining operations by utilizing a list structure as well as a tree structure. We performed a performance evaluation on diverse real and synthetic datasets in order to prove the proposed algorithm outperforms the existing erasable pattern mining algorithms. The differences in runtime, memory usage, and scalability are shown through the comparison of performance with other state-of-the-art algorithms and the suggested algorithm. [ABSTRACT FROM AUTHOR]

High utility pattern mining (HUPM) discovers meaningful patterns by considering features of items and utility from non-binary data. Data called stream data is continually generated over time. Various techniques based on high utility pattern mining have been suggested for processing stream data. High utility pattern mining based on a sliding window performs pattern mining using a window. Since it uses only the data stored in a window, only the latest data can be managed. However, Stream data has the property that newly created data has a higher influence than relatively old data. It is necessary to consider the importance of the data stored in a window differently. In this paper, we propose an efficient algorithm based on a sliding window approach that mines high utility patterns considering the latest data more significantly from damped stream data where new data is constantly being inserted. In other words, our technique divides the stream data into fixed-sized multiple batch data and processes differently the importance of each batch data in a window according to the added time using the decaying factor. Moreover, we conduct experiments to compare and analyze our approach with the state-of-the-art algorithms using real and synthetic datasets. The experimental results show that our proposed method outperforms the competitors in terms of run time, memory usage, and scalability test. [ABSTRACT FROM AUTHOR]

Several pattern mining methods have been proposed to process dynamic data streams because the data generated in industrial fields is continually accumulated. Erasable pattern mining techniques for processing dynamic data streams are needed to discover erasable patterns from dynamic data streams. In previous erasable pattern mining approaches suggested for dynamic data streams, all data are considered to have the same importance regardless of its timestamp. However, dynamic data streams have the characteristic that the new data is relatively more significant than the old data. In erasable pattern mining, one of the desired techniques is an approach in consideration of such characteristic of data streams. For this reason, we propose an erasable pattern mining algorithm over dynamic data streams based on the damped window model. Since the suggested technique considers the new data more important than the previous data, it can find more useful erasable patterns. In addition, erasable pattern mining based on the damped window model is conducted efficiently by employing the tree and table structures. In performance test, we present that our pruning techniques remove unnecessary operations related to invalid erasable patterns efficiently from damped-window-based data streams. Performance evaluation results using real datasets and synthetic datasets show that the proposed approach has good performance with regard to as execution time, pattern generation, and scalability by comparing between the suggested technique and the state of the art algorithms. [ABSTRACT FROM AUTHOR]

• Efficient Incremental Weighted Erasable Pattern Mining is suggested. • List structures for incremental weighted erasable patterns are proposed. • Pruning techniques considering the list structures are presented. • Performance improvements are shown with various experiments. Erasable pattern mining is one of the important fields of frequent pattern mining. It diagnoses and solves the economic problems that arise in the manufacturing industry. The real-world database is continually accumulated over time, and each item has a different importance. Therefore, if we use conventional erasable pattern mining without considering the characteristics of the real-world database, less meaningful patterns can be extracted. Also, when mining a real-world database, the algorithm must be able to process operations quickly and efficiently. In this paper, in order to meet these requirements, we propose an algorithm which is implemented as a list structure for mining erasable patterns in an incremental database with weighted condition. Compared to existing state-of-the-art mining algorithms, the proposed algorithm performs pattern pruning by applying weighted condition to a dynamic database, so it extracts fewer candidate patterns and shows fast performance. We test our algorithms and the algorithms previously presented with various real datasets and synthetic datasets and obtained results such as run time, memory usage, scalability, and accuracy tests. By analyzing and comparing these experimental results, we show that the proposed algorithm has outstanding performance. [ABSTRACT FROM AUTHOR]