完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Wei, Ling-Yin | en_US |
dc.contributor.author | Chang, Kai-Ping | en_US |
dc.contributor.author | Peng, Wen-Chih | en_US |
dc.date.accessioned | 2015-07-21T08:29:46Z | - |
dc.date.available | 2015-07-21T08:29:46Z | - |
dc.date.issued | 2015-06-01 | en_US |
dc.identifier.issn | 0926-8782 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1007/s10619-013-7139-1 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/124635 | - |
dc.description.abstract | With the prevalence of GPS-equipped devices and navigation services, users can record and share their driving movements via trajectories. These trajectories reveal users\' driving behaviors for planning routes. In this paper, we propose a novel pattern-aware route discovery framework that considers users\' preferred routes. The proposed framework is comprised of two components: pattern-aware road map generation and route planning. In the first component, we mine significant road segments from historical trajectories, and generate a pattern-aware road map. We design a route score function that strikes a balance between user preference degrees and the length of the route. For the second component, given a source, a destination, and a user pre-defined value k, we intend to derive the top-k routes that consist of road segments from the source to the destination in the pattern-aware road map. To support on-line route planning in most navigation services, we propose a constrained breadth-first-search (CBFS) algorithm. We evaluate the performance of our framework using real trajectory data, and compare our framework with an existing approach in terms of effectiveness and efficiency. The experimental results demonstrate the effectiveness and efficiency of our proposed framework. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Trip planning | en_US |
dc.subject | Trajectory database | en_US |
dc.subject | Geographic information system | en_US |
dc.subject | Data mining | en_US |
dc.subject | Location-based services | en_US |
dc.title | Discovering pattern-aware routes from trajectories | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1007/s10619-013-7139-1 | en_US |
dc.identifier.journal | DISTRIBUTED AND PARALLEL DATABASES | en_US |
dc.citation.volume | 33 | en_US |
dc.citation.spage | 201 | en_US |
dc.citation.epage | 226 | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.identifier.wosnumber | WOS:000353468500004 | en_US |
dc.citation.woscount | 0 | en_US |
顯示於類別: | 期刊論文 |