DDR: An index method for large time-series datasets

Information Systems

Volumn 30, Issue 5, 2005, Pages 333-348

  An, Jiyuan ^a   Chen, Yi Ping Phoebe ^a,b   Chen, Hanxiong ^c  

^a DEAKIN UNIVERSITY   (Australia)

^b Australian Government Australian Research Council   (Australia)

^c UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Dimensionality reduction; Indexing; Time series

Indexed keywords

DATA MINING; DATA REDUCTION; FILTRATION; INFORMATION ANALYSIS; PATTERN RECOGNITION; STATISTICAL METHODS;

DATASETS; DIMENSIONALITY REDUCTION; INDEXING; TIME SERIES;

TIME SERIES ANALYSIS;

EID: 14544274484     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2004.05.001     Document Type: Article

References (19)

1. A. Guttman, R-tree:a dynamic index structure for spatial searching, in: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, 1984, pp. 47-57.
2. N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger, The R*-tree:an efficient and robust access method for points and rectangles, in: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, 1990, pp. 322-331.
3. N. Katayama, S. Satoh, The sr-tree: an index structure for high-dimensional nearest neighbor queries, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, 1997, pp. 369-380.
4. K. Chakrabarti, S. Mehrotra, The hybrid tree: an index structure for high dimensional feature space, in: ICDE1999, 1999, pp. 440-447.
5. R. Agrawal, C. Faloutsos, A.N. Swami, Efficient similarity search in sequence databases, in: Proceedings of the Fourth Conference on FODO, 1993, pp. 69-84.
6. E.J. Keogh, M.J. Pazzani, A simple dimensionality reduction technique for fast similarity search in large time series databases, in: Proceedings of the Pacific-Asia Conference on Knowledage Discovery and Data Mining (PAKDD'00), 2000, pp. 122-133.
7. B.-K. Yi, C. Faloutsos, Fast time sequence indexing for arbitrary lp norms, in: Proceedings of 26th International Conference on Very Large Data Bases, 2000, pp. 385-394.
8. E.J. Keogh, K. Chakrabarti, S. Mehrotra, M.J. Pazzani, Locally adaptive dimensionality reduction for indexing large time series databases, in: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, 2001, pp. 151-162.
9. K. Chakrabarti, S. Mehrotra, Locally dimensionality reduction: a new approach to indexing high dimensional spaces, in: Proceedings of 26th International Conference on Very Large Data Bases, 2000, pp. 151-162.
10. R. Weber, H.J. Schek, S. Blott, A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces, in: Proceedings of 24th International Conference on Very Large Data Bases, 1998, pp. 194-205.
11. J. An, H. Chen, K. Furuse, M. Ishikawa, N. Ohbo, The convex polyhedra technique: an index structure for high-dimensional space, in: Proceedings of the 13th Australasian Database Conference, 2002, pp. 33-40.
12. J. An, H. Chen, K. Furuse, M. Ishikawa, N. Ohbo, A vector-wise dimensionality reduction for indexing high dimensional data, in: Proceedings of Pan-Yellow-Sea International Workshop on Information Technologies for Network Era, 2002, pp. 135-142.
13. 2VA :trim high dimensional indexes, in: Proceedings of WAIM 2002, 2002, pp. 303-315.
14. J. An, H. Chen, K. Furuse, N. Ohbo, E. Keogh, Grid-based indexing for large time series databases, in: Proceedings of Fourth International Conference on Intelligent Data Engineering and Automated Learning, 2003, pp. 614-621.
15. G. Moody, Mit-bih Database Distribution, Cambridge, MA, 2000; [http://ecg.mit.edu/index.html].
16. Y.L. Wu, D. Agrawal, A.E. Abbadi, A comparison of dft and dwt based similarity search in time-series databases, in: Proceedings of CIKM International Conference on Information and Knowledge Management, 2000, pp. 488-495.
17. H.V. Jagadish, N. Koudas, S. Muthukrishnan, Mining deviants in a time series database, in: Proceedings of 25th International Conference on Very Large Data Bases, 1999, pp. 102-113.
18. T. Seidl, H. Kriegel, Optimal multi-step k-nearest neighbor queries, in: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, 1998, pp. 154-165.
19. E.J. Keogh, T. Folias, The ucr time series data mining archive, Computer Science and Engineering Department, University of California, Riverside, CA, 2002. [http://www.cs.ucr.edu/~eamonn/TSDMA/index.html].