Average utility driven data analytics on damped windows for intelligent systems with data streams

In industrial areas, most of databases are dynamic databases, and the volume of the databases has grown with the passage of time. Especially, pattern mining for incremental database needs different approaches from static database because the profit or the accuracy of the previously inserted data can...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of intelligent systems 2021-10, Vol.36 (10), p.5741-5769
Hauptverfasser: Kim, Jongseong, Yun, Unil, Kim, Hyunsoo, Ryu, Taewoong, Lin, Jerry Chun‐Wei, Fournier‐Vier, Philippe, Pedrycz, Witold
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In industrial areas, most of databases are dynamic databases, and the volume of the databases has grown with the passage of time. Especially, pattern mining for incremental database needs different approaches from static database because the profit or the accuracy of the previously inserted data can be reduced. Since data is time‐ sensitive, the recent data has a relatively higher value than the old data. In this paper, we suggest the damped window based average utility driven data analytics for intelligent systems, which the damped window reflects the importance according to the arrival time of the transactions. The proposed mining approach adopts novel data structure, which modify the importance of item as the passage of time, and it improves mining efficiency with several pruning strategies and without generating candidate patterns. To evaluate the performance of the proposed mining approach, we conducted various experiments using several real and synthetic data sets. The result of the experiments presented that the suggested method performs better in terms of runtime and memory usage than the other state‐of‐the‐art mining techniques. Moreover, through the scalability experiments, which changed the number of different items or transactions, we verified that the proposed algorithm maintained a stable performance under various environmental changes.
ISSN:0884-8173
1098-111X
DOI:10.1002/int.22528