메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 175-184

Similarity searching for multi-attribute sequences

Author keywords

Computer science; Databases; Discrete Fourier transforms; Economic forecasting; Euclidean distance; Indexes; Mathematics; Stock markets; Wavelet transforms; Weather forecasting

Indexed keywords

COMMERCE; COMPUTER SCIENCE; DATABASE SYSTEMS; DISCRETE FOURIER TRANSFORMS; DISCRETE WAVELET TRANSFORMS; ECONOMICS; FINANCE; FINANCIAL MARKETS; FORECASTING; MANAGEMENT INFORMATION SYSTEMS; MATHEMATICAL TECHNIQUES; WAVELET TRANSFORMS;

EID: 84948687881     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDM.2002.1029718     Document Type: Conference Paper
Times cited : (57)

References (21)
  • 1
    • 0001818178 scopus 로고
    • Efficient similarity search in sequence databases
    • Evanston, Illinois, October
    • R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In FODO, Evanston, Illinois, October 1993.
    • (1993) FODO
    • Agrawal, R.1    Faloutsos, C.2    Swami, A.3
  • 2
    • 0002644607 scopus 로고
    • Fast similarity search in the presence of noise, scaling, and translation in time-series databases
    • Zürich, Switzerland, September
    • R. Agrawal, K. Lin, H.S. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In VLDB, Zürich, Switzerland, September 1995.
    • (1995) VLDB
    • Agrawal, R.1    Lin, K.2    Sawhney, H.S.3    Shim, K.4
  • 3
    • 0025447750 scopus 로고
    • The R∗-tree: An efficient and robust access method for points and rectangles
    • Atlantic City, NJ
    • N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R∗-tree: An efficient and robust access method for points and rectangles. In SIGMOD, pages 322-331, Atlantic City, NJ, 1990.
    • (1990) SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 4
    • 0032688141 scopus 로고    scopus 로고
    • Efficient time series matching by wavelets
    • K.-P. Chan and A.W.-C. Fu. Efficient time series matching by wavelets. In ICDE, 1999.
    • (1999) ICDE
    • Chan, K.-P.1    Fu, A.W.-C.2
  • 5
    • 0032638572 scopus 로고    scopus 로고
    • Fast time-series searching with scaling and shifting
    • Philadelphia, PA
    • K.K.W. Chu and M.H. Wong. Fast time-series searching with scaling and shifting. In PODS, Philadelphia, PA, 1999.
    • (1999) PODS
    • Chu, K.K.W.1    Wong, M.H.2
  • 6
    • 84947768200 scopus 로고    scopus 로고
    • Finding similar time series
    • G. Das, D. Gunopulos, and H. Mannila. Finding similar time series. In PKDD, pages 88-100, 1997.
    • (1997) PKDD , pp. 88-100
    • Das, G.1    Gunopulos, D.2    Mannila, H.3
  • 7
    • 0028447023 scopus 로고
    • Fast subsequence matching in time-series databases
    • Minneapolis MN, May
    • C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In SIGMOD, pages 419-429, Minneapolis MN, May 1994.
    • (1994) SIGMOD , pp. 419-429
    • Faloutsos, C.1    Ranganathan, M.2    Manolopoulos, Y.3
  • 8
    • 84958044742 scopus 로고
    • On similarity queries for time-series data: Constraint specification and implementation
    • France, September
    • D. Q. Goldin and P. C. Kanellakis. On similarity queries for time-series data: Constraint specification and implementation. In CP, pages 137-153, France, September 1995.
    • (1995) CP , pp. 137-153
    • Goldin, D.Q.1    Kanellakis, P.C.2
  • 9
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
    • (1984) SIGMOD , pp. 47-57
    • Guttman, A.1
  • 10
    • 84944324113 scopus 로고    scopus 로고
    • An efficient index structure for string databases
    • Roma, Italy, September
    • T. Kahveci and A. Singh. An efficient index structure for string databases. In VLDB, pages 351-360, Roma, Italy, September 2001.
    • (2001) VLDB , pp. 351-360
    • Kahveci, T.1    Singh, A.2
  • 11
    • 0034996992 scopus 로고    scopus 로고
    • Variable length queries for time series data
    • Heidelberg, Germany
    • T. Kahveci and A. Singh. Variable length queries for time series data. In ICDE, Heidelberg, Germany, 2001.
    • (2001) ICDE
    • Kahveci, T.1    Singh, A.2
  • 13
    • 0033892545 scopus 로고    scopus 로고
    • Similarity search for multidimensional data sequences
    • San Diego, CA
    • S.-L. Lee, S.-J. Chun, D.-H. Kim, J.-H. Lee, and C.-W. Chung. Similarity search for multidimensional data sequences. In ICDE, San Diego, CA, 2000.
    • (2000) ICDE
    • Lee, S.-L.1    Chun, S.-J.2    Kim, D.-H.3    Lee, J.-H.4    Chung, C.-W.5
  • 14
    • 0033871047 scopus 로고    scopus 로고
    • Landmarks: A new model for similarity-based pattern querying in time series databases
    • San Diego, USA
    • C.-S. Perng, H. Wang, S.R. Zhang, and D.S. Parker. Landmarks: a new model for similarity-based pattern querying in time series databases. In ICDE, San Diego, USA, 2000.
    • (2000) ICDE
    • Perng, C.-S.1    Wang, H.2    Zhang, S.R.3    Parker, D.S.4
  • 15
    • 0032626364 scopus 로고    scopus 로고
    • On similarity-based queries for time series data
    • Sydney, Australia, March
    • D. Rafiei. On similarity-based queries for time series data. In ICDE, Sydney, Australia, March 1999.
    • (1999) ICDE
    • Rafiei, D.1
  • 16
    • 0031170074 scopus 로고    scopus 로고
    • Similarity-based queries for time series data
    • Tucson, AZ
    • D. Rafiei and A.O. Mendelzon. Similarity-based queries for time series data. In SIGMOD, pages 13-25, Tucson, AZ, 1997.
    • (1997) SIGMOD , pp. 13-25
    • Rafiei, D.1    Mendelzon, A.O.2
  • 17
    • 3042807631 scopus 로고    scopus 로고
    • Efficient retrieval of similar time sequences using DFT
    • Kobe, Japan
    • D. Rafiei and A.O. Mendelzon. Efficient retrieval of similar time sequences using DFT. In FODO, Kobe, Japan, 1998.
    • (1998) FODO
    • Rafiei, D.1    Mendelzon, A.O.2
  • 18
    • 0041571103 scopus 로고
    • Reading a set of disk pages
    • B. Seeger, P.-A. Larson, and R. McFayden. Reading a set of disk pages. In VLDB, pages 592-603, 1993.
    • (1993) VLDB , pp. 592-603
    • Seeger, B.1    Larson, P.-A.2    McFayden, R.3
  • 19
    • 53949108553 scopus 로고    scopus 로고
    • TSA-tree: A wavelet-based approach to improve the efficieny of multi-level surprise and trend queries
    • C. Shahabi, X. Tian, and W. Zhao. TSA-tree: A wavelet-based approach to improve the efficieny of multi-level surprise and trend queries. In SSDBM, 2000.
    • (2000) SSDBM
    • Shahabi, C.1    Tian, X.2    Zhao, W.3
  • 20
    • 0036211177 scopus 로고    scopus 로고
    • Discovering similar multidimensional trajectories
    • San Jose, CA
    • M. Vlachos, G. Kollios, and D. Gunopulos. Discovering similar multidimensional trajectories. In ICDE, San Jose, CA, 2002.
    • (2002) ICDE
    • Vlachos, M.1    Kollios, G.2    Gunopulos, D.3


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