Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Flow-Aware WPT k-Nearest Neighbours Regression for Short-Term Traffic Prediction
Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.ORCID iD: 0000-0001-5824-425X
Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.
Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.ORCID iD: 0000-0002-6920-9983
Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.
2017 (English)In: Proceedings - IEEE Symposium on Computers and Communications, Institute of Electrical and Electronics Engineers (IEEE), 2017, Vol. 07, p. 48-53, article id 8024503Conference paper, Published paper (Refereed)
Abstract [en]

Robust and accurate traffic prediction is critical in modern intelligent transportation systems (ITS). One widely used method for short-term traffic prediction is k-nearest neighbours (kNN). However, choosing the right parameter values for kNN is problematic. Although many studies have investigated this problem, they did not consider all parameters of kNN at the same time. This paper aims to improve kNN prediction accuracy by tuning all parameters simultaneously concerning dynamic traffic characteristics. We propose weighted parameter tuples (WPT) to calculate weighted average dynamically according to flow rate. Comprehensive experiments are conducted on one-year real-world data. The results show that flow-aware WPT kNN performs better than manually tuned kNN as well as benchmark methods such as extreme gradient boosting (XGB) and seasonal autoregressive integrated moving average (SARIMA). Thus, it is recommended to use dynamic parameters regarding traffic flow and to consider all parameters at the same time.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2017. Vol. 07, p. 48-53, article id 8024503
Series
IEEE Symposium on Computers and Communications ISCC, ISSN 1530-1346
Keywords [en]
Flow-Aware, Weighted Parameter Tuples, kNearest Neighbours Regression, Short-Term Traffic Prediction
National Category
Computer Sciences Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:bth-15208DOI: 10.1109/ISCC.2017.8024503ISI: 000426895800009ISBN: 9781538616291 (print)OAI: oai:DiVA.org:bth-15208DiVA, id: diva2:1145417
Conference
2017 IEEE Symposium on Computers and Communication (ISCC), Heraklion, Crete
Available from: 2017-09-28 Created: 2017-09-28 Last updated: 2023-12-28Bibliographically approved
In thesis
1. Automated Traffic Time Series Prediction
Open this publication in new window or tab >>Automated Traffic Time Series Prediction
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Intelligent transportation systems (ITS) are becoming more and more effective. Robust and accurate short-term traffic prediction plays a key role in modern ITS and demands continuous improvement. Benefiting from better data collection and storage strategies, a huge amount of traffic data is archived which can be used for this purpose especially by using machine learning.

For the data preprocessing stage, despite the amount of data available, missing data records and their messy labels are two problems that prevent many prediction algorithms in ITS from working effectively and smoothly. For the prediction stage, though there are many prediction algorithms, higher accuracy and more automated procedures are needed.

Considering both preprocessing and prediction studies, one widely used algorithm is k-nearest neighbours (kNN) which has shown high accuracy and efficiency. However, the general kNN is designed for matrix instead of time series which lacks the use of time series characteristics. Choosing the right parameter values for kNN is problematic due to dynamic traffic characteristics. This thesis analyses kNN based algorithms and improves the prediction accuracy with better parameter handling using time series characteristics.

Specifically, for the data preprocessing stage, this work introduces gap-sensitive windowed kNN (GSW-kNN) imputation. Besides, a Mahalanobis distance-based algorithm is improved to support correcting and complementing label information. Later, several automated and dynamic procedures are proposed and different strategies for making use of data and parameters are also compared.

Two real-world datasets are used to conduct experiments in different papers. The results show that GSW-kNN imputation is 34% on average more accurate than benchmarking methods, and it is still robust even if the missing ratio increases to 90%. The Mahalanobis distance-based models efficiently correct and complement label information which is then used to fairly compare performance of algorithms. The proposed dynamic procedure (DP) performs better than manually adjusted kNN and other benchmarking methods in terms of accuracy on average. What is better, weighted parameter tuples (WPT) gives more accurate results than any human tuned parameters which cannot be achieved manually in practice. The experiments indicate that the relations among parameters are compound and the flow-aware strategy performs better than the time-aware one. Thus, it is suggested to consider all parameter strategies simultaneously as ensemble strategies especially by including window in flow-aware strategies.

In summary, this thesis improves the accuracy and automation level of short-term traffic prediction with proposed high-speed algorithms.

Place, publisher, year, edition, pages
Karlskrona: Blekinge Tekniska Högskola, 2018
Series
Blekinge Institute of Technology Doctoral Dissertation Series, ISSN 1653-2090 ; 10
Keywords
Machine Learning, Time Series, Traffic Engineering
National Category
Computer Sciences Transport Systems and Logistics
Identifiers
urn:nbn:se:bth-17210 (URN)978-91-7295-360-4 (ISBN)
Public defence
2018-11-30, J1650, Valhallav. 1, Karlskrona, 13:30 (English)
Opponent
Supervisors
Available from: 2018-11-02 Created: 2018-11-01 Last updated: 2018-12-14Bibliographically approved

Open Access in DiVA

fulltext(374 kB)748 downloads
File information
File name FULLTEXT01.pdfFile size 374 kBChecksum SHA-512
7bff66a1a0fbfc6fc916866bb1e2df9094527a3b5895ca72d22682034d34727e5fda25a5df37879ba4c1443489a09f47fa96e093379f112e0fd3caaa612dd8be
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Sun, BinWei, ChengPrashant, GoswamiGuohua, Bai
By organisation
Department of Creative Technologies
Computer SciencesTransport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 748 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 579 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf