Sciweavers

109 search results - page 1 / 22
» A Thorough Experimental Study of Datasets for Frequent Items...
Sort
View
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
13 years 10 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, ...
JIIS
2010
106views more  JIIS 2010»
12 years 11 months ago
A new classification 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, ...
FIMI
2003
120views Data Mining» more  FIMI 2003»
13 years 6 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, ...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
13 years 10 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
RCIS
2010
13 years 2 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu