메뉴 건너뛰기




Volumn 25, Issue 1, 2013, Pages 220-232

T-drive: Enhancing driving directions with taxi drivers' intelligence

Author keywords

data mining; driving behavior; driving directions; GPS trajectory; Spatial databases and GIS

Indexed keywords

CLUSTERING APPROACH; DEPARTURE TIME; DRIVING BEHAVIOR; DRIVING DIRECTIONS; DYNAMIC TRAFFIC PATTERNS; END USERS; FASTEST ROUTE; GPS TRAJECTORIES; MOBILE SENSORS; PHYSICAL WORLD; SPATIAL DATABASES AND GIS; SYNTHETIC EXPERIMENTS; TAXI DRIVERS; TIME SLOTS; TIME-DEPENDENT; TRAJECTORY DATA;

EID: 84870471446     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2011.200     Document Type: Article
Times cited : (386)

References (29)
  • 6
    • 0025464812 scopus 로고
    • Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
    • DOI 10.1145/79147.214078
    • A. Orda and R. Rom, "Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Length," J. ACM, vol. 37, no. 3, pp. 607-625, 1990. (Pubitemid 20723071)
    • (1990) Journal of the ACM , vol.37 , Issue.3 , pp. 607-625
    • Orda Ariel1    Rom Raphael2
  • 7
    • 77952424237 scopus 로고    scopus 로고
    • The exponential learning equation as a function of successful trials results in sigmoid performance
    • N. Leibowitz, B. Baum, G. Enden, and A. Karniel, "The Exponential Learning Equation as a Function of Successful Trials Results in Sigmoid Performance," J. Math. Psychology, vol. 54, no. 3, pp. 338-340, 2010.
    • (2010) J. Math. Psychology , vol.54 , Issue.3 , pp. 338-340
    • Leibowitz, N.1    Baum, B.2    Enden, G.3    Karniel, A.4
  • 9
    • 0001259916 scopus 로고
    • Longest increasing and decreasing subsequences
    • C. Schensted, "Longest Increasing and Decreasing Subsequences," Canadian J. Math., vol. 13, pp. 179-191, 1961.
    • (1961) Canadian J. Math. , vol.13 , pp. 179-191
    • Schensted, C.1
  • 13
    • 0009349631 scopus 로고    scopus 로고
    • The shortest route through a network with time-dependent internodal transit times
    • K. Cooke and E. Halsey, "The Shortest Route through a Network with Time-Dependent Internodal Transit Times," J. Math. Analysis Applications, vol. 14, pp. 492-498, 1998.
    • (1998) J. Math. Analysis Applications , vol.14 , pp. 492-498
    • Cooke, K.1    Halsey, E.2
  • 14
    • 0000418612 scopus 로고
    • An appraisal of some shortest-path algorithms
    • S. Dreyfus, "An Appraisal of Some Shortest-Path Algorithms," Operations Research, vol. 17, no. 3, pp. 395-412, 1969.
    • (1969) Operations Research , vol.17 , Issue.3 , pp. 395-412
    • Dreyfus, S.1
  • 25
    • 77955177092 scopus 로고    scopus 로고
    • Path prediction and predictive range querying in road network databases
    • Aug.
    • H. Jeung, M.L. Yiu, X. Zhou, and C.S. Jensen, "Path Prediction and Predictive Range Querying in Road Network Databases," VLDB J., vol. 19, pp. 585-602, Aug. 2010.
    • (2010) VLDB J. , vol.19 , pp. 585-602
    • Jeung, H.1    Yiu, M.L.2    Zhou, X.3    Jensen, C.S.4


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