使用元启发式优化分类器和聚类集成的组合

L. F. Coletta, Eduardo R. Hruschka, A. Acharya, Joydeep Ghosh
{"title":"使用元启发式优化分类器和聚类集成的组合","authors":"L. F. Coletta, Eduardo R. Hruschka, A. Acharya, Joydeep Ghosh","doi":"10.1109/BRICS-CCI-CBIC.2013.86","DOIUrl":null,"url":null,"abstract":"Unsupervised models can provide supplementary soft constraints to help classify new data since similar instances are more likely to share the same class label. In this context, we investigate how to make an existing algorithm, named C3E (from Combining Classifier and Cluster Ensembles), more user-friendly by automatically tunning its main parameters with the use of metaheuristics. In particular, the C3E algorithm is based on a general optimization framework that takes as input class membership estimates from existing classifiers, as well as a similarity matrix from a cluster ensemble operating solely on the new (target) data to be classified, and yields a consensus labeling of the new data. To do so, two parameters have to be defined a priori, namely: the relative importance of classifier and cluster ensembles and the number of iterations of the algorithm. In some practical applications, these parameters can be optimized via (time consuming) grid search approaches based on cross-validation procedures. This paper shows that metaheuristics can be more computationally efficient alternatives for optimizing such parameters. More precisely, analyses of statistical significance made from experiments performed on fourteen datasets show that five metaheuristics can yield classifiers as accurate as those obtained from grid search, but taking half the running time.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Towards the Use of Metaheuristics for Optimizing the Combination of Classifier and Cluster Ensembles\",\"authors\":\"L. F. Coletta, Eduardo R. Hruschka, A. Acharya, Joydeep Ghosh\",\"doi\":\"10.1109/BRICS-CCI-CBIC.2013.86\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unsupervised models can provide supplementary soft constraints to help classify new data since similar instances are more likely to share the same class label. In this context, we investigate how to make an existing algorithm, named C3E (from Combining Classifier and Cluster Ensembles), more user-friendly by automatically tunning its main parameters with the use of metaheuristics. In particular, the C3E algorithm is based on a general optimization framework that takes as input class membership estimates from existing classifiers, as well as a similarity matrix from a cluster ensemble operating solely on the new (target) data to be classified, and yields a consensus labeling of the new data. To do so, two parameters have to be defined a priori, namely: the relative importance of classifier and cluster ensembles and the number of iterations of the algorithm. In some practical applications, these parameters can be optimized via (time consuming) grid search approaches based on cross-validation procedures. This paper shows that metaheuristics can be more computationally efficient alternatives for optimizing such parameters. More precisely, analyses of statistical significance made from experiments performed on fourteen datasets show that five metaheuristics can yield classifiers as accurate as those obtained from grid search, but taking half the running time.\",\"PeriodicalId\":306195,\"journal\":{\"name\":\"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.86\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

无监督模型可以提供补充的软约束来帮助对新数据进行分类,因为类似的实例更有可能共享相同的类标签。在这种情况下,我们研究了如何通过使用元启发式自动调整其主要参数来使现有的算法C3E(来自组合分类器和群集集成)更加用户友好。特别是,C3E算法基于一个通用的优化框架,该框架将来自现有分类器的类隶属度估计以及来自仅对新(目标)数据进行分类的聚类集成的相似性矩阵作为输入,并产生新数据的一致标记。为此,必须先验地定义两个参数,即:分类器和聚类集合的相对重要性以及算法的迭代次数。在一些实际应用中,可以通过基于交叉验证过程的(耗时的)网格搜索方法来优化这些参数。本文表明,元启发式算法是优化此类参数的计算效率更高的替代方法。更准确地说,对14个数据集进行的实验的统计显著性分析表明,五种元启发式方法可以产生与网格搜索获得的分类器一样准确的分类器,但只需一半的运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards the Use of Metaheuristics for Optimizing the Combination of Classifier and Cluster Ensembles
Unsupervised models can provide supplementary soft constraints to help classify new data since similar instances are more likely to share the same class label. In this context, we investigate how to make an existing algorithm, named C3E (from Combining Classifier and Cluster Ensembles), more user-friendly by automatically tunning its main parameters with the use of metaheuristics. In particular, the C3E algorithm is based on a general optimization framework that takes as input class membership estimates from existing classifiers, as well as a similarity matrix from a cluster ensemble operating solely on the new (target) data to be classified, and yields a consensus labeling of the new data. To do so, two parameters have to be defined a priori, namely: the relative importance of classifier and cluster ensembles and the number of iterations of the algorithm. In some practical applications, these parameters can be optimized via (time consuming) grid search approaches based on cross-validation procedures. This paper shows that metaheuristics can be more computationally efficient alternatives for optimizing such parameters. More precisely, analyses of statistical significance made from experiments performed on fourteen datasets show that five metaheuristics can yield classifiers as accurate as those obtained from grid search, but taking half the running time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信