Sciweavers

313 search results - page 19 / 63
» Mining Frequent Itemsets in a Stream
Sort
View
CIKM
2006
Springer
15 years 1 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
KAIS
2006
110views more  KAIS 2006»
14 years 9 months ago
Catch the moment: maintaining closed frequent itemsets over a data stream sliding window
Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Mun...
JCST
2008
119views more  JCST 2008»
14 years 9 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
HIPC
2003
Springer
15 years 2 months ago
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
Adriano Veloso, Matthew Eric Otey, Srinivasan Part...
SIGCOMM
2010
ACM
14 years 9 months ago
Automating root-cause analysis of network anomalies using frequent itemset mining
Finding the root-cause of a network security anomaly is essential for network operators. In our recent work [1, 5], we introduced a generic technique that uses frequent itemset mi...
Ignasi Paredes-Oliva, Xenofontas A. Dimitropoulos,...