Cancer Biomarker Assessment Using Evolutionary Rough Multi-Objective Optimization Algorithm

Anasua Sarkar, U. Maulik
{"title":"Cancer Biomarker Assessment Using Evolutionary Rough Multi-Objective Optimization Algorithm","authors":"Anasua Sarkar, U. Maulik","doi":"10.4018/978-1-4666-7258-1.CH016","DOIUrl":null,"url":null,"abstract":"A hybrid unsupervised learning algorithm, which is termed as Evolutionary Rough Multi-Objective Optimization (ERMOO) algorithm, is proposed in this chapter. It comprises a judicious integration of the principles of the rough sets theory with the archived multi-objective simulated annealing approach. While the concept of boundary approximations of rough sets in this implementation deals with the incompleteness in the dynamic classification method with the quality of classification coefficient as the classificatory competence measurement, it enables faster convergence of the Pareto-archived evolution strategy. It incorporates both the rough set-based dynamic archive classification method in this algorithm. A measure of the amount of domination between two solutions is incorporated in this chapter to determine the acceptance probability of a new solution with an improvement in the spread of the non-dominated solutions in the Pareto-front by adopting rough sets theory. The performance is demonstrated on real-life breast cancer dataset for identification of Cancer Associated Fibroblasts (CAFs) within the tumor stroma, and the identified biomarkers are reported. Moreover, biological significance tests are carried out for the obtained markers.","PeriodicalId":93084,"journal":{"name":"Biotechnology (Faisalabad, Pakistan)","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4018/978-1-4666-7258-1.CH016","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biotechnology (Faisalabad, Pakistan)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/978-1-4666-7258-1.CH016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A hybrid unsupervised learning algorithm, which is termed as Evolutionary Rough Multi-Objective Optimization (ERMOO) algorithm, is proposed in this chapter. It comprises a judicious integration of the principles of the rough sets theory with the archived multi-objective simulated annealing approach. While the concept of boundary approximations of rough sets in this implementation deals with the incompleteness in the dynamic classification method with the quality of classification coefficient as the classificatory competence measurement, it enables faster convergence of the Pareto-archived evolution strategy. It incorporates both the rough set-based dynamic archive classification method in this algorithm. A measure of the amount of domination between two solutions is incorporated in this chapter to determine the acceptance probability of a new solution with an improvement in the spread of the non-dominated solutions in the Pareto-front by adopting rough sets theory. The performance is demonstrated on real-life breast cancer dataset for identification of Cancer Associated Fibroblasts (CAFs) within the tumor stroma, and the identified biomarkers are reported. Moreover, biological significance tests are carried out for the obtained markers.
基于进化粗糙多目标优化算法的癌症生物标志物评估
本章提出了一种混合无监督学习算法——进化粗糙多目标优化算法(ERMOO)。它将粗糙集理论的原理与归档多目标模拟退火方法巧妙地结合起来。该实现采用粗糙集边界逼近的概念,解决了以分类系数质量作为分类能力度量的动态分类方法的不完备性问题,使pareto存档进化策略收敛速度更快。该算法结合了基于粗糙集的动态档案分类方法。本章引入了两个解之间的支配量度量,通过采用粗糙集理论来确定一个新解的接受概率,并改进了非支配解在帕累托前的传播。在真实的乳腺癌数据集上证明了该性能,用于鉴定肿瘤基质中的癌症相关成纤维细胞(CAFs),并报告了鉴定的生物标志物。此外,对获得的标记进行了生物学显著性检验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信