High Performance Data Mining in Time Series: Techniques and Case Studies

✍ Scribed by Zhu Y.

Year: 2004
Tongue: English
Leaves: 274
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

The first part of this dissertation describes the framework for high performance time series data mining based on important primitives. Data reduction transform such as the Discrete Fourier Transform, the Discrete Wavelet Transform, Singular Value Decomposition and Random Projection, can reduce the size of the data without substantial loss of information, therefore provides a synopsis of the data. Indexing methods organize data so that the time series data can be retrieved e+ciently. Transformation on time series, such as shifting, scaling, time shifting, time scaling and dynamic time warping, facilitates the discovery of flexible patterns from time series. The second part of this dissertation integrates the above primitives into useful applications ranging from music to physics to finance to medicine.

📜 SIMILAR VOLUMES

High Performance Discovery in Time Serie

📁 High Performance Discovery in Time Series: Techniques and Case Studies

✍ Dennis Shasha, Yunyue Zhu 📂 Library 📅 2004 🏛 Springer 🌐 English

<p><P></P><P>Time-series data—data arriving in time order, or a data stream—can be found in fields such as physics, finance, music, networking, and medical instrumentation. Designing fast, scalable algorithms for analyzing single or multiple time series can lead to scientific discoveries, medical di

High Performance Data Mining

📁 High Performance Data Mining

✍ Guo, Grossman 📂 Library 🏛 Kluwer 🌐 English

High Performance Data Mining

📁 High Performance Data Mining

✍ Guo, Grossman. (eds.) 📂 Library 📅 2000 🏛 Kluwer 🌐 English

Contains four refereed papers covering important classes of data mining algorithms: classification, clustering, association rule discovery, and learning Bayesian networks. Srivastava et al present a detailed analysis of the parallelization strategy of tree induction algorithms. Xu et al present a pa

High Performance Multidimensional Analys

📁 High Performance Multidimensional Analysis and Data Mining

✍ Goil S., Choudhary A. 📂 Library 📅 1998 🌐 English

Summary information from data in large databases is used to answer queries in On-Line Analytical Processing (OLAP) systems and to build decision support systems over them. The Data Cube is used to calculate and store summary information on a variety of dimensions, which is computed only partially if

Data Mining with R: Learning with Case S

📁 Data Mining with R: Learning with Case Studies (Chapman & Hall CRC Data Mining and Knowledge Discovery Series)

✍ Luis Torgo 📂 Library 📅 2010 🏛 Chapman and Hall/CRC 🌐 English

Data Mining with R: Learning with Case S

📁 Data Mining with R: Learning with Case Studies (Chapman & Hall CRC Data Mining and Knowledge Discovery Series)

✍ Luis Torgo 📂 Library 📅 2011 🏛 Chapman and Hall/CRC 🌐 English