Adapting ELM to Time Series Classification: A Novel Diversified Top-k Shapelets Extraction Method
Qiuyan Yan, Qifa Sun, Xinming Yan

TL;DR
This paper introduces a novel diversified top-k shapelets extraction method integrated with ELM for improved time series classification, automatically determining the optimal number of shapelets to enhance accuracy and interpretability.
Contribution
It proposes a new diversified top-k shapelets extraction algorithm and integrates it with ELM, enabling automatic k selection and improved classification performance.
Findings
Significantly outperforms traditional ELM in accuracy.
Demonstrates improved efficiency in shapelet extraction.
Enhances interpretability of time series classification.
Abstract
ELM (Extreme Learning Machine) is a single hidden layer feed-forward network, where the weights between input and hidden layer are initialized randomly. ELM is efficient due to its utilization of the analytical approach to compute weights between hidden and output layer. However, ELM still fails to output the semantic classification outcome. To address such limitation, in this paper, we propose a diversified top-k shapelets transform framework, where the shapelets are the subsequences i.e., the best representative and interpretative features of each class. As we identified, the most challenge problems are how to extract the best k shapelets in original candidate sets and how to automatically determine the k value. Specifically, we first define the similar shapelets and diversified top-k shapelets to construct diversity shapelets graph. Then, a novel diversity graph based top-k shapelets…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and ELM · Data Stream Mining Techniques · Neural Networks and Applications
