Thông tin tài liệu

Thông tin siêu dữ liệu biểu ghi
Trường DC Giá trịNgôn ngữ
dc.contributor.authorDing, Yichenvi
dc.contributor.otherZhou, Xunvi
dc.contributor.otherWu, Guojunvi
dc.contributor.otherLi, Yanhuavi
dc.contributor.otherBao, Jievi
dc.contributor.otherZheng, Yuvi
dc.contributor.otherLuo, Junvi
dc.date.accessioned2021-03-31T07:54:48Z-
dc.date.available2021-03-31T07:54:48Z-
dc.date.issued2020-
dc.identifier.urihttp://tailieuso.tlu.edu.vn/handle/DHTL/10618-
dc.description.abstractGiven a set of user-specified locations and a massive trajectory dataset, the task of mining spatio-temporal reachable regions aims at finding which road segments are reachable from these locations within a given temporal period based on the historical trajectories. Determining such spatio-temporal reachable regions with high accuracy is vital for many urban applications, such as location-based recommendations and advertising. Traditional approaches to answering such queries essentially perform a distance-based range query over the given road network, which does not consider dynamic travel time at different time of day. By contrast, we propose a data-driven approach to formulate the problem as mining actual reachable regions based on a real historical trajectory dataset. Efficient algorithms for the Single-location spatio-temporal reachability Query (S-Query) and the Union-of-multi-location spatio-temporal reachability Query (U-Query) were presented in our recent work. In this paper, we extend the previous ideas by introducing a new type of reachability query with multiple sources, namely, the Intersection-of-multi-location spatio-temporal reachability Query (I-Query). As we demonstrate, answering I-Queries efficiently is generally more computationally challenging than answering either S-Queries or U-Queries because I-Queries involve complicated intersect conditions. We propose two new algorithms called the Intersection-of-Multi-location Query Maximum Bounding region search (I-MQMB) algorithm and the I-Query Trace Back Search (I-TBS) algorithm to efficiently answer I-Queries, which utilize an indexing schema composed of a spatio-temporal index and a connection index. We evaluate our system extensively by using a large-scale real taxi trajectory dataset that records taxi rides in Shenzhen, China. Our results demonstrate that the proposed approach reduces the running time of I-Queries by 50% on average compared to the baseline methodvi
dc.description.urihttps://doi.org/10.1109/TKDE.2019.2959531vi
dc.languageenvi
dc.publisherIEEE Xplorevi
dc.relation.ispartofseriesIEEE Transactions on Knowledge and Data Engineeringvi
dc.subjectRoadsvi
dc.subjectTrajectoryvi
dc.subjectBusinessvi
dc.subjectIndexesvi
dc.subjectQuery processingvi
dc.subjectPublic transportationvi
dc.subjectData miningvi
dc.titleMining Spatio-temporal Reachable Regions With Multiple Sources over Massive Trajectory Datavi
dc.typeBBvi
Trong bộ sưu tập: Tài liệu hỗ trợ nghiên cứu khoa học

Danh sách tệp tin đính kèm:
Ảnh bìa
  • D10618.pdf
      Restricted Access
    • Dung lượng : 4,92 MB

    • Định dạng : Adobe PDF

  • Bạn đọc là cán bộ, giáo viên, sinh viên của Trường Đại học Thuỷ Lợi cần đăng nhập để Xem trực tuyến/Tải về



    Khi sử dụng tài liệu trong thư viện số bạn đọc phải tuân thủ đầy đủ luật bản quyền.