进化计算(EC)/自适应增强(AB)混合算法与支持向量机乳腺癌分类范式的性能权衡

W. Land, M. Bryden, J. Lo, Daniel W. McKee, F. R. Anderson
{"title":"进化计算(EC)/自适应增强(AB)混合算法与支持向量机乳腺癌分类范式的性能权衡","authors":"W. Land, M. Bryden, J. Lo, Daniel W. McKee, F. R. Anderson","doi":"10.1109/CEC.2002.1006231","DOIUrl":null,"url":null,"abstract":"This paper describes a breast cancer classification performance trade-off analysis using two computational intelligence paradigms. The first, an evolutionary programming (EP)/adaptive boosting (AB) based hybrid, intelligently combines the outputs from an iteratively \"called\" weak learning algorithm (one which performs at least slightly better than random guessing) in order to \"boost\" the performance of an EP-derived weak learner. The second paradigm is support vector machines (SVMs). SVMs are new and radically different types of classifiers and learning machines that use a hypothesis space of linear functions in a high dimensional feature space. The most important advantage of a SVM, unlike neural networks, is that SVM training always finds a global minimum. Furthermore, the SVM has inherent ability to solve pattern classification without incorporating any problem-domain knowledge. In this study, the both the EP/AB hybrid and SVM were employed as pattern classifiers, operating on mammography data used for breast cancer detection. The main focus of the study was to construct and seek the best EP/AB hybrid and SVM configurations for optimum specificity and positive predictive value at very high sensitivities. Using a mammogram database of 500 biopsy-proven samples, the best performing SVM, on average, was able to achieve (under statistical 5-fold cross-validation) a specificity of 45.0% and a positive predictive value (PPV) of 50.1% at 100% sensitivity. At 97% sensitivity, a specificity of 55.8% and a PPV of 55.2% were obtained. The best performing EP/AB hybrid obtained slightly lower, but comparable, results.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Performance tradeoff between evolutionary computation (EC)/adaptive boosting (AB) hybrid and support vector machine breast cancer classification paradigms\",\"authors\":\"W. Land, M. Bryden, J. Lo, Daniel W. McKee, F. R. Anderson\",\"doi\":\"10.1109/CEC.2002.1006231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a breast cancer classification performance trade-off analysis using two computational intelligence paradigms. The first, an evolutionary programming (EP)/adaptive boosting (AB) based hybrid, intelligently combines the outputs from an iteratively \\\"called\\\" weak learning algorithm (one which performs at least slightly better than random guessing) in order to \\\"boost\\\" the performance of an EP-derived weak learner. The second paradigm is support vector machines (SVMs). SVMs are new and radically different types of classifiers and learning machines that use a hypothesis space of linear functions in a high dimensional feature space. The most important advantage of a SVM, unlike neural networks, is that SVM training always finds a global minimum. Furthermore, the SVM has inherent ability to solve pattern classification without incorporating any problem-domain knowledge. In this study, the both the EP/AB hybrid and SVM were employed as pattern classifiers, operating on mammography data used for breast cancer detection. The main focus of the study was to construct and seek the best EP/AB hybrid and SVM configurations for optimum specificity and positive predictive value at very high sensitivities. Using a mammogram database of 500 biopsy-proven samples, the best performing SVM, on average, was able to achieve (under statistical 5-fold cross-validation) a specificity of 45.0% and a positive predictive value (PPV) of 50.1% at 100% sensitivity. At 97% sensitivity, a specificity of 55.8% and a PPV of 55.2% were obtained. The best performing EP/AB hybrid obtained slightly lower, but comparable, results.\",\"PeriodicalId\":184547,\"journal\":{\"name\":\"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2002.1006231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2002.1006231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文描述了一种使用两种计算智能范式的乳腺癌分类性能权衡分析。第一个是基于进化规划(EP)/自适应增强(AB)的混合,智能地结合了迭代“称为”弱学习算法(至少比随机猜测稍好)的输出,以“提高”源自EP的弱学习器的性能。第二个范例是支持向量机(svm)。支持向量机是一种全新的、完全不同的分类器和学习机,它在高维特征空间中使用线性函数的假设空间。与神经网络不同,支持向量机最重要的优点是支持向量机训练总能找到一个全局最小值。此外,支持向量机在不包含任何问题域知识的情况下具有解决模式分类的固有能力。本研究采用EP/AB hybrid和SVM作为模式分类器,对用于乳腺癌检测的乳房x线摄影数据进行操作。本研究的主要重点是构建和寻求最佳的EP/AB混合和SVM配置,以获得最佳的特异性和高灵敏度的阳性预测值。使用包含500个活检样本的乳房x线照片数据库,表现最好的支持向量机平均能够实现(在统计5倍交叉验证下)特异性为45.0%,阳性预测值(PPV)为50.1%,灵敏度为100%。灵敏度为97%,特异性为55.8%,PPV为55.2%。表现最好的EP/AB杂交种获得的结果略低,但可比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance tradeoff between evolutionary computation (EC)/adaptive boosting (AB) hybrid and support vector machine breast cancer classification paradigms
This paper describes a breast cancer classification performance trade-off analysis using two computational intelligence paradigms. The first, an evolutionary programming (EP)/adaptive boosting (AB) based hybrid, intelligently combines the outputs from an iteratively "called" weak learning algorithm (one which performs at least slightly better than random guessing) in order to "boost" the performance of an EP-derived weak learner. The second paradigm is support vector machines (SVMs). SVMs are new and radically different types of classifiers and learning machines that use a hypothesis space of linear functions in a high dimensional feature space. The most important advantage of a SVM, unlike neural networks, is that SVM training always finds a global minimum. Furthermore, the SVM has inherent ability to solve pattern classification without incorporating any problem-domain knowledge. In this study, the both the EP/AB hybrid and SVM were employed as pattern classifiers, operating on mammography data used for breast cancer detection. The main focus of the study was to construct and seek the best EP/AB hybrid and SVM configurations for optimum specificity and positive predictive value at very high sensitivities. Using a mammogram database of 500 biopsy-proven samples, the best performing SVM, on average, was able to achieve (under statistical 5-fold cross-validation) a specificity of 45.0% and a positive predictive value (PPV) of 50.1% at 100% sensitivity. At 97% sensitivity, a specificity of 55.8% and a PPV of 55.2% were obtained. The best performing EP/AB hybrid obtained slightly lower, but comparable, results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信