Pseudo genetic algorithm of clustering for linear and ellipsoidal clusters
Close
Articolul precedent
Articolul urmator
188 0
SM ISO690:2012
FRATAVCHAN, Valeriy, FRATAVCHAN, Tonia, ABABII, Victor. Pseudo genetic algorithm of clustering for linear and ellipsoidal clusters. In: Electronics, Communications and Computing: IC ECCO 2022, Ed. 12, 20-21 octombrie 2022, Chişinău. Chișinău: Tehnica-UTM, 2023, Editia 12, pp. 82-82a.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Electronics, Communications and Computing
Editia 12, 2023
Conferința "Electronics, Communications and Computing"
12, Chişinău, Moldova, 20-21 octombrie 2022

Pseudo genetic algorithm of clustering for linear and ellipsoidal clusters


Pag. 82-82a

Fratavchan Valeriy1, Fratavchan Tonia1, Ababii Victor2
 
1 Yuriy Fedkovych National University of Chernivtsi,
2 Technical University of Moldova
 
 
Disponibil în IBN: 4 aprilie 2023


Rezumat

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.