Sciweavers

13 search results - page 1 / 3
» fimi 2003
Sort
View
FIMI
2003
108views Data Mining» more  FIMI 2003»
13 years 6 months ago
AFOPT: An Efficient Implementation of Pattern Growth Approach
Guimei Liu, Hongjun Lu, Jeffrey Xu Yu, Wei Wang 00...
FIMI
2003
104views Data Mining» more  FIMI 2003»
13 years 6 months ago
AIM: Another Itemset Miner
We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate...
Amos Fiat, Sagi Shporer
FIMI
2003
136views Data Mining» more  FIMI 2003»
13 years 6 months ago
Intersecting data to closed sets with constraints
We describe a method for computing closed sets with data-dependent constraints. Especially, we show how the method can be adapted to find frequent closed sets in a given data set...
Taneli Mielikäinen
FIMI
2003
84views Data Mining» more  FIMI 2003»
13 years 6 months ago
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
Takeaki Uno, Ken Satoh
FIMI
2003
123views Data Mining» more  FIMI 2003»
13 years 6 months ago
Apriori, A Depth First Implementation
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
Walter A. Kosters, Wim Pijls