Sciweavers

284 search results - page 23 / 57
» Mining Frequent Itemsets in Distributed and Dynamic Database...
Sort
View
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
15 years 1 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
JIIS
2006
119views more  JIIS 2006»
14 years 9 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
92
Voted
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
15 years 10 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
14 years 11 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
15 years 10 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan