Pseudo Genetic Algorithm of Clustering For Linear and Ellipsoidal Clusters

dc.contributor.authorFratavchan, Valerіi
dc.contributor.authorFratavchan, Tonia
dc.contributor.authorAbabii, Victor
dc.date.accessioned2022-11-04T12:10:44Z
dc.date.available2022-11-04T12:10:44Z
dc.date.issued2022-10
dc.description.abstractthis 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 operationsuk_UA
dc.identifier.urihttps://archer.chnu.edu.ua/xmlui/handle/123456789/4942
dc.relation.ispartofseriesThe 12th International Conference on Electronics, Communications and Computing. – 20-21 October, 2022, Chisinau, Republic of Moldova;
dc.subjectcluster, clustering, linear cluster, ellipsoidal cluster, genetic algorithm, mutation, crossover, discriminant function.uk_UA
dc.titlePseudo Genetic Algorithm of Clustering For Linear and Ellipsoidal Clustersuk_UA
dc.typeArticleuk_UA

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ECСO-2022 Fratavchan. Eng.pdf
Size:
221.73 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.8 KB
Format:
Item-specific license agreed upon to submission
Description: