Closed frequent itemsets mining over data streams for visualizing network traffic

Author(s):  
M. Jeyasutha ◽  
F. Ramesh Dhanaseelan
2019 ◽  
Vol 125 ◽  
pp. 58-71 ◽  
Author(s):  
Lázaro Bustio-Martínez ◽  
Martín Letras-Luna ◽  
René Cumplido ◽  
Raudel Hernández-León ◽  
Claudia Feregrino-Uribe ◽  
...  

2012 ◽  
Vol 256-259 ◽  
pp. 2910-2913
Author(s):  
Jun Tan

Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we proposed a novel sliding window based algorithm. The algorithm exploits lattice properties to limit the search to frequent close itemsets which share at least one item with the new transaction. Experiments results on synthetic datasets show that our proposed algorithm is both time and space efficient.


2016 ◽  
Vol 96 ◽  
pp. 645-653 ◽  
Author(s):  
Amine Farhat ◽  
Mohamed Salah Gouider ◽  
Lamjed Ben Said

Sign in / Sign up

Export Citation Format

Share Document