Journal
IEEE ACCESS
Volume 9, Issue -, Pages 56318-56329Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3070132
Keywords
Data mining; Data models; Databases; Urban areas; Itemsets; Mathematical model; Information technology; Pattern mining; data streams; frequent weighted patterns; sliding window model
Ask authors/readers for more resources
This study proposes an algorithm for mining FWPs over data streams by introducing a sliding window model and SWN-tree to maintain information. Empirical experiments indicate that the algorithm outperforms the state-of-the-art NFWI algorithm in batch mode with sliding window processing.
The mining of frequent weighted patterns (FWPs) that considers the different semantic significance (weight) of items is more suitable for practice than the mining of frequent patterns. Therefore, it plays a vital role in real-world scenarios. However, there exist several limitations when applying methods for mining FWPs designed for static data on growth datasets, especially data streams. Hence, this study proposes an algorithm for mining FWPs over data streams. First, we introduce the concept of mining FWPs over data streams via a sliding window model. Then, we introduce a modification of the weighted node tree (WN-tree) named SWN-tree that has the ability to maintain the information over data streams. Next, this study develops a method for mining FWPs over data streams employing a sliding window model based on SWN-tree. This method is called FWPODS (Frequent Weighted Patterns Over Data Stream) algorithm. Finally, we conduct empirical experiments to compare the performances of our approach and the state-of-the-art algorithm (NFWI) for mining FWPs over data streams. The results of experiment indicate that our approach outperforms the NFWI algorithm when running in batch mode in a sliding window.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available