2023/04/27 by Marcell T. Kurbucz, Kurbucz, Marcell T., Péter Pósfay +3
Computer Science · #60-04 #62H30 #62M10 #68T10 #Advanced Text Analysis Techniques #Artificial Intelligence (cs.AI) #Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences #G.3 #I.2.0 #I.5 #J.0 #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Mathematical Software (cs.MS) #Neural Networks and Applications #Time Series Analysis and Forecasting
paper · pdf · doi:10.48550/arxiv.2304.14211
openalex publication_date 2023/04/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
The goal of the linear law-based feature space transformation (LLT) algorithm is to assist with the classification of univariate and multivariate time series. The presented R package, called LLT, implements this algorithm in a flexible yet user-friendly way. This package first splits the instances into training and test sets. It then utilizes time-delay embedding and spectral decomposition techniques to identify the governing patterns (called linear laws) of each input sequence (initial feature) within the training set. Finally, it applies the linear laws of the training set to transform the initial features of the test set. These steps are performed by three separate functions called trainTest, trainLaw, and testTrans. Their application requires a predefined data structure; however, for fast calculation, they use only built-in functions. The LLT R package and a sample dataset with the appropriate data structure are publicly available on GitHub.