메뉴 건너뛰기




Volumn Part F129132, Issue , 2000, Pages 243-307

Time series similarity measures

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION); TIME SERIES;

EID: 84941190371     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/349093.349108     Document Type: Conference Paper
Times cited : (33)

References (71)
  • 1
    • 85039571873 scopus 로고    scopus 로고
    • A linear method for deviation detection in large databases
    • Andreas Aming, Rakesh Agrawal, Prabhnkar Raghavan: A Linear Method for Deviation Detection in Large Databases. KDD 1996: 164-169.
    • (1996) KDD , pp. 164-169
    • Aming, A.1    Agrawal, R.2    Raghavan, P.3
  • 5
    • 0025447750 scopus 로고
    • The R∗-Tree: An efficient and robust access method for points and rectangles
    • Norhert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R∗-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990.
    • (1990) SIGMOD Conference
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 7
    • 0000286376 scopus 로고
    • Using dynamic time warping to find patterns in time series
    • Donald J. Bemdt, James Clifford. Using Dynamic Time Warping to Find Patterns in Time Series. KDD Workshop 1994.
    • (1994) KDD Workshop
    • Bemdt, D.J.1    Clifford, J.2
  • 10
    • 85028923618 scopus 로고    scopus 로고
    • Indexing large metric spaces for similarity search queries
    • Bozkaya, T. and Ozsoyoglu, Z.M., "indexing Large Metric Spaces for Similarity Search Queries", ACM TODS, 1999.
    • (1999) ACM, TODS
    • Bozkaya, T.1    Ozsoyoglu, Z.M.2
  • 13
    • 85028926462 scopus 로고    scopus 로고
    • Local dimensionality reduction: A new approach to indexing high dimensional spaces
    • Kaushik Chakrahnrd and Sharad Mehrotra, "Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces', VLDB 2000.
    • (2000) VLDB
    • Chakrahnrd, K.1    Mehrotra, S.2
  • 14
    • 0032688141 scopus 로고    scopus 로고
    • Efficient time series matching by wavelets
    • Chart K, Fu W. "Efficient time series matching by wavelets", ICDE 1999.
    • (1999) ICDE
    • Chart, K.1    Fu, W.2
  • 21
    • 84976803260 scopus 로고
    • FirstMap: A fast algorithm for indexing, data-mining and visualization of traditional mad multimedia datasets
    • Christos Faloutsos, King-lp Lin: FirstMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional mad Multimedia Datasets. SIGMOD Conference 1995: 163-174.
    • (1995) SIGMOD Conference , pp. 163-174
    • Faloutsos, C.1    Lin, K.-L.2
  • 24
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman. "R-trees: A dynamic index structure for spatial searching", SIGMOD 1984.
    • (1984) SIGMOD
    • Guttman, A.1
  • 25
    • 0034592914 scopus 로고    scopus 로고
    • Deformable markov model templates for time-series pattern matching
    • Xianping Ge and Padhraic Smyth "Deformable Markov Model Templates for Time-Series Pattern Matching". SIGKDD 2000.
    • (2000) SIGKDD
    • Ge, X.1    Smyth, P.2
  • 26
    • 0001304381 scopus 로고
    • On similarity queries for time-series data: Constraint specification and implementation
    • Dina Q. Goldin, Paris C. Kanellalds. On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. CP 1995.
    • (1995) CP
    • Goldin, D.Q.1    Kanellalds, P.C.2
  • 27
    • 0003134671 scopus 로고    scopus 로고
    • Event detection from time series data
    • Valery Gureinik, Jaideep Srivastava: Event Detection from Time Series Data. KDD 1999: 33-42.
    • (1999) KDD , pp. 33-42
    • Gureinik, V.1    Srivastava, J.2
  • 28
    • 0016943204 scopus 로고
    • Picture segmentation by a tree traversal algorithm
    • S. L. Horowitz, T. Pavlidis: Picture Segmentation by a tree traversal Algorithm. JACM 23(2): 368-388 (1976).
    • (1976) JACM , vol.23 , Issue.2 , pp. 368-388
    • Horowitz, S.L.1    Pavlidis, T.2
  • 29
    • 0032627945 scopus 로고    scopus 로고
    • Efficient mining of partial periodic patterns in time series database
    • Jiawei Han, Guozhu Dong, Yiwen Yin. Efficient Mining of Partial Periodic Patterns in Time Series Database. ICDE 1999: 106-115.
    • (1999) ICDE , pp. 106-115
    • Han, J.1    Dong, G.2    Yin, Y.3
  • 30
    • 85028935137 scopus 로고    scopus 로고
    • Imager Wavelet Library. www.cs.ubc.ca/nest/imager/contribations/bobl/wvlt/top.html.
    • Imager Wavelet Library
  • 34
    • 0001907042 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • P. lndyk and R. Motwani. "Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality'. STOC 98.
    • STOC , pp. 98
    • Lndyk, P.1    Motwani, R.2
  • 35
    • 0033878945 scopus 로고    scopus 로고
    • Dimensionality reduction techniques for proximity problems
    • Piotr Indyk "Dimensionality Reduction Techniques for Proximity Problems", accepted to the 11th Symposium on Discrete Algorithms, 2000.
    • (2000) 11th Symposium on Discrete Algorithms
    • Indyk, P.1
  • 37
    • 33745786648 scopus 로고    scopus 로고
    • Mining deviants in a time series database
    • H. V. Jagadish, Nick Koudas, S. Muthukrishnan. Mining Deviants in a Time Series Database. VLDB 1999:102-113.
    • (1999) VLDB , pp. 102-113
    • Jagadish, H.V.1    Koudas, N.2    Muthukrishnan, S.3
  • 38
    • 0001654702 scopus 로고
    • Extensions of Lipshitz mapping into Hilber t space
    • W.B. Johnson and J. Lindenstrauss, "Extensions of Lipshitz mapping into Hilber t space", Contemporary Mathematics, 26(1984), 189-206.
    • (1984) Contemporary Mathematics , vol.26 , pp. 189-206
    • Johnson, W.B.1    Lindenstrauss, J.2
  • 41
    • 85150810448 scopus 로고    scopus 로고
    • An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback
    • Eamolm J. Keogh, Michael J. Pazzani: An Enhanced Representation of Time Series Which Allows Fast and Accurate Classification, Clustering and Relevance Feedback. KDD 1998: 239-243.
    • (1998) KDD , pp. 239-243
    • Keogh, E.J.1    Pazzani, M.J.2
  • 42
    • 35048889616 scopus 로고    scopus 로고
    • An indexing scheme for fast similarity search in large time series databases
    • Eamonn J. Keogh, Michael J. Pazzani: An Indexing Scheme for Fast Similarity Search in Large Time Series Databases. SSDBM 1999.
    • (1999) SSDBM
    • Keogh, E.J.1    Pazzani, M.J.2
  • 43
    • 84983224534 scopus 로고    scopus 로고
    • A probabilistic approach to fast pattern matching in time series databases
    • Eamonn J. Keogh, Padbraic Smyth: A Probabilistic Approach to Fast Pattern Matching in Time Series Databases. KDD 1997: 24-30.
    • (1997) KDD , pp. 24-30
    • Keogh, E.J.1    Smyth, P.2
  • 45
    • 85028927221 scopus 로고    scopus 로고
    • Fast similarity search in the presence of longitudinal scaling in time series databases
    • Newport Beach
    • Keogh, E. (1997). Fast similarity search in the presence of longitudinal scaling in time series databases. In Proceedings of Tools with Artificial. Newport Beach.
    • (1997) Proceedings of Tools with Artificial
    • Keogh, E.1
  • 46
    • 0010226743 scopus 로고    scopus 로고
    • A fast and robust method for pattern matching in time series database
    • Keogh, E. (1997). A fast and robust method for pattern matching in time series database. In WUSS 1997.
    • (1997) WUSS 1997
    • Keogh, E.1
  • 48
    • 0037871793 scopus 로고    scopus 로고
    • A simple dimensionality reduction technique for fast similarity search in large time series databases
    • Kyoto, Japan
    • Keogh & Pazzani, "A simple dimensionality reduction technique for fast similarity search in large time series databases." In the Fourth Pacific- Asia Conference on Knowledge Discovery and Data Mining. Kyoto, Japan, 2000.
    • (2000) The Fourth Pacific- Asia Conference on Knowledge Discovery and Data Mining
    • Keogh1    Pazzani2
  • 51
    • 85028935669 scopus 로고    scopus 로고
    • Efficiently supporting ad hue queries in large datasets of tune sequences
    • Flip Kom, H. V. Jagadish, Christos Faloutsos: Efficiently Supporting Ad Hue Queries in Large Datasets of Tune Sequences, SIGMOD Conference 1997: 289-300.
    • (1997) SIGMOD Conference , pp. 289-300
    • Kom, F.1    Jagadish, H.V.2    Faloutsos, C.3
  • 53
    • 34249762939 scopus 로고
    • The TV-Tree: An index structure for high-dimensional data
    • King-lp Lin, H. V. Jagedish, Cbristos Faloutsos: The TV-Tree: An Index Structure for High-Dimensional Data. VLDB Journal 3(4): 517-542 (1994).
    • (1994) VLDB Journal , vol.3 , Issue.4 , pp. 517-542
    • Lin, K.-L.1    Jagedish, H.V.2    Faloutsos, C.3
  • 54
    • 85028913872 scopus 로고    scopus 로고
    • Indexing time-series databases for inverse queries
    • A. Nanopoulos, Y. Manolopoulos: Indexing Time-Series Databases for Inverse Queries, DEXA 1998.
    • (1998) DEXA
    • Nanopoulos, A.1    Manolopoulos, Y.2
  • 55
    • 85028939302 scopus 로고    scopus 로고
    • Efficient similarity searches for time-warped subsequences in sequence databases
    • S. Park, W. Chu, J. Yoon, C. Hsu, Efficient Similarity Searches for Time-Warped Subsequences in Sequence Databases, ICDE 2000.
    • (2000) ICDE
    • Park, S.1    Chu, W.2    Yoon, J.3    Hsu, C.4
  • 56
    • 85028949500 scopus 로고    scopus 로고
    • Parker landmarks: A new model for similarity-based pattern querying in time series databases
    • C.-S. Pemg, H. Wang, S. R. Zhang, D. Stutt Parker Landmarks: a New Model for Similarity-based Pattern Querying in Time Series Databases, ICDE 2000.
    • (2000) ICDE
    • Pemg, C.-S.1    Wang, H.2    Zhang, S.R.3    Stutt, D.4
  • 58
    • 3042807631 scopus 로고    scopus 로고
    • Efficient retrieval of similar time sequences using DFT
    • Kobe, Japan, November
    • D. Rafiei and Alberto Mendelzon, "Efficient Retrieval of Similar Time Sequences Using DFT' FODO '98 Conference, Kobe, Japan, November 1998.
    • (1998) FODO '98 Conference
    • Rafiei, D.1    Mendelzon, A.2
  • 59
    • 0032626364 scopus 로고    scopus 로고
    • On similarity-based queries for time series data
    • Davood Rafiei: On Similarity-Based Queries for Time Series Data. ICDE 1999: 410-417.
    • (1999) ICDE , pp. 410-417
    • Rafiei, D.1
  • 60
    • 0000561280 scopus 로고
    • The R+Tree: A dynamic index for multidimensional objects
    • Timos K. Sellis, Nick Ronssopoulos, Christos Faloutsos: The R+Tree: A Dynamic Index for Multidimensional Objects. VLDB 1987.
    • (1987) VLDB
    • Sellis, T.K.1    Ronssopoulos, N.2    Faloutsos, C.3
  • 62
    • 0030643303 scopus 로고    scopus 로고
    • High dimensional similarity joins
    • Birmingham, Eng
    • K. Shim, R. Srikant, R. Agmwal: "High Dimensional Similarity Joins", ICDE 1997 Birmingham, Eng.
    • (1997) ICDE
    • Shim, K.1    Srikant, R.2    Agmwal, R.3
  • 63
    • 0001868967 scopus 로고    scopus 로고
    • The Haar wavelet transform in the time series similarity paradigm
    • Zbigniew R. Struzik, Arno Siebes: The Haar Wavelet Transform in the Time Series Similarity Paradigm. PKDD 1999.
    • (1999) PKDD
    • Struzik, Z.R.1    Siebes, A.2
  • 64
    • 85028928570 scopus 로고    scopus 로고
    • Clustering and singular value decomposition for approximate indexing in high dimensional spaces
    • A. Tbomasian, V. Castello, C.S. Li: Clustering and Singular Value Decomposition for Approximate Indexing in High Dimensional Spaces. CIKM 98.
    • CIKM , pp. 98
    • Tbomasian, A.1    Castello, V.2    Li, C.S.3
  • 66
    • 0003981696 scopus 로고    scopus 로고
    • Algorithms and strategies for similarity retrieval
    • Visual Computing Laboratory, UC Dais
    • White, Jain "Algorithms and Strategies for Similarity Retrieval" Tech Report VCL-96-101, Visual Computing Laboratory, UC Dais, 1996.
    • (1996) Tech Report VCL-96-101
    • Jain, W.1
  • 67
    • 84948966662 scopus 로고
    • Prototype, nearest neighbor and hybrid algorithms for time series classification
    • Christel Wisotzki, Fritz Wysmzki: Prototype, Nearest Neighbor and Hybrid Algorithms for Time Series Classification. ECML 1995: 364-367.
    • (1995) ECML , pp. 364-367
    • Wisotzki, C.1    Wysmzki, F.2
  • 69
    • 0008696985 scopus 로고    scopus 로고
    • Fast time sequence indexing for arbitray Lp norms
    • Byoong-Kee Yi, Christos Falotasos: Fast Time Sequence Indexing for Arbitray Lp Norms. VLDB 2000.
    • (2000) VLDB
    • Yi, B.-K.1    Falotasos, C.2


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