This is a Demo Server. Data inside this system is only for test purpose.
 

Clustering Algorithm Based on Object Similarity

dc.authorscopusid57193080849
dc.authorscopusid59390279500
dc.authorscopusid57223099241
dc.authorscopusid58266007000
dc.authorscopusid59390584700
dc.contributor.authorNishanov, A.Kh.
dc.contributor.authorAkbarova, M.Kh.
dc.contributor.authorTursunov, A.T.
dc.contributor.authorOllamberganov, F.F.
dc.contributor.authorRashidova, D.E.
dc.contributor.otherDepartment of System and Applied Programming
dc.date.accessioned2024-12-16T16:27:55Z
dc.date.available2024-12-16T16:27:55Z
dc.date.issued2024
dc.departmentTashkent University of Information Technologiesen_US
dc.department-tempNishanov A.Kh., Tashkent University of Information Technologies named after Muhammad Al-Khwarizmi, Tashkent, Uzbekistan; Akbarova M.Kh., Tashkent University of Information Technologies named after Muhammad Al-Khwarizmi, Tashkent, Uzbekistan; Tursunov A.T., Tashkent Pharmaceutical Institute, Tashkent, Uzbekistan; Ollamberganov F.F., Tashkent University of Information Technologies named after Muhammad Al-Khwarizmi, Tashkent, Uzbekistan; Rashidova D.E., Samarkand Institute of Economics and Service, Samarkand, Uzbekistanen_US
dc.description.abstractThe article examines the issue of drug clustering. Initially, k classes are arbitrarily formed and the resulting training sample is pre-processed, then the similarities between the objects of each class are evaluated based on the proximity function and the criterion for evaluating the contribution of objects to the formation of their own class. Usually, it is in percentage and is the degree of mutual similarity of objects of each class. In the next steps of the algorithm, first, one object is taken from the first class, and by adding it to all k classes, the contribution of this object to this class is measured. The object will be left in the class which has the most contribution. This process is repeated several times in a row for all objects of the class. The process is stopped when the location of objects does not change and the degree of similarity exceeds the required percentage. As a result, the required clusters are formed. © 2024 Al-Farabi Kazakh National University.en_US
dc.identifier.citation0
dc.identifier.doi10.26577/JMMCS2024-v123-i3-4
dc.identifier.endpage120en_US
dc.identifier.issn1563-0277
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85207841224
dc.identifier.scopusqualityQ4
dc.identifier.startpage108en_US
dc.identifier.urihttps://doi.org/10.26577/JMMCS2024-v123-i3-4
dc.identifier.urihttps://tuit-demo.gcris.com/handle/123456789/84
dc.identifier.volume123en_US
dc.institutionauthorNishonov, Akhram
dc.language.isoenen_US
dc.publisheral-Farabi Kazakh State National Universityen_US
dc.relation.ispartofKazNU Bulletin. Mathematics, Mechanics, Computer Science Seriesen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectClusteringen_US
dc.subjectcontribution of object to the classen_US
dc.subjectdegree of similarity of objectsen_US
dc.subjectproximity functionen_US
dc.titleClustering Algorithm Based on Object Similarityen_US
dc.typeArticleen_US
dspace.entity.typePublication
relation.isAuthorOfPublicationae356381-5466-4bf4-9289-df6d0de463dd
relation.isAuthorOfPublication.latestForDiscoveryae356381-5466-4bf4-9289-df6d0de463dd
relation.isOrgUnitOfPublication8f1f6343-6e28-43b7-91b4-47494eccb586
relation.isOrgUnitOfPublication.latestForDiscovery8f1f6343-6e28-43b7-91b4-47494eccb586

Files

Collections