A review on time series data mining

T Fu - Engineering Applications of Artificial Intelligence, 2011‏ - Elsevier
Time series is an important class of temporal data objects and it can be easily obtained from
scientific and financial applications. A time series is a collection of observations made …

A survey on learning from data streams: current and future trends

J Gama - Progress in Artificial Intelligence, 2012‏ - Springer
Nowadays, there are applications in which the data are modeled best not as persistent
tables, but rather as transient data streams. In this article, we discuss the limitations of …

[كتاب][B] Data mining: concepts and techniques

J Han, J Pei, H Tong - 2022‏ - books.google.com
Data Mining: Concepts and Techniques, Fourth Edition introduces concepts, principles, and
methods for mining patterns, knowledge, and models from various kinds of data for diverse …

Synopses for massive data: Samples, histograms, wavelets, sketches

G Cormode, M Garofalakis, PJ Haas… - … and Trends® in …, 2011‏ - nowpublishers.com
Abstract Methods for Approximate Query Processing (AQP) are essential for dealing with
massive data. They are often the only means of providing interactive response times when …

Similarity estimation techniques from rounding algorithms

MS Charikar - Proceedings of the thiry-fourth annual ACM symposium …, 2002‏ - dl.acm.org
(MATH) A locality sensitive hashing scheme is a distribution on a family \F of hash functions
operating on a collection of objects, such that for two objects x, y, Pr h εF h (x)= h (y)= sim (x …

An improved data stream summary: the count-min sketch and its applications

G Cormode, S Muthukrishnan - Journal of Algorithms, 2005‏ - Elsevier
We introduce a new sublinear space data structure—the count-min sketch—for summarizing
data streams. Our sketch allows fundamental queries in data stream summarization such as …

Models and issues in data stream systems

B Babcock, S Babu, M Datar, R Motwani… - Proceedings of the twenty …, 2002‏ - dl.acm.org
In this overview paper we motivate the need for and research issues arising from a new
model of data processing. In this model, data does not take the form of persistent relations …

Data streams: Algorithms and applications

S Muthukrishnan - Foundations and Trends® in Theoretical …, 2005‏ - nowpublishers.com
In the data stream scenario, input arrives very rapidly and there is limited memory to store
the input. Algorithms have to work with one or few passes over the data, space less than …

Approximate frequency counts over data streams

GS Manku, R Motwani - VLDB'02: Proceedings of the 28th International …, 2002‏ - Elsevier
Publisher Summary This chapter presents algorithms for computing frequency counts
exceeding a user-specified threshold over data streams. The algorithms are simple and …

Maintaining stream statistics over sliding windows

M Datar, A Gionis, P Indyk, R Motwani - SIAM journal on computing, 2002‏ - SIAM
We consider the problem of maintaining aggregates and statistics over data streams, with
respect to the last N data elements seen so far. We refer to this model as the sliding window …