Clustering Algorithm Based on Object Similarity
| dc.authorscopusid | 57193080849 | |
| dc.authorscopusid | 59390279500 | |
| dc.authorscopusid | 57223099241 | |
| dc.authorscopusid | 58266007000 | |
| dc.authorscopusid | 59390584700 | |
| dc.contributor.author | Nishanov, A.Kh. | |
| dc.contributor.author | Akbarova, M.Kh. | |
| dc.contributor.author | Tursunov, A.T. | |
| dc.contributor.author | Ollamberganov, F.F. | |
| dc.contributor.author | Rashidova, D.E. | |
| dc.contributor.other | Department of System and Applied Programming | |
| dc.date.accessioned | 2024-12-16T16:27:55Z | |
| dc.date.available | 2024-12-16T16:27:55Z | |
| dc.date.issued | 2024 | |
| dc.department | Tashkent University of Information Technologies | en_US |
| dc.department-temp | Nishanov 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, Uzbekistan | en_US |
| dc.description.abstract | The 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.citation | 0 | |
| dc.identifier.doi | 10.26577/JMMCS2024-v123-i3-4 | |
| dc.identifier.endpage | 120 | en_US |
| dc.identifier.issn | 1563-0277 | |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.scopus | 2-s2.0-85207841224 | |
| dc.identifier.scopusquality | Q4 | |
| dc.identifier.startpage | 108 | en_US |
| dc.identifier.uri | https://doi.org/10.26577/JMMCS2024-v123-i3-4 | |
| dc.identifier.uri | https://tuit-demo.gcris.com/handle/123456789/84 | |
| dc.identifier.volume | 123 | en_US |
| dc.institutionauthor | Nishonov, Akhram | |
| dc.language.iso | en | en_US |
| dc.publisher | al-Farabi Kazakh State National University | en_US |
| dc.relation.ispartof | KazNU Bulletin. Mathematics, Mechanics, Computer Science Series | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Clustering | en_US |
| dc.subject | contribution of object to the class | en_US |
| dc.subject | degree of similarity of objects | en_US |
| dc.subject | proximity function | en_US |
| dc.title | Clustering Algorithm Based on Object Similarity | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | ae356381-5466-4bf4-9289-df6d0de463dd | |
| relation.isAuthorOfPublication.latestForDiscovery | ae356381-5466-4bf4-9289-df6d0de463dd | |
| relation.isOrgUnitOfPublication | 8f1f6343-6e28-43b7-91b4-47494eccb586 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 8f1f6343-6e28-43b7-91b4-47494eccb586 |