Trajectory clustering of road traffic in urban environments using incremental machine learning in combination with hyperdimensional computing
The DOI matches its Crossref record.
Abstract
Road traffic congestion in urban environments poses an increasingly complex challenge of detection, profiling and prediction. Although public policy promotes transport alternatives and new infrastructure, traffic congestion is highly prevalent and continues to be the lead cause for numerous social, economic and environmental issues. Although a significant volume of research has been reported on road traffic prediction, profiling of traffic has received much less attention. In this paper we address two key problems in traffic profiling by proposing a novel unsupervised incremental learning approach for road traffic congestion detection and profiling, dynamically over time. This approach uses (a) hyperdimensional computing to enable capture variable-length trajectories of commuter trips represented as vehicular movement across intersections, and (b) transforms these into feature vectors that can be incrementally learned over time by the Incremental Knowledge Acquiring Self-Learning (IKASL) algorithm. The proposed approach was tested and evaluated on a dataset consisting of approximately 190 million vehicular movement records obtained from 1,400 Bluetooth identifiers placed at the intersections of the arterial road network in the State of Victoria, Australia.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
In-memory hyperdimensional computing
Karunaratne, G., Le Gallo, M., Cherubini, G., Benini, L., Rahimi, A., & Sebastian, A. (2020) · Nature Electronics · doi:10.1038/s41928-020-0410-3 · Cited by 293
“In traditional forms of computing, HDC has been proposed for efficient representation of structured information 15 as well as the synthesis and execution of finite state automata 16 and variants of recurrent neural networks 17 .”
MethodClassification using hyperdimensional computing: a review
Ge, L., & Parhi, K. K. (2020) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2020.2988388 · Cited by 227
Kleyko, D., Rachkovskij, D., Osipov, E., & Rahimi, A. (2023) · ACM Computing Surveys · doi:10.1145/3558000 · Cited by 141
Self-citation
Metadata
- Authors
- Bandaragoda, T., De Silva, D., Kleyko, D., Osipov, E., Wiklund, U., & Alahakoon, D.
- Venue
- 2019 IEEE Intelligent Transportation Systems Conference (ITSC)
- Publisher
- IEEE
- Published
- 2019-10
- Pages
- 1664-1670
- OpenAlex
- W2990509288
- Cited by
- 36
- References
- 0
- FWCI
- 9.51
- 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 of road traffic in urban environments using incremental machine learning in combination with hyperdimensional computing. https://app.cochat.ai/papers/10.1109/itsc.2019.8917320
- The paper
- Bandaragoda, T., De Silva, D., Kleyko, D., Osipov, E., Wiklund, U., & Alahakoon, D. (2019). Trajectory clustering of road traffic in urban environments using incremental machine learning in combination with hyperdimensional computing. 2019 IEEE Intelligent Transportation Systems Conference (ITSC). https://doi.org/10.1109/itsc.2019.8917320
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.