Issues in time series querying.

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.iAcknowledgement --- p.iiiList of Figures --- p.viiiList of Tables --- p.xList of Algorithms --- p.xiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Justifying the Need for US and DTW --- p.1Chapter 1.2 --- Motivating Examples --- p.3Chapter 1.3 --- Contributions --- p.9Chapter 1.4 --- Thesis Organization --- p.10Chapter 2 --- Problem Definition --- p.11Chapter 3 --- Preliminaries --- p.13Chapter 3.1 --- Time Warping Distance --- p.13Chapter 3.2 --- Constraints and Lower Bounding --- p.16Chapter 3.3 --- Uniform Scaling --- p.20Chapter 3.3.1 --- Lower bounding uniform scaling --- p.21Chapter 4 --- Scaling and Time Warping --- p.23Chapter 4.1 --- Tightness of the lower bounds --- p.27Chapter 4.2 --- Experimental Evaluation --- p.32Chapter 5 --- A Faster and more Flexible Approach --- p.41Chapter 5.1 --- The Enveloping Sequences Revisited --- p.41Chapter 5.2 --- Speeding up LB Distance Computation --- p.43Chapter 5.3 --- Experimental Evaluation --- p.44Chapter 5.3.1 --- Query Time Comparison --- p.44Chapter 5.3.2 --- Effect on Pruning Power --- p.46Chapter 6 --- Indexing for SWM --- p.49Chapter 6.1 --- Related Work --- p.49Chapter 6.1.1 --- Fast subsequence matching --- p.49Chapter 6.1.2 --- Duality-based subsequence matching --- p.50Chapter 6.1.3 --- Nearest Neighbor Search --- p.53Chapter 6.1.4 --- Dimension Reduction --- p.57Chapter 6.2 --- Proposed Indexing for SWM --- p.60Chapter 6.2.1 --- Index construction algorithm --- p.60Chapter 6.2.2 --- Utilizing the index --- p.61Chapter 6.2.3 --- Nearest Neighbor Search --- p.63Chapter 6.3 --- Experimental Evaluation --- p.64Chapter 6.3.1 --- Range Queries --- p.64Chapter 6.3.2 --- One nearest neighbor search --- p.68Chapter 6.3.3 --- k-nearest neighbor search --- p.72Chapter 7 --- Conclusion --- p.76Bibliography --- p.7