Earticle

초록

영어

The postal service sector uses machine learning to forecast delivery time and customer traffic. Studies on postal logistics forecasting have used various machine learning algorithms, but there were no attempts using Seasonal and Trend Decomposition using Loess (STL) decomposition, which is frequently used in other fields of time series forecasting. Therefore, this paper proposes a method of applying optimal STL decomposition cycles using the machine learning models of prior studies and the latest machine learning models. First, the proposed method decomposes the daily traffic using STL decomposition to generate three variables (Trend, Seasonal, and Residual). These variables are added to the existing input data variable to train the machine learning model. Finally, a suitable STL decomposition cycle for the model is selected to derive an optimal model. The proposed method was validated by creating nine machine learning (AdaBoost Regression, Random Forest Regression, Ridge, etc.) and two deep learning (DNN, LSTM) models and testing them. As a result, the application of STL decomposition reduced the forecast errors in all models except LSTM. In terms of the proposed method, linear regression had the lowest forecast error, and LSTM had the highest.

목차

Abstract
I. INTRODUCTION
II. RELATED WORK
III. PROPOSED METHOD
A. Data Set
B. Data Preprocessing
C. Models Used
D. Selecting the Optimal Cycle
IV. EXPERIMENT
V. Conclusion and Future Study
ACKNOWLEDGMENT
REFERENCES

키워드

저자

• So Yeon Woo [ Departments of Artificial Intelligence Sejong University ]
• Deok Ho An [ Department of Computer Engineering Department of Convergence Engineering for Intelligent Drone Sejong University ]
• Da Woon Jeong [ Departments of Computer Engineering Sejong University ]
• Yeong Hyeon Gu [ Departments of Computer Engineering Sejong University ]
• Seong Joon Yoo [ Departments of Computer Engineering Sejong University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  한국차세대컴퓨팅학회 학술대회

• 간기

  반년간

• 수록기간

  2021~2025

• 십진분류

  KDC 566 DDC 004