메뉴 건너뛰기




Volumn , Issue , 2008, Pages 587-592

Predict personal continuous route

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LOADS; DAILY LIVES; INTELLIGENT TRANSPORTATION SYSTEMS; LEVENSHTEIN DISTANCES; LOCATION-BASED SERVICES; MINING ALGORITHMS; ONE STEPS; PATTERN MININGS; PERSONAL PRIVACIES; PREFIXSPAN; PROBABILISTIC TREES; SYSTEM ARCHITECTURES;

EID: 60749135555     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITSC.2008.4732585     Document Type: Conference Paper
Times cited : (15)

References (11)
  • 2
    • 84908239069 scopus 로고    scopus 로고
    • Vehicle route prediction and time of arrival estimation techniques for improved transportation system management
    • A. Karbassl and M. Barth, "Vehicle route prediction and time of arrival estimation techniques for improved transportation system management", in IEEE Intelligent Vehicles Symposium, pp. 511-516, 2003
    • (2003) IEEE Intelligent Vehicles Symposium , pp. 511-516
    • Karbassl, A.1    Barth, M.2
  • 9
    • 0035016443 scopus 로고    scopus 로고
    • PrefixSpan: Mining sequential patterns by prefix-projected growth
    • J. Pei, et al., "PrefixSpan: mining sequential patterns by prefix-projected growth", in IEEE International Conference on Data Engineering, pp.215-224, 2001
    • (2001) IEEE International Conference on Data Engineering , pp. 215-224
    • Pei, J.1
  • 11
    • 60749132601 scopus 로고    scopus 로고
    • at May 2008, Retrieved access at May 2008, From
    • Levenshtcin distance, Last update at May 2008, Retrieved access at May 2008, From http://en.wikipedia.org/wiki/Levenshtein-distance
    • Levenshtcin distance, Last update


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