{"title":"y -短串联重复序列(Y-STR)数据聚类的硬、软更新质心","authors":"Ali Seman, Z. Bakar, Noorizam Daud","doi":"10.1109/ICOS.2010.5720055","DOIUrl":null,"url":null,"abstract":"This paper compares hard and soft updating centroids for clustering Y-STR data. The hard centroids represented by New Fuzzy k-Modes clustering algorithm, whereas the soft centroids represented through k-Population algorithm. These two algorithms are experimented through two datasets, Y-STR haplogroups and Y-STR Surnames. The results show that the soft centroid performance is better than the hard centroid for Y-STR data. The soft centroid produces 86.3% of the average clustering accuracy as compared 84.3% of the new fuzzy k-Modes algorithm. However, the overall result shows that the hard updating clustering is better than the soft updating clustering while clustering Y-STR data.","PeriodicalId":262432,"journal":{"name":"2010 IEEE Conference on Open Systems (ICOS 2010)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Hard and soft updating centroids for clustering Y-short tandem repeats (Y-STR) data\",\"authors\":\"Ali Seman, Z. Bakar, Noorizam Daud\",\"doi\":\"10.1109/ICOS.2010.5720055\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper compares hard and soft updating centroids for clustering Y-STR data. The hard centroids represented by New Fuzzy k-Modes clustering algorithm, whereas the soft centroids represented through k-Population algorithm. These two algorithms are experimented through two datasets, Y-STR haplogroups and Y-STR Surnames. The results show that the soft centroid performance is better than the hard centroid for Y-STR data. The soft centroid produces 86.3% of the average clustering accuracy as compared 84.3% of the new fuzzy k-Modes algorithm. However, the overall result shows that the hard updating clustering is better than the soft updating clustering while clustering Y-STR data.\",\"PeriodicalId\":262432,\"journal\":{\"name\":\"2010 IEEE Conference on Open Systems (ICOS 2010)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Conference on Open Systems (ICOS 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOS.2010.5720055\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Conference on Open Systems (ICOS 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOS.2010.5720055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hard and soft updating centroids for clustering Y-short tandem repeats (Y-STR) data
This paper compares hard and soft updating centroids for clustering Y-STR data. The hard centroids represented by New Fuzzy k-Modes clustering algorithm, whereas the soft centroids represented through k-Population algorithm. These two algorithms are experimented through two datasets, Y-STR haplogroups and Y-STR Surnames. The results show that the soft centroid performance is better than the hard centroid for Y-STR data. The soft centroid produces 86.3% of the average clustering accuracy as compared 84.3% of the new fuzzy k-Modes algorithm. However, the overall result shows that the hard updating clustering is better than the soft updating clustering while clustering Y-STR data.