메뉴 건너뛰기




Volumn , Issue , 2013, Pages 713-724

Finding time period-based most frequent path in big trajectory data

Author keywords

Big trajectory data; Path finding

Indexed keywords

COMMON SENSE; FIXED TIME; PATH FINDING; SEARCH ALGORITHMS; SPEED UP; TIME-PERIODS; TRAJECTORY DATA;

EID: 84880562062     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463676.2465287     Document Type: Conference Paper
Times cited : (207)

References (33)
  • 2
    • 4444330766 scopus 로고    scopus 로고
    • Indexing large trajectory data sets with seti
    • V. P. Chakka, A. Everspaugh, and J. M. Patel. Indexing large trajectory data sets with seti. In CIDR, 2003.
    • (2003) CIDR
    • Chakka, V.P.1    Everspaugh, A.2    Patel, J.M.3
  • 3
    • 79957814780 scopus 로고    scopus 로고
    • Discovering popular routes from trajectories
    • Z. Chen, H. T. Shen, and X. Zhou. Discovering popular routes from trajectories. In ICDE, pages 900-911, 2011.
    • (2011) ICDE , pp. 900-911
    • Chen, Z.1    Shen, H.T.2    Zhou, X.3
  • 4
    • 77952758709 scopus 로고    scopus 로고
    • Trajstore: An adaptive storage system for very large trajectory data sets
    • P. Cudré-Mauroux, E. Wu, and S. Madden. Trajstore: An adaptive storage system for very large trajectory data sets. In ICDE, pages 109-120, 2010.
    • (2010) ICDE , pp. 109-120
    • Cudré-Mauroux, P.1    Wu, E.2    Madden, S.3
  • 6
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , Issue.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 7
    • 43349083620 scopus 로고    scopus 로고
    • Finding time-dependent shortest paths over large graphs
    • B. Ding, J. X. Yu, and L. Qin. Finding time-dependent shortest paths over large graphs. In EDBT, pages 205-216, 2008.
    • (2008) EDBT , pp. 205-216
    • Ding, B.1    Yu, J.X.2    Qin, L.3
  • 8
    • 33751022669 scopus 로고    scopus 로고
    • Indexing objects moving on fixed networks
    • E. Frentzos. Indexing objects moving on fixed networks. In SSTD, pages 289-305, 2003.
    • (2003) SSTD , pp. 289-305
    • Frentzos, E.1
  • 9
    • 0002689560 scopus 로고    scopus 로고
    • Trajectory clustering with mixtures of regression models
    • S. Gaffney and P. Smyth. Trajectory clustering with mixtures of regression models. In SIGKDD, pages 63-72, 1999.
    • (1999) SIGKDD , pp. 63-72
    • Gaffney, S.1    Smyth, P.2
  • 11
    • 85011017713 scopus 로고    scopus 로고
    • Adaptive fastest path computation on a road network: A traffic mining approach
    • H. Gonzalez, J. Han, X. Li, M. Myslinska, and J. P. Sondag. Adaptive fastest path computation on a road network: a traffic mining approach. In VLDB, pages 794-805, 2007.
    • (2007) VLDB , pp. 794-805
    • Gonzalez, H.1    Han, J.2    Li, X.3    Myslinska, M.4    Sondag, J.P.5
  • 12
    • 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
  • 13
    • 33749609313 scopus 로고    scopus 로고
    • Finding fastest paths on a road network with speed patterns
    • E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on a road network with speed patterns. In ICDE, pages 10-, 2006.
    • (2006) ICDE , pp. 10
    • Kanoulas, E.1    Du, Y.2    Xia, T.3    Zhang, D.4
  • 14
    • 77949349871 scopus 로고    scopus 로고
    • Traclass: Trajectory classification using hierarchical region-based and trajectory-based clustering
    • J.-G. Lee, J. Han, X. Li, and H. Gonzalez. Traclass: trajectory classification using hierarchical region-based and trajectory-based clustering. PVLDB, 1(1):1081-1094, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 1081-1094
    • Lee, J.-G.1    Han, J.2    Li, X.3    Gonzalez, H.4
  • 15
    • 35449007737 scopus 로고    scopus 로고
    • Trajectory clustering: A partition-and-group framework
    • J.-G. Lee, J. Han, and K.-Y. Whang. Trajectory clustering: a partition-and-group framework. In SIGMOD, pages 593-604, 2007.
    • (2007) SIGMOD , pp. 593-604
    • Lee, J.-G.1    Han, J.2    Whang, K.-Y.3
  • 16
    • 37849006890 scopus 로고    scopus 로고
    • Traffic density-based discovery of hot routes in road networks
    • X. Li, J. Han, J.-G. Lee, and H. Gonzalez. Traffic density-based discovery of hot routes in road networks. In SSTD, pages 441-459, 2007.
    • (2007) SSTD , pp. 441-459
    • Li, X.1    Han, J.2    Lee, J.-G.3    Gonzalez, H.4
  • 17
    • 80052749496 scopus 로고    scopus 로고
    • Swarm: Mining relaxed temporal moving object clusters
    • Z. Li, B. Ding, J. Han, and R. Kays. Swarm: mining relaxed temporal moving object clusters. Proc. VLDB Endow., 3(1-2):723-734, 2010.
    • (2010) Proc. VLDB Endow. , vol.3 , Issue.1-2 , pp. 723-734
    • Li, Z.1    Ding, B.2    Han, J.3    Kays, R.4
  • 20
    • 85002374027 scopus 로고    scopus 로고
    • Towards historical r-trees
    • M. A. Nascimento and J. R. O. Silva. Towards historical r-trees. In SAC, pages 235-240, 1998.
    • (1998) SAC , pp. 235-240
    • Nascimento, M.A.1    Silva, J.R.O.2
  • 21
    • 0025464812 scopus 로고
    • Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
    • A. Orda and R. Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM, 37(3):607-625, 1990.
    • (1990) J. ACM , vol.37 , Issue.3 , pp. 607-625
    • Orda, A.1    Rom, R.2
  • 23
    • 84877359020 scopus 로고    scopus 로고
    • Novel approaches in query processing for moving object trajectories
    • D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In VLDB, pages 395-406, 2000.
    • (2000) VLDB , pp. 395-406
    • Pfoser, D.1    Jensen, C.S.2    Theodoridis, Y.3
  • 25
    • 84944314495 scopus 로고    scopus 로고
    • Mv3r-tree: A spatio-temporal access method for timestamp and interval queries
    • Y. Tao and D. Papadias. Mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In VLDB, pages 431-440, 2001.
    • (2001) VLDB , pp. 431-440
    • Tao, Y.1    Papadias, D.2
  • 26
    • 0029696065 scopus 로고    scopus 로고
    • Spatio-temporal indexing for large multimedia applications
    • Y. Theodoridis, M. Vazirgiannis, and T. Sellis. Spatio-temporal indexing for large multimedia applications. In ICMCS, pages 441-448, 1996.
    • (1996) ICMCS , pp. 441-448
    • Theodoridis, Y.1    Vazirgiannis, M.2    Sellis, T.3
  • 27
    • 84866017857 scopus 로고    scopus 로고
    • Constructing popular routes from uncertain trajectories
    • L.-Y. Wei, Y. Zheng, and W.-C. Peng. Constructing popular routes from uncertain trajectories. In ACM SIGKDD, pages 195-203, 2012.
    • (2012) ACM SIGKDD , pp. 195-203
    • Wei, L.-Y.1    Zheng, Y.2    Peng, W.-C.3
  • 28
    • 0003137122 scopus 로고
    • Rt-tree: An improved r-tree index structure for spatiotemporal
    • X. Xu, J. Han, and W. Lu. Rt-tree: An improved r-tree index structure for spatiotemporal. SDH, pages 1040-1049, 1990.
    • (1990) SDH , pp. 1040-1049
    • Xu, X.1    Han, J.2    Lu, W.3
  • 29
    • 80052688627 scopus 로고    scopus 로고
    • Driving with knowledge from the physical world
    • J. Yuan, Y. Zheng, X. Xie, and G. Sun. Driving with knowledge from the physical world. In SIGKDD, pages 316-324, 2011.
    • (2011) SIGKDD , pp. 316-324
    • Yuan, J.1    Zheng, Y.2    Xie, X.3    Sun, G.4
  • 32
    • 80054052524 scopus 로고    scopus 로고
    • Urban computing with taxicabs
    • Y. Zheng, Y. Liu, J. Yuan, and X. Xie. Urban computing with taxicabs. In UbiComp, pages 89-98, 2011.
    • (2011) UbiComp , pp. 89-98
    • Zheng, Y.1    Liu, Y.2    Yuan, J.3    Xie, X.4
  • 33
    • 84865656232 scopus 로고    scopus 로고
    • Mining interesting locations and travel sequences from gps trajectories
    • Y. Zheng, L. Zhang, X. Xie, and W.-Y. Ma. Mining interesting locations and travel sequences from gps trajectories. In WWW, pages 791-800, 2009. Cooperation Program
    • (2009) WWW , pp. 791-800
    • Zheng, Y.1    Zhang, L.2    Xie, X.3    Ma, W.-Y.4


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