Show simple item record

dc.contributor.authorZhao, Yan
dc.contributor.authorShang, Shuo
dc.contributor.authorWang, Yu
dc.contributor.authorZheng, Bolong
dc.contributor.authorNguyen, Quoc Viet Hung
dc.contributor.authorZheng, Kai
dc.date.accessioned2018-10-07T08:48:06Z
dc.date.available2018-10-07T08:48:06Z
dc.date.issued2018-07-19
dc.identifier.citationZhao Y, Shang S, Wang Y, Zheng B, Nguyen QVH, et al. (2018) REST. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD ’18. Available: http://dx.doi.org/10.1145/3219819.3220030.
dc.identifier.doi10.1145/3219819.3220030
dc.identifier.urihttp://hdl.handle.net/10754/628894
dc.description.abstractThe pervasiveness of GPS-enabled devices and wireless communication technologies results in massive trajectory data, incurring expensive cost for storage, transmission, and query processing. To relieve this problem, in this paper we propose a novel framework for compressing trajectory data, REST (Reference-based Spatio-temporal trajectory compression), by which a raw trajectory is represented by concatenation of a series of historical (sub-)trajectories (called reference trajectories) that form the compressed trajectory within a given spatio-temporal deviation threshold. In order to construct a reference trajectory set that can most benefit the subsequent compression, we propose three kinds of techniques to select reference trajectories wisely from a large dataset such that the resulting reference set is more compact yet covering most footprints of trajectories in the area of interest. To address the computational issue caused by the large number of combinations of reference trajectories that may exist for resembling a given trajectory, we propose efficient greedy algorithms that run in the blink of an eye and dynamic programming algorithms that can achieve the optimal compression ratio. Compared to existing work on trajectory compression, our framework has few assumptions about data such as moving within a road network or moving with constant direction and speed, and better compression performance with fairly small spatio-temporal loss. Extensive experiments on a real taxi trajectory dataset demonstrate the superiority of our framework over existing representative approaches in terms of both compression ratio and efficiency.
dc.description.sponsorshipThis research is partially supported by the Natural Science Foundation of China (Grant No. 61532018, 61502324).
dc.publisherAssociation for Computing Machinery (ACM)
dc.relation.urlhttps://dl.acm.org/citation.cfm?doid=3219819.3220030
dc.rightsArchived with thanks to Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18
dc.subjectCompression algorithm
dc.subjectSpatio-temporal data
dc.subjectTrajectory
dc.titleREST: A Reference-based Framework for Spatio-temporal Trajectory Compression
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalProceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18
dc.conference.date2018-08-19 to 2018-08-23
dc.conference.name24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2018
dc.conference.locationLondon, GBR
dc.eprint.versionPublisher's Version/PDF
dc.contributor.institutionSoochow University, Suzhou, China
dc.contributor.institutionThe Chinese University of Hong Kong, Hong Kong, China
dc.contributor.institutionHuazhong University of Science and Technology &Aalborg University, Wuhan, China
dc.contributor.institutionGriffith University, Brisbane, Australia
dc.contributor.institutionUniversity of Electronic Science and Technology of China, Chengdu, China
kaust.personShang, Shuo
refterms.dateFOA2018-10-07T08:52:42Z
dc.date.published-online2018-07-19
dc.date.published-print2018


Files in this item

Thumbnail
Name:
p2797-zhao.pdf
Size:
1.615Mb
Format:
PDF
Description:
Published version

This item appears in the following Collection(s)

Show simple item record