Sciweavers

JIIS
2006
119views more  JIIS 2006»
13 years 10 months ago
Answering constraint-based mining queries on itemsets using previous materialized results
Abstract In recent years, researchers have begun to study inductive databases, a new generation of databases for leveraging decision support applications. In this context, the user...
Roberto Esposito, Rosa Meo, Marco Botta
FIMI
2003
104views Data Mining» more  FIMI 2003»
13 years 11 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
2004
172views Data Mining» more  FIMI 2004»
13 years 11 months ago
AIM2: Improved implementation of AIM
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
Sagi Shporer
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 11 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
PAKDD
2010
ACM
208views Data Mining» more  PAKDD 2010»
13 years 12 months ago
Efficient Pattern Mining of Uncertain Data with Sampling
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
Toon Calders, Calin Garboni, Bart Goethals
CIKM
2006
Springer
14 years 1 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
PAKDD
2004
ACM
164views Data Mining» more  PAKDD 2004»
14 years 3 months ago
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
Francesco Bonchi, Bart Goethals
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 3 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
PAKDD
2007
ACM
148views Data Mining» more  PAKDD 2007»
14 years 4 months ago
Mining Frequent Itemsets from Uncertain Data
Abstract. We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential...
Chun Kit Chui, Ben Kao, Edward Hung
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 4 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