Joao Luis Baptista de Almeida, T. Sakata, Katti Faceli
{"title":"ASAClu:选择多样化和相关的集群","authors":"Joao Luis Baptista de Almeida, T. Sakata, Katti Faceli","doi":"10.1109/BRACIS.2016.091","DOIUrl":null,"url":null,"abstract":"No clustering algorithm is guaranteed to find actualgroups in any dataset. To deal with this problem, one can applyvarious clustering algorithms, generating a set of partitions andexplore them to find the most appropriated ones. The number ofpartitions and its component clusters may be too large, making itdifficult to the specialist analyze the final result. In this paper, weintroduce a new selection strategy namedASAClu, which is aimedat selecting a reduced set of clusters from a given collection ofpartitions generated by different clustering algorithms.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ASAClu: Selecting Diverse and Relevant Clusters\",\"authors\":\"Joao Luis Baptista de Almeida, T. Sakata, Katti Faceli\",\"doi\":\"10.1109/BRACIS.2016.091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"No clustering algorithm is guaranteed to find actualgroups in any dataset. To deal with this problem, one can applyvarious clustering algorithms, generating a set of partitions andexplore them to find the most appropriated ones. The number ofpartitions and its component clusters may be too large, making itdifficult to the specialist analyze the final result. In this paper, weintroduce a new selection strategy namedASAClu, which is aimedat selecting a reduced set of clusters from a given collection ofpartitions generated by different clustering algorithms.\",\"PeriodicalId\":183149,\"journal\":{\"name\":\"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BRACIS.2016.091\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2016.091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
No clustering algorithm is guaranteed to find actualgroups in any dataset. To deal with this problem, one can applyvarious clustering algorithms, generating a set of partitions andexplore them to find the most appropriated ones. The number ofpartitions and its component clusters may be too large, making itdifficult to the specialist analyze the final result. In this paper, weintroduce a new selection strategy namedASAClu, which is aimedat selecting a reduced set of clusters from a given collection ofpartitions generated by different clustering algorithms.