164 search results - page 1 / 33 » Sequential update of ADtrees |
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
Ingcreasingly, data-mining algorithms must deal with databases that continuously grow over time. These algorithms must avoid repeatedly scanning their databases. When database att...
AAAI
2008
13 years 7 months ago
2008
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...
SMC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— We consider the problem of efficiently storing ngram counts for large n over very large corpora. In such cases, the efficient storage of sufficient statistics can ha...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
In this paper, we first define a difference measure between the old and new sequential patterns of stream data, which is proved to be a distance. Then we propose an experimental me...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...