Issues in time series querying.

• Other Authors: Lau, Yung Hang.
• Format: Others
• Language: English; Chinese
• Published: 2005
• Subjects: Time-series analysis; Dynamic programming; Scaling (Social sciences)
• Online Access: http://library.cuhk.edu.hk/record=b5892585; http://repository.lib.cuhk.edu.hk/en/item/cuhk-325370

Lau Yung Hang. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. === Includes bibliographical references (leaves 78-82). === Abstracts in English and Chinese. === Abstract --- p.i === Acknowledgement --- p.iii === List of Figures --- p.viii === List of Tables --- p.x === List of Algorithms --- p.xi === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Justifying the Need for US and DTW --- p.1 === Chapter 1.2 --- Motivating Examples --- p.3 === Chapter 1.3 --- Contributions --- p.9 === Chapter 1.4 --- Thesis Organization --- p.10 === Chapter 2 --- Problem Definition --- p.11 === Chapter 3 --- Preliminaries --- p.13 === Chapter 3.1 --- Time Warping Distance --- p.13 === Chapter 3.2 --- Constraints and Lower Bounding --- p.16 === Chapter 3.3 --- Uniform Scaling --- p.20 === Chapter 3.3.1 --- Lower bounding uniform scaling --- p.21 === Chapter 4 --- Scaling and Time Warping --- p.23 === Chapter 4.1 --- Tightness of the lower bounds --- p.27 === Chapter 4.2 --- Experimental Evaluation --- p.32 === Chapter 5 --- A Faster and more Flexible Approach --- p.41 === Chapter 5.1 --- The Enveloping Sequences Revisited --- p.41 === Chapter 5.2 --- Speeding up LB Distance Computation --- p.43 === Chapter 5.3 --- Experimental Evaluation --- p.44 === Chapter 5.3.1 --- Query Time Comparison --- p.44 === Chapter 5.3.2 --- Effect on Pruning Power --- p.46 === Chapter 6 --- Indexing for SWM --- p.49 === Chapter 6.1 --- Related Work --- p.49 === Chapter 6.1.1 --- Fast subsequence matching --- p.49 === Chapter 6.1.2 --- Duality-based subsequence matching --- p.50 === Chapter 6.1.3 --- Nearest Neighbor Search --- p.53 === Chapter 6.1.4 --- Dimension Reduction --- p.57 === Chapter 6.2 --- Proposed Indexing for SWM --- p.60 === Chapter 6.2.1 --- Index construction algorithm --- p.60 === Chapter 6.2.2 --- Utilizing the index --- p.61 === Chapter 6.2.3 --- Nearest Neighbor Search --- p.63 === Chapter 6.3 --- Experimental Evaluation --- p.64 === Chapter 6.3.1 --- Range Queries --- p.64 === Chapter 6.3.2 --- One nearest neighbor search --- p.68 === Chapter 6.3.3 --- k-nearest neighbor search --- p.72 === Chapter 7 --- Conclusion --- p.76 === Bibliography --- p.78