A preliminary study on automatic algorithm selection for short-term traffic forecasting

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

Abstract

Despite the broad range of Machine Learning (ML) algorithms, there are no clear baselines to find the best method and its configuration given a Short-Term Traffic Forecasting (STTF) problem. In ML, this is known as the Model Selection Problem (MSP). Although Automatic Algorithm Selection (AAS) has proved success dealing with MSP in other areas, it has hardly been explored in STTF. This paper deepens into the benefits of AAS in this field. To this end, we have used Auto-WEKA, a well-known AAS method, and compared it to the general approach (which consists of selecting the best of a set of algorithms) over a multi-class imbalanced classification STTF problem. Experimental results show AAS as a promising methodology in this area and allow important conclusions to be drawn on how to improve the performance of ASS methods when dealing with STTF.

Cite

CITATION STYLE

APA

Angarita-Zapata, J. S., Triguero, I., & Masegosa, A. D. (2018). A preliminary study on automatic algorithm selection for short-term traffic forecasting. In Studies in Computational Intelligence (Vol. 798, pp. 204–214). Springer Verlag. https://doi.org/10.1007/978-3-319-99626-4_18

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