Pseudo Genetic Algorithm of Clustering For Linear and Ellipsoidal Clusters

dc.contributor.author	Fratavchan, Valerіi
dc.contributor.author	Fratavchan, Tonia
dc.contributor.author	Ababii, Victor
dc.date.accessioned	2022-11-04T12:10:44Z
dc.date.available	2022-11-04T12:10:44Z
dc.date.issued	2022-10
dc.identifier.uri	https://archer.chnu.edu.ua/xmlui/handle/123456789/4942
dc.description.abstract	this article considers the method of clustering in the problems of pattern recognition when studying with a teacher in the case of n-dimensional numerical features. Clusters of linear and ellipsoidal forms that are optimal in the number of errors are created by the method of pseudo genetic algorithm. The pseudo genetic algorithm has a simplified procedure for performing mutation and crossover operations	uk_UA
dc.relation.ispartofseries	The 12th International Conference on Electronics, Communications and Computing. – 20-21 October, 2022, Chisinau, Republic of Moldova;
dc.subject	cluster, clustering, linear cluster, ellipsoidal cluster, genetic algorithm, mutation, crossover, discriminant function.	uk_UA
dc.title	Pseudo Genetic Algorithm of Clustering For Linear and Ellipsoidal Clusters	uk_UA
dc.type	Article	uk_UA

Related items