메뉴 건너뛰기




Volumn , Issue , 2009, Pages 299-305

Trajectory clustering in road network environment

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING SCHEME; DEGREE OF SIMILARITY; DESTINATION POINTS; FASTMAP; HIERARCHICAL CLUSTERING SCHEMES; MOVING OBJECTS; ROAD NETWORK; ROAD SEGMENTS; SHORTEST PATH; SIMILARITY MEASUREMENTS; TOTAL LENGTH; TRAJECTORY CLUSTERING; TRAJECTORY GENERATOR;

EID: 67650475015     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIDM.2009.4938663     Document Type: Conference Paper
Times cited : (62)

References (26)
  • 1
    • 14244254616 scopus 로고    scopus 로고
    • Indexing the trajectories of moving objects in networks
    • DOI 10.1007/s10707-004-5621-7
    • V. Almeida and R. Guting, Indexing the trajectories of moving objects in networks, Geoinformatica, vol. 9, no. 1, pp. 33-60, 2005. (Pubitemid 40289815)
    • (2005) GeoInformatica , vol.9 , Issue.1 , pp. 33-60
    • De Almeida, V.T.1    Guting, R.H.2
  • 3
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • DOI 10.1023/A:1015231126594
    • T. Brinkhoff, A framework for generating network-based moving objects, GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002. (Pubitemid 34609430)
    • (2002) GeoInformatica , vol.6 , Issue.2 , pp. 153-180
    • Brinkhoff, T.1
  • 7
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E. Dijkstra, A note on two problems in connection with graphs, Numeriche Mathematik, vol. 1, pp. 269-271, 1959.
    • (1959) Numeriche Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.1
  • 9
    • 84976803260 scopus 로고
    • Fastmap: A fast algorithm for indexing, datamining, and visualization of traditional and multimedia datasets
    • C. Faloutsos and K. Lin, Fastmap: A fast algorithm for indexing, datamining, and visualization of traditional and multimedia datasets, In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp. 163-174, 1995.
    • (1995) Proc. Int'l. Conf. on Management of Data, ACM SIGMOD , pp. 163-174
    • Faloutsos, C.1    Lin, K.2
  • 10
    • 34547637224 scopus 로고    scopus 로고
    • In search of meaning for time series subsequence clustering: Matching algorithms based on a new distance measure
    • DOI 10.1145/1183614.1183666, Proceedings of the 15th ACM Conference on Information and Knowledge Management, CIKM 2006
    • D. Goldin, R. Mardales, and G. Nagy, In search of meaning for time series subsequence clustering: Matching algorithms based on a new distance measure, In Proc. Int'l. Conf. on Information and Knowledge Management, pp. 347-356, 2006. (Pubitemid 47203581)
    • (2006) International Conference on Information and Knowledge Management, Proceedings , pp. 347-356
    • Goldin, D.1    Mardales, R.2    Nagy, G.3
  • 13
    • 26444489074 scopus 로고    scopus 로고
    • The islands approach to nearest neighbor querying in spatial networks
    • Advances in Spatial and Temporal Databases: 9th International Symposium, SSTD 2005. Proceedings
    • X. Huang, C. S. Jensen, and S. Saltenis, The islands approach to nearest neighbor querying in spatial networks, In Proc. Int'l. Symp. on Spatial and Temporal Databases, SSTD, pp. 73-90, 2005. (Pubitemid 41433159)
    • (2005) Lecture Notes in Computer Science , vol.3633 , pp. 73-90
    • Huang, X.1    Jensen, C.S.2    Saltenis, S.3
  • 18
    • 0001840280 scopus 로고    scopus 로고
    • Generating spatiotemporal datasets on the www
    • Y. Theodoridis and M. Nascimento, Generating spatiotemporal datasets on the www, ACM SIGMOD Record, vol. 3, pp. 39-43, 2000.
    • (2000) ACM SIGMOD Record , vol.3 , pp. 39-43
    • Theodoridis, Y.1    Nascimento, M.2
  • 20


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