Abstract
Continual data checking is considered as one of the most common search tools for frequent itemsets which requires storage on memory. On the other hand, according to properties of data stream which are unlimited productions with a high-speed, it is not possible saving these data on memory and we need for techniques which enables online processing and finding repetitive standards. One of the most popular techniques in this case is using sliding windows. The benefits of these windows can be reducing memory usage and also search acceleration. In this article, a new vertical display and an algorithm is provided based on the pins in order to find frequent itemsets in data streams. Since this new display has a compressed format itself so, the proposed algorithm in terms of memory consumption and processing is more efficient than any other similar algorithms.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
