Skip to content
naulon
Not checkedNot checked for notices yet.

Similarity Grouping-Guided Neural Network Modeling for Maritime Time Series Prediction

Yan Li, Ryan Wen Liu, Zhao Liu and 1 more

IEEE Access · 2019

doi:10.1109/access.2019.2920436 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Reliable and accurate prediction of time series plays a crucial role in the maritime industry, such as economic investment, transportation planning, port planning, design, and so on. The dynamic growth of maritime time series has the predominantly complex, and nonlinear and non-stationary properties. To guarantee high-quality prediction performance, we propose to first adopt the empirical mode decomposition (EMD) and ensemble EMD (EEMD) methods to decompose the original time series into high- and low-frequency components. The low-frequency components can be easily predicted directly through traditional neural network (NN) methods. It is more difficult to predict high-frequency components due to their properties of weak mathematical regularity. To take advantage of the inherent self-similarities within high-frequency components, these components will be divided into several continuous small (overlapping) segments. The grouped segments with high similarities are then selected to form more proper training datasets for traditional NN methods. This regrouping strategy can assist in enhancing the prediction accuracy of high-frequency components. The final prediction result is obtained by integrating the predicted high- and low-frequency components. Our proposed three-step prediction frameworks benefit from the time series decomposition and similar segments grouping. The experiments on both port cargo throughput and vessel traffic flow have illustrated its superior performance in terms of prediction accuracy and robustness.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.