Methods and measures similarities algorithm for finding a complex array

Zaleski, A.; Chertkov, V.

Please use this identifier to cite or link to this item: https://elib.psu.by/handle/123456789/36935

Full metadata record

DC Field	Value	Language
dc.contributor.author	Zaleski, A.	ru_RU
dc.contributor.author	Chertkov, V.	ru_RU
dc.date.accessioned	2023-01-09T08:35:25Z	-
dc.date.available	2023-01-09T08:35:25Z	-
dc.date.issued	2017
dc.identifier.citation	Zaleski, A. Methods and measures similarities algorithm for finding a complex array / A. Zaleski, V. Chertkov // European and National Dimension in Research = Европейский и национальный контексты в научных исследованиях : electronic collected materials of IX Junior Researchers' Conference, Novopolotsk, April 26-27, 2017 : in 3 parts / Ministry of Education of Belarus, Polotsk State University ; ed. Dr. Dzmitry Lazouski [et al.]. - Novopolotsk : PSU, 2017. - Part 3 : Technology. - P. 327-330.	ru_RU
dc.identifier.uri	https://elib.psu.by/handle/123456789/36935	-
dc.description.abstract	This work describes the basic methods and algorithms for determining the measure of similarity. We identified two promising methods for determining the similarity measure of polynomials, namely the function of the correlation coefficient and functions based on the Hausdorff metric. The analysis of the main measure distances (metrics) is represented.	ru_RU
dc.language.iso	en	ru_RU
dc.publisher	Полоцкий государственный университет	ru_RU
dc.title	Methods and measures similarities algorithm for finding a complex array	ru_RU
dc.type	Article	ru_RU
dc.citation.spage	327	ru_RU
dc.citation.epage	330	ru_RU
Appears in Collections:	European and National Dimension in Research. Technology. 2017

Files in This Item:

File	Size	Format
327-330.pdf	93.81 kB	Adobe PDF	View/Open

Show simple item record Recommend this item Google Scholar