On the Internet of Things (IoT) environment, interconnected devices continuously share generated data in real time, typically collected with a specific purpose. To ensure efficiency, IoT technology must deliver only the most relevant insights into these devices. High utility pattern mining is a technique that extracts important knowledge, and there has been research on performance improvements to efficiently mine these patterns in dynamic environments. Although approaches with a prelarge concept have been introduced to mining high utility patterns in data deletion environments, the state-of-the-art method relies on inefficient data structures, making them unsuitable for real-time analysis with IoT data. To overcome these limitations, this article proposes a novel utility pattern mining approach with prelarge concept for dynamic IoT environments, where data is deleted because of sensor errors or storage constraints. The actual utilities of the prelarge patterns are maintained to skip the verification and improve communication delays. It can optimize processing time and memory consumption due to storing fewer large or prelarge patterns based on the actual utility. The proposed method operates in an efficient list-based manner, enabling effective search space pruning when the rescan condition is met and generating compact data structures through transaction merging. The experiments indicate that our algorithm is outstanding regarding processing time and scalability with minimal compromise in memory consumption compared with the existing methods, while extracting the exact patterns. Additionally, an analysis that replicates real IoT environments demonstrates that the proposed method is sufficiently applicable in real-world settings.

In a manufacturing factory, product lines are organized by several constituents and exhibit a profit value, i.e., income from products. Erasable patterns are less profitable patterns whose gain, i.e., the sum of product profits, does not exceed a user-defined threshold. Mining erasable patterns provides the necessary information to users who want to increase profits by erasing less profitable patterns. There are requirements for a method which efficiently manages uncertain databases in incremental environments to identify erasable patterns that consider uncertainty. Because our novel technique uses a list structure, it is more efficient at finding erasable patterns from incremental databases. Moreover, accumulated stream data should be handled efficiently to identify new useful patterns in both additional data and the existing data. In this article, an algorithm using a list-based structure is proposed to extract erasable patterns containing valuable knowledge from uncertain databases in real time with effective and productive performance. In order to derive erasable patterns from continuously accumulated stream databases, the structure efficiently manages the information gathered from the previous database. Extensive performance and pattern quality evaluations were conducted using real and synthetic datasets. The results show that the algorithm performs up to seven times faster than state-of-the-art erasable pattern mining algorithms on real datasets and scales adeptly on synthetic datasets while delivering reliable and significant result patterns.

The Internet of Things (IoT) environment includes things that exchange information using data generated through sensors. The IoT technology can be executed efficiently by providing the necessary information to things instead of transmitting all the data. There is a need for an algorithm that can extract meaningful information for the things from the data. High utility pattern mining, which can handle the characteristics of real-world databases better than traditional pattern mining methods, has been actively researched. The traditional high utility pattern mining techniques find meaningful patterns from static databases. Therefore, these techniques are not suitable for the dynamically changing databases in the real world. In order to solve this problem, a variety of methods that consider the modifications, deletions, and insertions of transactions are proposed. The prelarge concept, which can be efficiently operated by reducing the rescanning of the original database using two thresholds, was also proposed in order to handle the limitations of the methods that are used for static databases. In the prelarge concept, the large patterns and the prelarge patterns that are discovered are maintained and used for the next transaction change. In this article, we proposed a new method pre-large based incremental high utility pattern mining for transaction modification (PIHUP-MOD) implemented as a tree structure in order to handle the transaction modifications. The method has an efficient structure and techniques to mine high utility patterns in the transaction modifications with the prelarge concept. We conducted the performance evaluation, and the experimental results on the real datasets and the synthetic datasets showed that the proposed approach has a better performance than the state-of-the-art approaches in terms of the runtime, memory usage, and scalability.

Databases that deal with the real world have various characteristics. New data is continuously inserted over time without limiting the length of the database, and a variety of information about the items constituting the database is contained. Recently generated data has a greater influence than the previously generated data. These are called the time-sensitive non-binary stream databases, and they include databases such as web-server click data, market sales data, data from sensor networks, and network traffic measurement. Many high utility pattern mining and stream pattern mining methods have been proposed so far. However, they have a limitation that they are not suitable to analyze these databases, because they find valid patterns by analyzing a database with only some of the features described above. Therefore, knowledge-based software about how to find meaningful information efficiently by analyzing databases with these characteristics is required. In this article, we propose an intelligent information system that calculates the influence of the insertion time of each batch in a large-scale stream database by applying the sliding window model and mines recent high utility patterns without generating candidate patterns. In addition, a novel list-based data structure is suggested for a fast and efficient management of the time-sensitive stream databases. Moreover, our technique is compared with state-of-the-art algorithms through various experiments using real datasets and synthetic datasets. The experimental results show that our approach outperforms the previously proposed methods in terms of runtime, memory usage, and scalability.