...
首页> 外文期刊>Analytica chimica acta >Building optimal regression tree by ant colony system-genetic algorithm: Application to modeling of melting points
【24h】

Building optimal regression tree by ant colony system-genetic algorithm: Application to modeling of melting points

机译:用蚁群系统遗传算法建立最优回归树:在熔点建模中的应用

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

摘要

The classification and regression trees (CART) possess the advantage of being able to handle large data sets and yield readily interpretable models. A conventional method of building a regression tree is recursive partitioning, which results in a good but not optimal tree. Ant colony system (ACS), which is a meta-heuristic algorithm and derived from the observation of real ants, can be used to overcome this problem. The purpose of this study was to explore the use of CART and its combination with ACS for modeling of melting points of a large variety of chemical compounds. Genetic algorithm (GA) operators (e.g., cross averring and mutation operators) were combined with ACS algorithm to select the best solution model. In addition, at each terminal node of the resulted tree, variable selection was done by ACS-GA algorithm to build an appropriate partial least squares (PLS) model. To test the ability of the resulted tree, a set of approximately 4173 structures and their melting points were used (3000 compounds as training set and 1173 as validation set). Further, an external test set containing of 277 drugs was used to validate the prediction ability of the tree. Comparison of the results obtained from both trees showed that the tree constructed by ACS-GA algorithm performs better than that produced by recursive partitioning procedure.
机译:分类树和回归树(CART)的优点是能够处理大量数据并生成易于解释的模型。构造回归树的常规方法是递归分区,这会产生好的但不是最优的树。蚁群系统(ACS)是一种元启发式算法,它是从对真实蚂蚁的观察中得出的,可以用来克服此问题。这项研究的目的是探索CART及其与ACS的结合用于建模多种化合物的熔点的方法。遗传算法(GA)运算符(例如交叉平均和变异运算符)与ACS算法结合在一起,以选择最佳的求解模型。另外,在结果树的每个终端节点,通过ACS-GA算法进行变量选择,以建立适当的偏最小二乘(PLS)模型。为了测试结果树的能力,使用了一组大约4173个结构及其熔点(3000种化合物作为训练集,1173种作为验证集)。此外,使用包含277种药物的外部测试集来验证树的预测能力。从两棵树得到的结果的比较表明,由ACS-GA算法构造的树比由递归分割程序产生的树表现更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号