The DOI matches its Crossref record.
On Discovery of Traveling Companions from Streaming Trajectories
Abstract
The advance of object tracking technologies leads to huge volumes of spatio-temporal data collected in the form of trajectory data stream. In this study, we investigate the problem of discovering object groups that travel together (i.e., traveling companions) from trajectory stream. Such technique has broad applications in the areas of scientific study, transportation management and military surveillance. To discover traveling companions, the monitoring system should cluster the objects of each snapshot and intersect the clustering results to retrieve moving-together objects. Since both clustering and intersection steps involve high computational overhead, the key issue of companion discovery is to improve the algorithm's efficiency. We propose the models of closed companion candidates and smart intersection to accelerate data processing. A new data structure termed traveling buddy is designed to facilitate scalable and flexible companion discovery on trajectory stream. The traveling buddies are micro-groups of objects that are tightly bound together. By only storing the object relationships rather than their spatial coordinates, the buddies can be dynamically maintained along trajectory stream with low cost. Based on traveling buddies, the system can discover companions without accessing the object details. The proposed methods are evaluated with extensive experiments on both real and synthetic datasets. The buddy-based method is an order of magnitude faster than existing methods. It also outperforms other competitors with higher precision and recall in companion discovery.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Urban Computing: Concepts, Methodologies, and Applications
Zheng, Y., Capra, L., Wolfson, O., & Yang, H. (2014) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2629592 · Cited by 1,507
Self-citationHierarchical and Networked Vehicle Surveillance in ITS: A Survey
Tian, B., Morris, B. T., Tang, M., Liu, Y., Yao, Y., Gou, C., Shen, D., & Tang, S. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2552778 · Cited by 160
Metadata
- Authors
- Tang, L.-A., Zheng, Y., Yuan, J., Han, J., Leung, A., Hung, C.-C., & Peng, W.-C.
- Venue
- 2012 IEEE 28th International Conference on Data Engineering
- Publisher
- IEEE
- Published
- 2012-04
- Pages
- 186-197
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2028113911
- Cited by
- 172
- References
- 0
- FWCI
- 11.85
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.