• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    REST: A Reference-based Framework for Spatio-temporal Trajectory Compression

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    p2797-zhao.pdf
    Size:
    1.615Mb
    Format:
    PDF
    Description:
    Published version
    Download
    Type
    Conference Paper
    Authors
    Zhao, Yan
    Shang, Shuo
    Wang, Yu
    Zheng, Bolong
    Nguyen, Quoc Viet Hung
    Zheng, Kai
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2018-07-19
    Online Publication Date
    2018-07-19
    Print Publication Date
    2018
    Permanent link to this record
    http://hdl.handle.net/10754/628894
    
    Metadata
    Show full item record
    Abstract
    The 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.
    Citation
    Zhao 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.
    Sponsors
    This research is partially supported by the Natural Science Foundation of China (Grant No. 61532018, 61502324).
    Publisher
    Association for Computing Machinery (ACM)
    Journal
    Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18
    Conference/Event name
    24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2018
    DOI
    10.1145/3219819.3220030
    Additional Links
    https://dl.acm.org/citation.cfm?doid=3219819.3220030
    ae974a485f413a2113503eed53cd6c53
    10.1145/3219819.3220030
    Scopus Count
    Collections
    Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.