메뉴 건너뛰기




Volumn 69, Issue 1-2, 2004, Pages 105-113

Minimum distance queries for time series data

Author keywords

Database; Minimum distance; Similarity search; Time series

Indexed keywords

DATABASE SYSTEMS; DISCRETE FOURIER TRANSFORMS; QUERY LANGUAGES; WAVELET TRANSFORMS;

EID: 0242468281     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(03)00078-5     Document Type: Article
Times cited : (12)

References (25)
  • 1
    • 0027883358 scopus 로고
    • Database mining: A performance perspective, special issue on learning and discovery in knowledge-based databases
    • (special issue)
    • Agrawal R., Imielinski T., Swami A. Database mining: A performance perspective, special issue on learning and discovery in knowledge-based databases. IEEE TKDE. 5(6):1993;914-925. (special issue).
    • (1993) IEEE TKDE , vol.5 , Issue.6 , pp. 914-925
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 2
    • 85006228721 scopus 로고
    • Efficient similarity search in sequence databases
    • Agrawal Rakesh, Faloutsos Christos, Swami Arun N., 1993b. Efficient similarity search in sequence databases. In: FODO, pp. 69-84.
    • (1993) FODO , pp. 69-84
    • Agrawal, R.1    Faloutsos, C.2    Swami, A.N.3
  • 3
    • 0002644607 scopus 로고
    • Fast similarity search in the presence of noise, scaling, and translation in time-series databases
    • Agrawal Rakesh, Lin King-Ip, Sawhney Harpeet S., Shim Kyuseok, 1995. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In: VLDB, pp. 490-501.
    • (1995) VLDB , pp. 490-501
    • Agrawal, R.1    Lin, K.-I.2    Sawhney, H.S.3    Shim, K.4
  • 4
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B., 1990. The R*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD Conference, pp. 322-331.
    • (1990) SIGMOD Conference , pp. 322-331
    • Beckmann, N.1    Kriegel, H.P.2    Schneider, R.3    Seeger, B.4
  • 6
    • 0032688141 scopus 로고    scopus 로고
    • Efficient time series matching by wavelets
    • Chan Kin-pong, Fu Ada Wai-chee, 1999. Efficient time series matching by wavelets. In: ICDE, pp. 126-133.
    • (1999) ICDE , pp. 126-133
    • Chan, K.-P.1    Fu Ada, W.-C.2
  • 7
    • 0032638572 scopus 로고    scopus 로고
    • Fast time-series searching with scaling and shifting
    • Chu Kelvin Kam Wing, Wong Man Hon, 1999. Fast time-series searching with scaling and shifting. In: PODS, pp. 237-248.
    • (1999) PODS , pp. 237-248
    • Wing, C.K.K.1    Wong Man Hon2
  • 8
    • 0032288561 scopus 로고    scopus 로고
    • An efficient hash-based algorithm for sequence data searching
    • Chu Kelvin Kam Wing, Lam Sze Kin, Wong Man Hon An efficient hash-based algorithm for sequence data searching. The computer journal. 41(6):1998;402-415.
    • (1998) The Computer Journal , vol.41 , Issue.6 , pp. 402-415
    • Wing, C.K.K.1    Lam Sze Kin2    Wong Man Hon3
  • 9
    • 84947768200 scopus 로고    scopus 로고
    • Finding similar time series
    • Das Gautam, Gunopulos Dimitrios, Mannila Heikki, 1997. Finding similar time series. In: PKDD, pp. 88-100.
    • (1997) PKDD , pp. 88-100
    • Das, G.1    Gunopulos, D.2    Mannila, H.3
  • 11
    • 85130734369 scopus 로고    scopus 로고
    • Knowledge discovery and data mining: Towards a unifying framework
    • Fayyad Usama M., Gregory Piatetsky-Shapiro, Smyth Padharic, 1996. Knowledge discovery and data mining: towards a unifying framework. In: KDD, pp. 82-88.
    • (1996) KDD , pp. 82-88
    • Fayyad, U.M.1    Gregory, P.-S.2    Smyth, P.3
  • 12
    • 84958044742 scopus 로고
    • On similarity queries for time-series data: Constraint specification and implementation
    • Goldin Dina Q., Kanellakis Paris C., 1995. On similarity queries for time-series data: Constraint specification and implementation. In: CP, pp. 137-153.
    • (1995) CP , pp. 137-153
    • Goldin, D.Q.1    Kanellakis, P.C.2
  • 13
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Guttman, A., 1984. R-trees: A dynamic index structure for spatial searching. In: SIGMOD Conference, pp. 47-57.
    • (1984) SIGMOD Conference , pp. 47-57
    • Guttman, A.1
  • 14
    • 0040748318 scopus 로고    scopus 로고
    • Locally adaptive dimensionality reduction for indexing large time series databases
    • Keogh Eamonn J., Chakrabarti Kaushik, Mehrotra Sharad, Pazzani Michael J., 2001. Locally adaptive dimensionality reduction for indexing large time series databases. In: SIGMOD conference, pp. 151-162.
    • (2001) SIGMOD Conference , pp. 151-162
    • Keogh, E.J.1    Chakrabarti, K.2    Mehrotra, S.3    Pazzani, M.J.4
  • 15
    • 84942742938 scopus 로고    scopus 로고
    • A simple dimensionality reduction technique for fast similarity search in large time series databases
    • Keogh Eamonn J., Pazzani Michael J., 2000. A simple dimensionality reduction technique for fast similarity search in large time series databases. In: PAKDD, pp. 122-133.
    • (2000) PAKDD , pp. 122-133
    • Keogh, E.J.1    Pazzani, M.J.2
  • 16
    • 0031166708 scopus 로고    scopus 로고
    • Efficiently supporting ad hoc queries in large datasets of time sequences
    • Korn Flip, Jagadish H.V., Faloutsos Christos, 1997. Efficiently supporting ad hoc queries in large datasets of time sequences. In: SIGMOD Conference, pp. 289-300.
    • (1997) SIGMOD Conference , pp. 289-300
    • Korn, F.1    Jagadish, H.V.2    Faloutsos, C.3
  • 17
    • 0032287861 scopus 로고    scopus 로고
    • A fast projection algorithm for sequence data searching
    • Lam Sze Kin, Wong Man Hon A fast projection algorithm for sequence data searching. DKE. 28(3):1998;321-339.
    • (1998) DKE , vol.28 , Issue.3 , pp. 321-339
    • Lam, S.K.1    Wong, M.H.2
  • 18
    • 0029776278 scopus 로고    scopus 로고
    • HierarchyScan: A Hierarchical similarity search algorithm for databases of long sequences
    • Li Chung-Sheng, Yu Philip S., Castelli Vittorio, 1996. HierarchyScan: A Hierarchical similarity search algorithm for databases of long sequences. In: ICDE, pp. 546-553.
    • (1996) ICDE , pp. 546-553
    • Li, C.-S.1    Yu, P.S.2    Castelli, V.3
  • 19
    • 0033878207 scopus 로고    scopus 로고
    • Efficient searches for similar subsequences of different lengths in sequence databases
    • Park Sanghyun, Chu Wesley W., Yoon Jeehee, Hsu Chihcheng, 2000. Efficient searches for similar subsequences of different lengths in sequence databases in: ICDE, pp. 23-32.
    • (2000) ICDE , pp. 23-32
    • Park, S.1    Chu, W.W.2    Yoon, J.3    Hsu, C.4
  • 20
    • 0033871047 scopus 로고    scopus 로고
    • Landmarks: A new model for similarity-based pattern querying in time series databases
    • Perng Chang-Shing, Wang Haixun, Zhang Sylvia R., Parker D. Stott, 2000. Landmarks: A new model for similarity-based pattern querying in time series databases. In: ICDE, pp. 33-42.
    • (2000) ICDE , pp. 33-42
    • Perng, C.-S.1    Wang, H.2    Zhang, S.R.3    Parker, D.S.4
  • 22
    • 0032626364 scopus 로고    scopus 로고
    • On similarity-based queries for time series data
    • Rafiei Davood, 1999. On similarity-based queries for time series data. In: ICDE, pp. 410-417.
    • (1999) ICDE , pp. 410-417
    • Rafiei, D.1
  • 23
    • 0031170074 scopus 로고    scopus 로고
    • Similarity-based queries for time series data
    • Rafiei Davood, Mendelzon Alberto O., 1997. Similarity-based queries for time series data. In: SIGMOD Conference, pp. 13-25.
    • (1997) SIGMOD Conference , pp. 13-25
    • Rafiei, D.1    Mendelzon, A.O.2
  • 25
    • 0031675839 scopus 로고    scopus 로고
    • Efficient retrieval of similar time sequences under time warping
    • Yi Byoung-Kee, Jagadish H.V., Faloutsos Christos, 1998. Efficient retrieval of similar time sequences under time warping. In: ICDE, pp. 201-208.
    • (1998) ICDE , pp. 201-208
    • Yi, B.-K.1    Jagadish, H.V.2    Faloutsos, C.3


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