首页> 外文会议>International Conference on Machine Learning, Optimization, and Data Science >Ant Colony Optimization for Markov Blanket-Based Feature Selection. Application for Precision Medicine
【24h】

Ant Colony Optimization for Markov Blanket-Based Feature Selection. Application for Precision Medicine

机译:基于Markov毯的特征选择的蚁群优化。精密药物的应用

获取原文

摘要

In this work, we address feature subset selection in the case when the variables exert a null or weak marginal effect on the target variable, a situation called "pure" epistasis hereafter. We explore the Markov blanket approach, to tackle epistasis detection, and we introduce SMMB-ACO. This method combines Markov blanket learning with stochastic and ensemble features and guides the stochastic sampling process by incorporating ant colony optimization. We first analyze the impact of parameter adjustment on SMMB-ACO complexity. Then using simulated and real data, we compare SMMB-ACO with four other methods, including its former version SMMB. We show that SMMB-ACO compares well with three state-of-the-art methods and that SMMB-ACO is more stable than SMMB. On the real dataset, the detection ability of SMMB-ACO is close to that of the best approach, which is a slow method, and SMMB-ACO is the fastest algorithm behind a much less performing method.
机译:在这项工作中,我们在变量对目标变量发出空缺或弱边际效果时,我们解决了特征子集选择的情况下,下文称为“纯粹”的外观。我们探索马尔可夫毯子方法,以解决简历检测,我们介绍SMMB-ACO。该方法将马尔可夫毯子学习与随机和集合特征相结合,并通过结合蚁群优化引导随机采样过程。我们首先分析参数调整对SMMB-ACO复杂性的影响。然后使用模拟和实际数据,我们将SMMB-ACO与其他四种方法进行比较,包括其前版本SMB。我们表明SMMB-ACO与三种最先进的方法相比,SMMB-ACO比SMMB更稳定。在实际数据集上,SMMB-ACO的检测能力接近最佳方法,这是一种慢的方法,SMMB-ACO是最快的算法,后面的执行方法更少。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号