Scalable and Efficient Approach for High Temporal Fuzzy Utility Pattern Mining.

Fuzzy utility (FU) pattern mining with an advantage in human reasoning has become one of the interesting topics in studies of knowledge discovery. The discovered information in FU pattern mining from real-life quantitative databases with item profits is suitable for interpreting data from a human perspective because it is not expressed using numerical values but linguistic terms which consist of natural languages. State-of-the-art approaches in this literature provide extended results by considering temporal factors, such as seasons, which can be influential in real-life situations. However, they still suffer from scalability issues because they are based on level-wise approaches which generate a number of candidates. In this article, we propose a scalable and efficient approach with a novel data structure for mining high temporal FU patterns without generating candidates. Efficient pruning techniques and algorithms are presented to improve the performance of the proposed approach. Performance experiments on both real and synthetic datasets show that the suggested algorithm has better performance than the state-of-the-art algorithms in terms of runtime, memory usage, and scalability.

Mining high occupancy patterns to analyze incremental data in intelligent systems.

High occupancy pattern mining has been recently studied as an improved method for frequent pattern mining. It considers the proportion of each pattern in the transactions where the pattern occurred. The results of high occupancy pattern mining can be employed for automated control systems in order to make decisions. Meanwhile, the features of the databases have changed, because information technology has advanced. In real-world databases, new transactions are inserted in real time. However, the state-of-the-art approach to high occupancy pattern mining cannot handle incremental databases. Moreover, the existing method also requires a large amount of memory space, because it adopted a BFS-based search in order to find patterns. In this paper, we propose an approach, which is called HOMI (High Occupancy pattern Mining on Incremental databases), that uses a DFS-based search in order to detect patterns, and it mines high occupancy patterns on incremental databases. The performance analysis for both real and synthetic datasets indicates that HOMI has better performance than the state-of-the-art approaches and related algorithms.