TSC-AutoML: Meta-learning for Automatic Time Series Classification Algorithm Selection
Tianyu Mu, Hongzhi Wang, Shenghe Zheng, Zhiyu Liang, Chunnan Wang, Xinyue Shao, Zheng Liang
Abstract
With years of development, a significant number of Time Series Classification (TSC) algorithms have been proposed and applied to various fields such as scientific research and industry scenarios, including traditional statistical methods, machine learning methods, and recently deep learning models. However, choosing a suitable model along with good parameter values that perform well on a given task, which is also known as Combined Algorithm Selection and Hyperparameter optimization problem (CASH), is still challenging. How to automatically select the appropriate algorithm according to the task during analyzing is a topic worthy of further research. Nevertheless, for TSC, a field that has been developed for decades, there is no effective and efficient approach for automatic algorithm selection. To the best of our knowledge, the current approach is based on genetic search, which is very computationally intensive and time-consuming. Therefore, in this paper, we propose TSC-AutoML, a zero-configuration and meta-learning-based approach for the automatic Time Series Classification algorithm CASH (also known as TSC-CASH). TSC-AutoML extracts knowledge from historical tasks and performs automatic feature selection and knowledge filtering with a reinforcement learning policy. The experience extracted is filtered and transformed into metadata. The meta-learner trained on the metadata together with our proposed warm start strategy will select an optimal algorithm for tasks uploaded by users, and then our proposed Hyperparameter Optimization method based on the Fast Warm Start strategy searches for hyperparameter combinations of the selected algorithm and adjusts parameter configuration to achieve top performance. The entire process is pre-trained, automated for the new task, and parameter-free for the user to decide, making it easy for users with the little domain experience to get started easily. Experimental results illustrate that TSC-AutoML outperforms existing methods in terms of both time and accuracy of optimum algorithm selection.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 48272006-5c2b-4859-9a82-b82dd86bbed2Related papers
- Auto-TSF: Towards Proxy-Model-Based Meta-Learning for Automatic Time Series Forecasting Algorithm SelectionTianyu Mu, Hongzhi Wang, Chen Liang, Xinyue ShaoICDE 2025 · 1 citation
- Meta-Learning Based CTR Algorithm Selection and Hyperparameter OptimizationChunnan Wang, Junzhe Wang, Xiang Chen, Xintong Song et al.ICDE 2025
- Efficient Automatic CASH via Rising BanditsYang Li, Jiawei Jiang, Jinyang Gao, Yingxia Shao et al.AAAI 2020 · 45 citations
- ML2DAC: Meta-Learning to Democratize AutoML for Clustering AnalysisDennis Treder-Tschechlov, Manuel Fritz, Holger Schwarz, Bernhard MitschangSIGMOD 2023 · 8 citations
- Neural Architecture and Hyperparameter Selection Through Meta-Learning on Time SeriesErfan Moeini, Christopher Vox, Marie Anastacio, Wadie Skaf et al.AAAI 2026 · 1 citation
