Mining Recent Maximal Frequent Itemsets Over Data Streams with Sliding Window
Journal: The International Arab Journal of Information Technology (Vol.16, No. 6)Publication Date: 2019-11-01
Authors : Saihua Cai; Shangbo Hao; Ruizhi Sun; Gang Wu;
Page : 961-969
Keywords : Data streams; recent maximal frequent itemsets; sliding window; matrix structure.;
Abstract
The huge number of data streams makes it impossible to mine recent frequent itemsets. Due to the maximal frequent itemsets can perfectly imply all the frequent itemsets and the number is much smaller, therefore, the time cost and the memory usage for mining maximal frequent itemsets are much more efficient. This paper proposes an improved method called Recent Maximal Frequent Itemsets Mining (RMFIsM) to mine recent maximal frequent itemsets over data streams with sliding window. The RMFIsM method uses two matrixes to store the information of data streams, the first matrix stores the information of each transaction and the second one stores the frequent 1-itemsets. The frequent p-itemsets are mined with “extension” process of frequent 2-itemsets, and the maximal frequent itemsets are obtained by deleting the sub-itemsets of long frequent itemsets. Finally, the performance of the RMFIsM method is conducted by a series of experiments, the results show that the proposed RMFIsM method can mine recent maximal frequent itemsets efficiently
Other Latest Articles
- The level of vascular endothelial growth factor in peripheral blood of type 2 diabetic patients depending on kidney functional state
- Innovative directions of CKD prevention and treatment
- Medical Data Framework Using Blockchain Technology
- Technology Elements that Influence the Implementation Success for Big Data Analytics and IoT- Oriented Transportation System
- Modeling and Formal Verification of Web Services Composition Using CADP
Last modified: 2019-11-11 21:06:28