Please use this identifier to cite or link to this item: http://cris.utm.md/handle/5014/2056
DC FieldValueLanguage
dc.contributor.authorFRATAVCHAN, Valeriien_US
dc.contributor.authorFRATAVCHAN, Toniaen_US
dc.contributor.authorABABII, Victoren_US
dc.date.accessioned2023-11-29T16:45:17Z-
dc.date.available2023-11-29T16:45:17Z-
dc.date.issued2022-
dc.identifier.citationFRATAVCHAN, Valeriy, FRATAVCHAN, Tonia, ABABII, Victor. Pseudo Genetic Algorithm of Clustering For Linear and Ellipsoidal Clusters. In: Electronics, Communications and Computing, Ed. 12, 20-21 octombrie 2022, Chişinău. Chișinău: Tehnica-UTM, 2023, Editia 12, pp. 183-185. DOI: 10.52326/ic-ecco.2022/CS.07en_US
dc.identifier.urihttp://cris.utm.md/handle/5014/2056-
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 operations.en_US
dc.language.isoenen_US
dc.subjectClusteren_US
dc.subjectclusteringen_US
dc.subjectlinear clusteren_US
dc.subjectellipsoidal clusteren_US
dc.subjectgenetic algorithmen_US
dc.subjectMutationen_US
dc.subjectcrossoveren_US
dc.subjectdiscriminant functionen_US
dc.titlePseudo Genetic Algorithm of Clustering For Linear and Ellipsoidal Clustersen_US
dc.typeArticleen_US
dc.relation.conferenceElectronics, Communications and Computingen_US
dc.identifier.doi10.52326/ic-ecco.2022/CS.07-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.languageiso639-1other-
crisitem.author.deptDepartment of Computer Science and Systems Engineering-
crisitem.author.orcid0000-0002-0769-8144-
crisitem.author.parentorgFaculty of Computers, Informatics and Microelectronics-
Appears in Collections:Proceedings Papers
Files in This Item:
File Description SizeFormat
183-185_28.pdf171.53 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.