Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/20623
Pоljе DC-а | Vrеdnоst | Јеzik |
---|---|---|
dc.contributor.author | Geler Zoltan | - |
dc.contributor.author | Kurbalija Vladimir | - |
dc.contributor.author | Ivanović Mirjana | - |
dc.contributor.author | Radovanović Miloš | - |
dc.date.accessioned | 2020-12-13T14:54:54Z | - |
dc.date.available | 2020-12-13T14:54:54Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/20623 | - |
dc.description.abstract | © 2020 Elsevier Ltd Time-series classification has been addressed by a plethora of machine-learning techniques, including neural networks, support vector machines, Bayesian approaches, and others. It is an accepted fact, however, that the plain vanilla 1-nearest neighbor (1NN) classifier, combined with an elastic distance measure such as Dynamic Time Warping (DTW), is competitive and often superior to more complex classification methods, including the majority-voting k-nearest neighbor (kNN) classifier. With this paper we continue our investigation of the kNN classifier on time-series data and the impact of various classic distance-based vote weighting schemes by considering constrained versions of four common elastic distance measures: DTW, Longest Common Subsequence (LCS), Edit Distance with Real Penalty (ERP), and Edit Distance on Real sequence (EDR). By performing experiments on the entire UCR Time Series Classification Archive we show that weighted kNN is able to consistently outperform 1NN. Furthermore, we provide recommendations for the choices of the constraint width parameter r, neighborhood size k, and weighting scheme, for each mentioned elastic distance measure. | en |
dc.language.iso | en | - |
dc.relation.ispartof | Expert Systems with Applications | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.title | Weighted kNN and constrained elastic distances for time-series classification | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1016/j.eswa.2020.113829 | - |
dc.identifier.scopus | 85089827488 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=115892&source=BEOPEN&language=en | en |
dc.relation.volume | 162 | - |
dc.identifier.externalcrisreference | (BISIS)115892 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Odsek za medijske studije | - |
crisitem.author.dept | Departman za matematiku i informatiku | - |
crisitem.author.dept | Departman za matematiku i informatiku | - |
crisitem.author.dept | Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-9599-4495 | - |
crisitem.author.orcid | 0000-0003-1946-0384 | - |
crisitem.author.orcid | 0000-0003-2225-7803 | - |
crisitem.author.parentorg | Filozofski fakultet | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Nаlаzi sе u kоlеkciјаmа: | FF Publikacije/Publications PMF Publikacije/Publications |
SCOPUSTM
Nаvоđеnjа
43
prоvеrеnо 03.05.2024.
Prеglеd/i stаnicа
28
Prоtеklа nеdеljа
2
2
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.