메뉴 건너뛰기




Volumn 6283 LNCS, Issue , 2010, Pages 170-177

Histogram distance for similarity search in large time series database

Author keywords

[No Author keywords available]

Indexed keywords

BINARY BITS; CANDIDATE SEQUENCES; DYNAMIC TIME WARPING; FALSE DISMISSALS; FILTERING PROCESS; HISTOGRAM DISTANCE; LARGE DATABASE; LARGE TIME SERIES DATABASE; MEAN VALUES; NEW APPROACHES; SIMILARITY SEARCH; SIMULATION EXPERIMENTS;

EID: 78049366813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15381-5_21     Document Type: Conference Paper
Times cited : (1)

References (12)
  • 2
    • 34250727441 scopus 로고    scopus 로고
    • Three myths about dynamic time warping data mining
    • Newport Beach, USA
    • Ratanamahatana, C. A., Keogh, E.: Three myths about dynamic time warping data mining. In: SIAM Conference on Data Mining (SDM), Newport Beach, USA, pp. 506-510 (2005)
    • (2005) SIAM Conference on Data Mining (SDM) , pp. 506-510
    • Ratanamahatana, C.A.1    Keogh, E.2
  • 4
    • 0033878207 scopus 로고    scopus 로고
    • Efficient searches for similarity subsequences of different lengths in sequence databases
    • Los Angeles, USA
    • Park, S., Chu, W., Yoon, J., Hsu, C.: Efficient searches for similarity subsequences of different lengths in sequence databases. In: 16th International Conference on Data Engineering (ICDE), Los Angeles, USA, pp. 23-32 (2000)
    • (2000) 16th International Conference on Data Engineering (ICDE) , pp. 23-32
    • Park, S.1    Chu, W.2    Yoon, J.3    Hsu, C.4
  • 5
    • 35048855086 scopus 로고    scopus 로고
    • Grid-based indexing for large time series databases
    • Liu, J., Cheung, Y.-m., Yin, H. eds., Springer, Heidelberg
    • An, J. Y., Chen, H. X., Furuse, K., Ohbo, N., Keogh, E.: Grid-based indexing for large time series databases. In: Liu, J., Cheung, Y.-m., Yin, H. (eds.) IDEAL 2003. LNCS, vol. 2690, pp. 614-621. Springer, Heidelberg (2003)
    • (2003) IDEAL 2003. LNCS , vol.2690 , pp. 614-621
    • An, J.Y.1    Chen, H.X.2    Furuse, K.3    Ohbo, N.4    Keogh, E.5
  • 9
    • 67349287486 scopus 로고    scopus 로고
    • Faster retrieval with a two-pass dynamic-time-warping lower bound
    • Lemire, D.: Faster retrieval with a two-pass dynamic-time-warping lower bound. Pattern Recognition 42, 2169-2180 (2009)
    • (2009) Pattern Recognition , vol.42 , pp. 2169-2180
    • Lemire, D.1
  • 11
    • 0034995991 scopus 로고    scopus 로고
    • An index-based approach for similarity search supporting time warping in large sequence databases
    • Heidelberg, Germany
    • Kim, S. W., Park, S., Chu, W. W.: An index-based approach for similarity search supporting time warping in large sequence databases. In: 17th International Conference on Data Engineering (ICDE), Heidelberg, Germany, pp. 607-614 (2001)
    • (2001) 17th International Conference on Data Engineering (ICDE) , pp. 607-614
    • Kim, S.W.1    Park, S.2    Chu, W.W.3
  • 12
    • 33750543325 scopus 로고    scopus 로고
    • A simple approximation for dynamic time warping search in large time series database
    • Corchado, E., Yin, H., Botti, V., Fyfe, C. eds., Springer, Heidelberg
    • Gu, J., Jin, X. M.: A simple approximation for dynamic time warping search in large time series database. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol. 4224, pp. 841-848. Springer, Heidelberg (2006)
    • (2006) IDEAL 2006. LNCS , vol.4224 , pp. 841-848
    • Gu, J.1    Jin, X.M.2


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