Ida Bifulco, Carmine Fedullo, F. Napolitano, G. Raiconi, R. Tagliaferri
{"title":"通过全局优化、元聚类和共识方法发现多个数据结构","authors":"Ida Bifulco, Carmine Fedullo, F. Napolitano, G. Raiconi, R. Tagliaferri","doi":"10.1504/IJKESDP.2009.028984","DOIUrl":null,"url":null,"abstract":"When dealing with real data, clustering becomes a very complex problem, usually admitting many reasonable solutions. Moreover, even if completely different, such solutions can appear almost equivalent from the point of view of classical quality measures such as the distortion value. This implies that blind optimisation techniques alone are prone to discard qualitatively interesting solutions. In this work we propose a systematic approach to clustering, including the generation of a number of good solutions through global optimisation, the analysis of such solutions through meta clustering and the final construction of a small set of solutions through consensus clustering.","PeriodicalId":347123,"journal":{"name":"Int. J. Knowl. Eng. Soft Data Paradigms","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multiple data structure discovery through global optimisation, meta clustering and consensus methods\",\"authors\":\"Ida Bifulco, Carmine Fedullo, F. Napolitano, G. Raiconi, R. Tagliaferri\",\"doi\":\"10.1504/IJKESDP.2009.028984\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When dealing with real data, clustering becomes a very complex problem, usually admitting many reasonable solutions. Moreover, even if completely different, such solutions can appear almost equivalent from the point of view of classical quality measures such as the distortion value. This implies that blind optimisation techniques alone are prone to discard qualitatively interesting solutions. In this work we propose a systematic approach to clustering, including the generation of a number of good solutions through global optimisation, the analysis of such solutions through meta clustering and the final construction of a small set of solutions through consensus clustering.\",\"PeriodicalId\":347123,\"journal\":{\"name\":\"Int. J. Knowl. Eng. Soft Data Paradigms\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Knowl. Eng. Soft Data Paradigms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJKESDP.2009.028984\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Knowl. Eng. Soft Data Paradigms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJKESDP.2009.028984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiple data structure discovery through global optimisation, meta clustering and consensus methods
When dealing with real data, clustering becomes a very complex problem, usually admitting many reasonable solutions. Moreover, even if completely different, such solutions can appear almost equivalent from the point of view of classical quality measures such as the distortion value. This implies that blind optimisation techniques alone are prone to discard qualitatively interesting solutions. In this work we propose a systematic approach to clustering, including the generation of a number of good solutions through global optimisation, the analysis of such solutions through meta clustering and the final construction of a small set of solutions through consensus clustering.