{"id":567,"date":"2024-01-12T01:39:36","date_gmt":"2024-01-12T00:39:36","guid":{"rendered":"https:\/\/drizzt.home.amu.edu.pl\/?page_id=567"},"modified":"2024-01-12T02:25:18","modified_gmt":"2024-01-12T01:25:18","slug":"lista-publikacji","status":"publish","type":"page","link":"http:\/\/drizzt.home.amu.edu.pl\/?page_id=567","title":{"rendered":"Lista publikacji"},"content":{"rendered":"
<\/a><\/form>

2024<\/h3>
8.<\/div>

G\u00f3recki, Tomasz; andPawe\u0142 Piasecki, Maciej \u0141uczak<\/p>

An exhaustive comparison of distance measures in the classification of time series with 1NN method<\/a> Journal Article<\/span> <\/p>

In: <\/span>Journal of Computational Science, <\/span>vol. 76, <\/span>pp. 102235, <\/span>2024<\/span>, ISSN: 1877-7503<\/span>.<\/p>

Abstract<\/a><\/span> | Links<\/a><\/span> | BibTeX<\/a><\/span><\/p>

@article{G\u00f3recki2024,
\r\ntitle = {An exhaustive comparison of distance measures in the classification of time series with 1NN method},
\r\nauthor = {Tomasz G\u00f3recki and Maciej \u0141uczak andPawe\u0142 Piasecki},
\r\ndoi = {10.1016\/j.jocs.2024.102235},
\r\nissn = {1877-7503},
\r\nyear  = {2024},
\r\ndate = {2024-02-10},
\r\nurldate = {2024-02-10},
\r\njournal = {Journal of Computational Science},
\r\nvolume = {76},
\r\npages = {102235},
\r\nabstract = {Time series classification is an important and challenging problem in data analysis. With the increase in time series data availability, hundreds of algorithms have been proposed. A huge effort over the past two decades caused a significant improvement in both the efficiency and effectiveness of time series classification. There is a belief in the community that the best method is a surprisingly simple one. Even though there exist many algorithms outperforming the nearest neighbor (NN) classifier, the popularity of the latter remains stable \u2014 due to its simplicity and high performance in many domains, especially with dynamic time warping (DTW) as the distance measure. In the paper, we present an exhaustive study in which we compare the performance of different similarity measures relying on the 1NN classifier. We used the most highly cited time series distance measures used in classification (in total we compared 56 distance measures). We evaluate methods on all datasets from the UCR Time Series Classification Archive. Additionally, we perform extensive statistical comparison of the examined methods. We show that none of the distance measures is the best for all datasets, however, there is a group performing statistically significantly better than the others},
\r\nkeywords = {},
\r\npubstate = {published},
\r\ntppubtype = {article}
\r\n}
\r\n<\/pre><\/div>
Close<\/a><\/p><\/div>
Time series classification is an important and challenging problem in data analysis. With the increase in time series data availability, hundreds of algorithms have been proposed. A huge effort over the past two decades caused a significant improvement in both the efficiency and effectiveness of time series classification. There is a belief in the community that the best method is a surprisingly simple one. Even though there exist many algorithms outperforming the nearest neighbor (NN) classifier, the popularity of the latter remains stable \u2014 due to its simplicity and high performance in many domains, especially with dynamic time warping (DTW) as the distance measure. In the paper, we present an exhaustive study in which we compare the performance of different similarity measures relying on the 1NN classifier. We used the most highly cited time series distance measures used in classification (in total we compared 56 distance measures). We evaluate methods on all datasets from the UCR Time Series Classification Archive. Additionally, we perform extensive statistical comparison of the examined methods. We show that none of the distance measures is the best for all datasets, however, there is a group performing statistically significantly better than the others<\/div>
Close<\/a><\/p><\/div>