A New Method of Time-Series Event Prediction Based on Sequence Labeling
In the existing research on time-series event prediction (TSEP) methods, most of the work is focused on improving the algorithm for classifying subsequence sets (sets composed of multiple adjacent subsequences). However, these prediction methods ignore the timing dependence between the subsequence s...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI
2023
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
LEADER | 02460nam a2200241Ia 4500 | ||
---|---|---|---|
001 | 10.3390-app13095329 | ||
008 | 230529s2023 CNT 000 0 und d | ||
020 | |a 20763417 (ISSN) | ||
245 | 1 | 0 | |a A New Method of Time-Series Event Prediction Based on Sequence Labeling |
260 | 0 | |b MDPI |c 2023 | |
856 | |z View Fulltext in Publisher |u https://doi.org/10.3390/app13095329 | ||
856 | |z View in Scopus |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-85159324875&doi=10.3390%2fapp13095329&partnerID=40&md5=1917dbd9600e4ffe57e5eede5ebe8825 | ||
520 | 3 | |a In the existing research on time-series event prediction (TSEP) methods, most of the work is focused on improving the algorithm for classifying subsequence sets (sets composed of multiple adjacent subsequences). However, these prediction methods ignore the timing dependence between the subsequence sets, nor do they capture the mutual transition relationship between events, the prediction effect on a small sample data set is very poor. Meanwhile, the sequence labeling problem is one of the common problems in natural language processing and image segmentation. To solve this problem, this paper proposed a new framework for time-series event prediction, which transforms the event prediction problem into a labeling problem, to better capture the timing relationship between the subsequence sets. Specifically, the framework used a sequence clustering algorithm for the first time to identify representative patterns in the time series, then represented the set of subsequences as a weighted combination of patterns, and used the eXtreme gradient boosting algorithm (XGBoost) for feature selection. After that, the selected pattern feature was used as the input of the long-term short-term memory model (LSTM) to obtain the preliminary prediction value. Furthermore, the fully-linked conditional random field (CRF) was used to smooth and refine the preliminary prediction value to obtain the final prediction result. Finally, the experimental results of event prediction on five real data sets show that the CX-LC method has a certain improvement in prediction accuracy compared with the other six models. © 2023 by the authors. | |
650 | 0 | 4 | |a CRF |
650 | 0 | 4 | |a LSTM |
650 | 0 | 4 | |a pattern recognition |
650 | 0 | 4 | |a sequence labeling |
650 | 0 | 4 | |a TSEP |
650 | 0 | 4 | |a XGBoost |
700 | 1 | 0 | |a Lv, S. |e author |
700 | 1 | 0 | |a Shi, K. |e author |
700 | 1 | 0 | |a Zhong, Z. |e author |
773 | |t Applied Sciences (Switzerland) |