284 search results - page 7 / 57 » Mining Frequent Itemsets in Distributed and Dynamic Database... |
109
click to vote
DAWAK
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
FIMI
2004
14 years 11 months ago
2004
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
169
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
85
Voted
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...