Abstract
AbstractTime-series clustering is a powerful data mining technique for time-series data in the absence of prior knowledge of the clusters. Here we propose a time-series clustering method that leverages an annealing machine, which accurately solves combinatorial optimization problems. The proposed method facilitates an even classification of time-series data into closely located clusters while maintaining robustness against outliers. We compared the proposed method with an existing standard method for clustering an online distributed dataset and found that both methods yielded comparable results. Furthermore, the proposed method was applied to a flow measurement image dataset containing noticeable noise with a signal-to-noise ratio of approximately unity. Despite a small signal variation of approximately 2%, the proposed method effectively classified the data without any overlaps among the clusters. In contrast, the clustering results of the existing methods exhibited overlapping clusters. These results indicate the effectiveness of the proposed method.
Funder
Tohoku University | Institute of Fluid Science, Tohoku University
Publisher
Springer Science and Business Media LLC
Reference51 articles.
1. Brockwell, P. J. & Davis, R. A. Time Series: Theory and Methods (Springer, New York, 1991).
2. Mitsa, T. Temporal Data Mining (Chapman & Hall/CRC, Boca Raton, 2010).
3. Kitagawa, G. Introduction to Time Series Modeling (CRC Press, Boca Raton, 2010).
4. Aggarwal, C. C. Data Mining: The Textbook (Springer, Cham, 2015).
5. Bishop, C. M. Pattern Recognition and Machine Learning (Information Science and Statistics) (Springer-Verlag New York, Inc., 2006).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献