Sciweavers

FIMI
2003
146views Data Mining» more  FIMI 2003»
13 years 10 months ago
ARMOR: Association Rule Mining based on ORacle
In this paper, we first focus our attention on the question of how much space remains for performance improvement over current association rule mining algorithms. Our strategy is...
Vikram Pudi, Jayant R. Haritsa
FIMI
2003
146views Data Mining» more  FIMI 2003»
13 years 10 months ago
Mining Frequent Itemsets using Patricia Tries
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
Andrea Pietracaprina, Dario Zandolin
FIMI
2003
170views Data Mining» more  FIMI 2003»
13 years 10 months ago
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
Salvatore Orlando, Claudio Lucchese, Paolo Palmeri...
FIMI
2003
136views Data Mining» more  FIMI 2003»
13 years 10 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
123views Data Mining» more  FIMI 2003»
13 years 10 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
FIMI
2003
95views Data Mining» more  FIMI 2003»
13 years 10 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
FIMI
2003
104views Data Mining» more  FIMI 2003»
13 years 10 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
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, ...
FIMI
2003
88views Data Mining» more  FIMI 2003»
13 years 10 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon
ISASSCI
2001
13 years 10 months ago
Data Mining Architectures - A Comparative Study
Data mining is the process of deriving knowledge from data. The architecture of a data mining system plays a significant role in the efficiency with which data is mined. It is pro...
Thomas Thomas, Sanjeev Jayakumar, B. Muthukumaran