.png){kind=icon}
Return
MIHT: A Hoeffding Tree for Time Series Classification Using Multiple Instance Learning
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-10486-1_16.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the prevalence of temporal data and its inherent dependencies in many real-world problems, time series classification is of paramount importance in various domains. However, existing models often struggle with series of variable length or high dimensionality. This paper introduces the MIHT (Multi-instance Hoeffding Tree) algorithm, an efficient model that uses multi-instance learning to classify multivariate and variable-length time series while providing interpretable results. The algorithm uses a novel representation of time series as bags of subseries, together with an optimization process based on incremental decision trees that distinguish relevant parts of the series from noise. This methodology extracts the underlying concept of series with multiple variables and variable lengths. The generated decision tree is a compact, white-box representation of the series' concept, providing interpretability insights into the most relevant variables and segments of the series. Experimental results demonstrate MIHT's superiority, as it outperforms 11 state-of-the-art time series classification models on 28 public datasets, including high-dimensional ones. MIHT offers enhanced accuracy and interpretability, making it a promising solution for handling complex, dynamic time series data.
Keywords:
Time-series classification
Multi-instance learning
Interpretability
Journal
I
IF:
0
Papers:
50
Citations:
0
Organization
Cited Papers
ShareSaveMining high-speed data streams.png)
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
OAAI
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data miningIF0
OAAIShareSaveShareSaveShareSave
View more