TY - JOUR
T1 - Design of Self-Optimizing Polynomial Neural Networks with Temporal Feature Enhancement for Time Series Classification
AU - Tang, Yuqi
AU - Xu, Zhilei
AU - Huang, Wei
N1 - Publisher Copyright:
© 2025 by the authors.
PY - 2025/2
Y1 - 2025/2
N2 - Time series classification is a significant and complex issue in data mining, it is prevalent across various fields and holds substantial research value. However, enhancing the classification rate of time series data remains a formidable challenge. Traditional time series classification methods often face difficulties related to insufficient feature extraction or excessive model complexity. In this study, we propose a self-optimizing polynomial neural network with a temporal feature enhancement, which is referred to as OPNN-T. Existing classifiers based on polynomial neural networks (PNNs) struggle to achieve high-quality performances when dealing with time series data, primarily due to their inability to extract temporal information effectively. The goal of the proposed classifier is to enhance the nonlinear modeling capability for time series data, thereby improving the classification rate in practical applications. The key features of the proposed OPNN-T include the following: (1) A temporal feature module is employed to capture the dependencies in time series data, providing adaptability and flexibility in handling complex temporal patterns. (2) A polynomial neural network (PNN) is constructed using sub-datasets combined with three types of polynomial neurons, which enhances its nonlinear modeling capabilities across diverse scenarios. (3) A self-optimization mechanism is integrated into iteratively optimized sub-datasets, features, and polynomial types, resulting in significant improvements in the classification rate. The experimental results demonstrate that the proposed method achieves superior performances across multiple standard time series datasets, exhibiting higher classification accuracy and greater robustness than the existing classification models. Our research offers an effective solution for time series classification, and highlights the potential of polynomial neural networks in this field.
AB - Time series classification is a significant and complex issue in data mining, it is prevalent across various fields and holds substantial research value. However, enhancing the classification rate of time series data remains a formidable challenge. Traditional time series classification methods often face difficulties related to insufficient feature extraction or excessive model complexity. In this study, we propose a self-optimizing polynomial neural network with a temporal feature enhancement, which is referred to as OPNN-T. Existing classifiers based on polynomial neural networks (PNNs) struggle to achieve high-quality performances when dealing with time series data, primarily due to their inability to extract temporal information effectively. The goal of the proposed classifier is to enhance the nonlinear modeling capability for time series data, thereby improving the classification rate in practical applications. The key features of the proposed OPNN-T include the following: (1) A temporal feature module is employed to capture the dependencies in time series data, providing adaptability and flexibility in handling complex temporal patterns. (2) A polynomial neural network (PNN) is constructed using sub-datasets combined with three types of polynomial neurons, which enhances its nonlinear modeling capabilities across diverse scenarios. (3) A self-optimization mechanism is integrated into iteratively optimized sub-datasets, features, and polynomial types, resulting in significant improvements in the classification rate. The experimental results demonstrate that the proposed method achieves superior performances across multiple standard time series datasets, exhibiting higher classification accuracy and greater robustness than the existing classification models. Our research offers an effective solution for time series classification, and highlights the potential of polynomial neural networks in this field.
KW - classification rate
KW - least squares estimation (LSE)
KW - polynomial neural network (PNN)
KW - sub-dataset generation
KW - temporal feature extraction
UR - https://www.scopus.com/pages/publications/85217701563
U2 - 10.3390/electronics14030465
DO - 10.3390/electronics14030465
M3 - Article
AN - SCOPUS:85217701563
SN - 2079-9292
VL - 14
JO - Electronics (Switzerland)
JF - Electronics (Switzerland)
IS - 3
M1 - 465
ER -