The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Trajectory clustering via deep representation learning
Abstract
Trajectory clustering, which aims at discovering groups of similar trajectories, has long been considered as a corner stone task for revealing movement patterns as well as facilitating higher-level applications like location prediction. While a plethora of trajectory clustering techniques have been proposed, they often rely on spatiotemporal similarity measures that are not space- and time-invariant. As a result, they cannot detect trajectory clusters where the within-cluster similarity occurs in different regions and time periods. In this paper, we revisit the trajectory clustering problem by learning quality low-dimensional representations of the trajectories. We first use a sliding window to extract a set of moving behavior features that capture space- and time-invariant characteristics of the trajectories. With the feature extraction module, we transform each trajectory into a feature sequence to describe object movements, and further employ a sequence to sequence autoencoder to learn fixed-length deep representations. The learnt representations robustly encode the movement characteristics of the objects and thus lead to space- and time-invariant clusters. We evaluate the proposed method on both synthetic and real data, and observe significant performance improvements over existing methods.
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
Cites
Learning long-term dependencies with gradient descent is difficult
Bengio, Y., Simard, P., & Frasconi, P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279181 · Cited by 8,542
Unsupervised Learning of Video Representations using LSTMs
Srivastava, N., Mansimov, E., & Salakhutdinov, R. (2015) · arXiv · doi:10.48550/arxiv.1502.04681 · Cited by 1,861
Cited by
Deep Learning in Mobile and Wireless Networking: A Survey
Zhang, C., Patras, P., & Haddadi, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2904897 · Cited by 1,768
Self-citationA survey on deep learning and its applications
Dong, S., Wang, P., & Abbas, K. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100379 · Cited by 1,544
Deep Learning for Spatio-Temporal Data Mining: A Survey
Wang, S., Cao, J., & Yu, P. S. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3025580 · Cited by 822
Deep Learning for Intelligent Transportation Systems: A Survey of Emerging Trends
Veres, M., & Moussa, M. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2929020 · Cited by 394
A Survey on Trajectory Data Management, Analytics, and Learning
Wang, S., Bao, Z., Culpepper, J. S., & Cong, G. (2022) · ACM Computing Surveys · doi:10.1145/3440207 · Cited by 267
Metadata
- Authors
- Yao, D., Zhang, C., Zhu, Z., Huang, J., & Bi, J.
- Venue
- 2017 International Joint Conference on Neural Networks (IJCNN)
- Publisher
- IEEE
- Published
- 2017-05
- Pages
- 3880-3887
- OpenAlex
- W2734775449
- Cited by
- 189
- References
- 2
- FWCI
- 10.18
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Trajectory clustering via deep representation learning. https://app.cochat.ai/papers/10.1109/ijcnn.2017.7966345
- The paper
- Yao, D., Zhang, C., Zhu, Z., Huang, J., & Bi, J. (2017). Trajectory clustering via deep representation learning. 2017 International Joint Conference on Neural Networks (IJCNN). https://doi.org/10.1109/ijcnn.2017.7966345
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.