INDEXING TIME-SERIES UNDER CONDITIONS OF NOISE
暂无分享,去创建一个
[1] Horst Bunke,et al. Classes of cost functions for string edit distance , 2006, Algorithmica.
[2] Pankaj K. Agarwal,et al. Indexing Moving Points , 2003, J. Comput. Syst. Sci..
[3] Eamonn J. Keogh,et al. Locally adaptive dimensionality reduction for indexing large time series databases , 2001, SIGMOD '01.
[4] Ambuj K. Singh,et al. Variable length queries for time series data , 2001, Proceedings 17th International Conference on Data Engineering.
[5] Jonathan Goldstein,et al. Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches , 2000, VLDB.
[6] Sharad Mehrotra,et al. Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces , 2000, VLDB.
[7] Christos Faloutsos,et al. Fast Time Sequence Indexing for Arbitrary Lp Norms , 2000, VLDB.
[8] Alberto O. Mendelzon,et al. Querying Time Series Data Based on Similarity , 2000, IEEE Trans. Knowl. Data Eng..
[9] Eamonn J. Keogh,et al. Scaling up dynamic time warping for datamining applications , 2000, KDD '00.
[10] Christian S. Jensen,et al. Indexing the positions of continuously moving objects , 2000, SIGMOD '00.
[11] Haixun Wang,et al. Landmarks: a new model for similarity-based pattern querying in time series databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[12] Deok-Hwan Kim,et al. Similarity search for multidimensional data sequences , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[13] Margrit Betke,et al. THE CAMERA MOUSE: PRELIMINARY INVESTIGATION OF AUTOMATED VISUAL TRACKING FOR COMPUTER ACCESS , 2000 .
[14] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[15] Padhraic Smyth,et al. Trajectory clustering with mixtures of regression models , 1999, KDD '99.
[16] Dimitrios Gunopulos,et al. On indexing mobile objects , 1999, PODS '99.
[17] Man Hon Wong,et al. Fast time-series searching with scaling and shifting , 1999, PODS '99.
[18] Jonathan Goldstein,et al. When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.
[19] Daniel Barbará,et al. Mobile Computing and Databases - A Survey , 1999, IEEE Trans. Knowl. Data Eng..
[20] Changzhou Wang,et al. Supporting fast search in time series for movement patterns in multiple scales , 1998, CIKM '98.
[21] Hans-Jörg Schek,et al. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.
[22] Christos Faloutsos,et al. Efficient retrieval of similar time sequences under time warping , 1998, Proceedings 14th International Conference on Data Engineering.
[23] Dimitrios Gunopulos,et al. Time-series similarity problems and well-separated geometric sets , 1997, SCG '97.
[24] Dimitrios Gunopulos,et al. Finding Similar Time Series , 1997, PKDD.
[25] Christos Faloutsos,et al. A signature technique for similarity-based queries , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).
[26] Kyuseok Shim,et al. Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.
[27] Alberto O. Mendelzon,et al. Similarity-based queries , 1995, PODS '95.
[28] Donald J. Berndt,et al. Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.
[29] Christos Faloutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[30] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[31] S. Chiba,et al. Dynamic programming algorithm optimization for spoken word recognition , 1978 .
[32] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[33] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .