메뉴 건너뛰기




Volumn 1805, Issue , 2000, Pages 122-133

A simple dimensionality reduction technique for fast similarity search in large time series databases

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INDEXING (OF INFORMATION);

EID: 84942742938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45571-x_14     Document Type: Conference Paper
Times cited : (172)

References (23)
  • 2
    • 0002644607 scopus 로고
    • Fast similarity search in the presence of noise, scaling, and translation in times-series databases
    • Agrawal, R., Lin, K. I., Sawhney, H. S., & Shim, K. (1995). Fast similarity search in the presence of noise, scaling, and translation in times-series databases. In VLDB.
    • (1995) VLDB
    • Agrawal, R.1    Lin, K.I.2    Sawhney, H.S.3    Shim, K.4
  • 7
    • 84976803260 scopus 로고
    • Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia dataset
    • Faloutsos, C. & Lin, K. (1995). Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proc ACM SIGMOD Conf, pp 163-174.
    • (1995) Proc ACM SIGMOD Conf , pp. 163-174
    • Faloutsos, C.1    Lin, K.2
  • 9
    • 85031999247 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proc ACM SIGMOD Conf, pp 47-57.
    • (1984) Proc ACM SIGMOD Conf , pp. 47-57
    • Guttman, A.1
  • 12
    • 17944378423 scopus 로고    scopus 로고
    • Dimensionality Reduction for Similarity Searching in Dynamic Databases
    • Kanth, K.V., Agrawal, D., & Singh, A. (1998). Dimensionality Reduction for Similarity Searching in Dynamic Databases. In Proc ACM SIGMOD Conf, pp. 166-176.
    • (1998) Proc ACM SIGMOD Conf , pp. 166-176
    • Kanth, K.V.1    Agrawal, D.2    Singh, A.3
  • 14
    • 85150810448 scopus 로고    scopus 로고
    • An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback
    • AAAI Press
    • Keogh, E., & Pazzani, M. (1998). An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. Proceedings of the 4"" International Conference of Knowledge Discovery and Data Mining, pp 239-241, AAAI Press.
    • (1998) Proceedings of the 4"" International Conference of Knowledge Discovery and Data Mining , pp. 239-241
    • Keogh, E.1    Pazzani, M.2
  • 17
    • 4243629161 scopus 로고    scopus 로고
    • Studies in astronomical time series analysis: V. Bayesian blocks, a new method to analyze structure in photon counting data
    • Scargle, J. (1998). Studies in astronomical time series analysis: v. Bayesian blocks, a new method to analyze structure in photon counting data. Astrophysical Journal, Vol. 504.
    • (1998) Astrophysical Journal , pp. 504
    • Scargle, J.1
  • 18
    • 0344648320 scopus 로고
    • Technical Report CS-95-37, Department of Computer Science, Brown University
    • Shatkay, H. (1995). The Fourier Transform - a Primer, Technical Report CS-95-37, Department of Computer Science, Brown University.
    • (1995) The Fourier Transform - a Primer
    • Shatkay, H.1
  • 21
    • 0031170074 scopus 로고    scopus 로고
    • Similarity-Based queries for time series data
    • Refiei, D., & Mendelzon, A. (1997). Similarity-Based queries for time series data. In Proc ACM SIGMOD Conf, pp. 13-25.
    • (1997) Proc ACM SIGMOD Conf , pp. 13-25
    • Refiei, D.1    Mendelzon, A.2
  • 22
    • 0031073477 scopus 로고    scopus 로고
    • A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms
    • Wettschereck, D., Aha, D. & Mohri, T. (1997). A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms. AI Review, Vol 11, Issues 1-5.
    • (1997) AI Review , vol.11 , Issue.1-5
    • Wettschereck, D.1    Aha, D.2    Mohri, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.