Name
Abstract | ||
|---|---|---|
This study proposes a generic encoder for network-constrained travel trajectories, and it implements two encoders by combining the proposed generic encoder with two routing algorithms, which reduce the size of a travel trajectory's path along a road network without modifying it. Although most previous trajectory compression methods introduce an error in the spatial component of trajectories to achieve compression, we argue that the path of a travel trajectory, i.e. the sequence of roads travelled, is crucial information for many applications. Experimental results obtained using a large-data set of real travel trajectories show that the two proposed encoders achieve high compression, outperforming a general purpose data compression method. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1504/IJKWI.2013.052724 | I. J. Knowledge and Web Intelligence |
Keywords | Field | DocType |
generic encoder,proposed encoders,compression method,previous trajectory compression method,network-constrained travel trajectory,crucial information,real travel trajectory,proposed generic encoder,high compression,travel trajectory,routing algorithm,gis,global positioning systems,gps,shortest path,routing algorithms | Data mining,Shortest path problem,Computer science,Algorithm,Theoretical computer science,Encoder,Global Positioning System,Data compression,Trajectory,Map matching,Encoding (memory),Routing algorithm | Journal |
Volume | Issue | Citations |
4 | 1 | 2 |
PageRank | References | Authors |
0.42 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pablo Martinez Lerin | 1 | 9 | 1.94 |
| Daisuke Yamamoto | 2 | 14 | 4.15 |
| Naohisa Takahashi | 3 | 123 | 27.99 |