Sciweavers

148 search results - page 11 / 30
» Mining top-K frequent itemsets from data streams
Sort
View
FIMI
2003
120views Data Mining» more  FIMI 2003»
13 years 10 months ago
MAFIA: A Performance Study of Mining Maximal Frequent Itemsets
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...
Douglas Burdick, Manuel Calimlim, Jason Flannick, ...
CIKM
2006
Springer
14 years 8 days 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
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
14 years 2 months ago
A Thorough Experimental Study of Datasets for Frequent Itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
Frédéric Flouvat, Fabien De Marchi, ...
VLDB
2007
ACM
204views Database» more  VLDB 2007»
14 years 2 months ago
Optimization of Frequent Itemset Mining on Multiple-Core Processor
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
Eric Li, Li Liu
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
13 years 7 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo