{"title":"基因表达数据的快速聚类算法","authors":"Liu Wei, Chen Ling, Qin Ling","doi":"10.1109/CCCM.2008.82","DOIUrl":null,"url":null,"abstract":"A biclustering algorithm for gene expressing data is presented. Based on the anti-monotones property of the quality of the data sets with their sizes, the algorithm can get the final biclusters by gradually adding columns and rows on the data sets. Experimental results show that our algorithm has higher processing speed and quality of clustering than other similar algorithms.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Fast Algorithm for Gene Expressing Data Biclustering\",\"authors\":\"Liu Wei, Chen Ling, Qin Ling\",\"doi\":\"10.1109/CCCM.2008.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A biclustering algorithm for gene expressing data is presented. Based on the anti-monotones property of the quality of the data sets with their sizes, the algorithm can get the final biclusters by gradually adding columns and rows on the data sets. Experimental results show that our algorithm has higher processing speed and quality of clustering than other similar algorithms.\",\"PeriodicalId\":326534,\"journal\":{\"name\":\"2008 ISECS International Colloquium on Computing, Communication, Control, and Management\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 ISECS International Colloquium on Computing, Communication, Control, and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCCM.2008.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCM.2008.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Fast Algorithm for Gene Expressing Data Biclustering
A biclustering algorithm for gene expressing data is presented. Based on the anti-monotones property of the quality of the data sets with their sizes, the algorithm can get the final biclusters by gradually adding columns and rows on the data sets. Experimental results show that our algorithm has higher processing speed and quality of clustering than other similar algorithms.