Spatial-Temporal K Nearest Neighbors Model on MapReduce for Traffic Flow Prediction

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Researches in the area of short-term traffic flow forecasting are important for traffic flow management in intelligent transport systems. In this paper, a distributed model for short-term traffic flow prediction based on the k nearest neighbors method is presented. This model takes into account spatial and temporal traffic flow distribution. We define a feature vector for a targeted road segment using traffic flow on segments in a compact area at different time intervals. To reduce the dimensionality of the feature vector, we use principal component analysis procedure. The proposed model is based on MapReduce technology and implemented using an Apache Spark framework. An experimental study data is obtained from the transportation network of Samara, Russia.

Cite

CITATION STYLE

APA

Agafonov, A., & Yumaganov, A. (2018). Spatial-Temporal K Nearest Neighbors Model on MapReduce for Traffic Flow Prediction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11314 LNCS, pp. 253–260). Springer Verlag. https://doi.org/10.1007/978-3-030-03493-1_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free