메뉴 건너뛰기




Volumn 6118 LNAI, Issue PART 1, 2010, Pages 228-237

Mining trajectory corridors using Fréchet distance and meshing grids

Author keywords

Fr chet distance; Meshing grids; Trajectory

Indexed keywords

COMPUTING TIME; DOMINANT FACTOR; GRID CELLS; GRID SIZE; GRID STRUCTURES; HIERARCHICAL METHOD; LOCAL CLUSTER; LOCATION-AWARE; MESHING GRIDS; MOVING OBJECTS; REAL TRAJECTORIES; SECOND PHASE; SPATIAL INFORMATIONS; TECHNOLOGY ADVANCEMENT; TEMPORAL INFORMATION; TRAJECTORY DATA; UNSUPERVISED ALGORITHMS;

EID: 79956316231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13657-3_26     Document Type: Conference Paper
Times cited : (22)

References (12)
  • 1
    • 21144453588 scopus 로고    scopus 로고
    • Comparison of distance measures for planar curves
    • DOI 10.1007/s00453-003-1042-5
    • Alt, H., Knauer, C., Wenk, C.: Comparison of distance measures for planar curves. Algorithmica 38(1), 45-58 (2003) (Pubitemid 40877160)
    • (2003) Algorithmica (New York) , vol.38 , Issue.1 , pp. 45-58
    • Alt, H.1    Knauer, C.2    Wenk, C.3
  • 3
    • 58549118299 scopus 로고    scopus 로고
    • Detecting commuting patterns by clustering subtrajectories
    • Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. Springer, Heidelberg
    • Buchin, K., Buchin, M., Gudmundsson, J., Löffler, M., Luo, J.: Detecting commuting patterns by clustering subtrajectories. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 644-655. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5369 , pp. 644-655
    • Buchin, K.1    Buchin, M.2    Gudmundsson, J.3    Löffler, M.4    Luo, J.5
  • 5
    • 33750795715 scopus 로고
    • Computing discrete fréchet distance
    • Eiter, T., Mannila, H.: Computing discrete fréchet distance. Technical Report CDTR, 94(64) (1994)
    • (1994) Technical Report CDTR , vol.94 , Issue.64
    • Eiter, T.1    Mannila, H.2
  • 6
    • 85170282443 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial databases with noise
    • Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp. 226-231 (1996)
    • (1996) KDD , pp. 226-231
    • Ester, M.1    Kriegel, H.-P.2    Sander, J.3    Xu, X.4
  • 7
    • 0002689560 scopus 로고    scopus 로고
    • Trajectory clustering with mixtures of regression models
    • Gaffney, S., Smyth, P.: Trajectory clustering with mixtures of regression models. In: KDD, pp. 63-72 (1999)
    • (1999) KDD , pp. 63-72
    • Gaffney, S.1    Smyth, P.2
  • 8
    • 0242497349 scopus 로고    scopus 로고
    • Exact indexing of dynamic time warping
    • Keogh, E.J.: Exact indexing of dynamic time warping. In: VLDB, pp. 406-417 (2002)
    • (2002) VLDB , pp. 406-417
    • Keogh, E.J.1
  • 10
    • 37849187329 scopus 로고    scopus 로고
    • Time-focused clustering of trajectories of moving objects
    • DOI 10.1007/s10844-006-9953-7
    • Nanni, M., Pedreschi, D.: Time-focused clustering of trajectories of moving objects. J. Intell. Inf. Syst. 27(3), 267-289 (2006) (Pubitemid 44825944)
    • (2006) Journal of Intelligent Information Systems , vol.27 , Issue.3 , pp. 267-289
    • Nanni, M.1    Pedreschi, D.2
  • 12
    • 84990989606 scopus 로고    scopus 로고
    • Clustering multidimensional trajectories based on shape and velocity
    • Yanagisawa, Y., Satoh, T.: Clustering multidimensional trajectories based on shape and velocity. In: ICDE Workshops, p. 12 (2006)
    • (2006) ICDE Workshops , pp. 12
    • Yanagisawa, Y.1    Satoh, T.2


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