A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements

We analyze the mathematical aspects of the data analysis problem consisting in the search (selection) for a subset of similar elements in a group of objects. The problem arises, in particular, in connection with the analysis of data in the form of time series (discrete signals). One of the problems...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Pattern recognition and image analysis Jg. 28; H. 3; S. 363 - 370
Hauptverfasser:	Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I., Pyatkin, A. V., Shamardin, Yu. V., Shenmaier, V. V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.07.2018 Springer Nature B.V
Schlagworte:	Algorithms Approximation Computer Science Computer simulation Data analysis Euclidean geometry Euclidean space Image Processing and Computer Vision Mathematical analysis Mathematical Method in Pattern Recognition Mathematical models Pattern Recognition Polynomials Ratios Set theory Time series similar elements NP-hard problem Euclidean space quadratic scatter polynomial-time approximation algorithm longest subsequence time-series analysis
ISSN:	1054-6618, 1555-6212
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!