492 search results - page 35 / 99 » Fast data stream algorithms using associative memories |
IDA
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
EDBTW
2006
Springer
13 years 11 months ago
2006
Springer
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—A facility for merging equivalent data streams can support multiple capabilities in a data stream management system (DSMS), such as query-plan switching and high availability. O...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...