首页> 外文期刊>Analytica chimica acta >On Pareto-optimal fronts for deciding about sensitivity and specificity in class-modelling problems
【24h】

On Pareto-optimal fronts for deciding about sensitivity and specificity in class-modelling problems

机译:关于决定类建模问题的敏感性和特异性的帕累托最优阵线

获取原文
获取原文并翻译 | 示例
           

摘要

Sensitivity and specificity are two widely accepted parameters to qualify a model when working in class-modelling problems. Further, the trade-off between these two parameters is well known. In the present work the problem of building models taking into account both sensitivity and specificity is posed in its real nature, as a multi-objective optimisation problem because we have two, in general, conflicting objectives.To do this, a new training algorithm for neural networks has been programmed that allows the user to find a set of Pareto-optimal solutions, i.e., different models with different values for sensitivity and specificity in such a way that the user may decide among models depending on the goal of the study being done.The procedure is applied to some real data sets to see its versatility and help to understand and interpret the resulting models. (c) 2005 Elsevier B.V. All rights reserved.
机译:在处理类建模问题时,灵敏度和特异性是使模型合格的两个广泛接受的参数。此外,这两个参数之间的折衷是众所周知的。在当前工作中,考虑到敏感性和特异性的模型构建问题实际上是一个多目标优化问题,因为我们通常有两个相互冲突的目标,为此,提出了一种新的训练算法已经对神经网络进行了编程,该神经网络允许用户找到一组帕累托最优解,即具有不同敏感性和特异性值的不同模型,从而使用户可以根据要完成的研究目标在模型之间做出选择该过程应用于一些实际数据集,以查看其多功能性,并有助于理解和解释所产生的模型。 (c)2005 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号