...
首页> 外文期刊>Neurocomputing >A comparative study of six model complexity metrics to search for parsimonious models with GAparsimony R Package
【24h】

A comparative study of six model complexity metrics to search for parsimonious models with GAparsimony R Package

机译:六种模型复杂度指标的比较研究,以便在Gaparsimony R包装中搜索典范模型

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

摘要

Nowadays, interest is growing in automating KDD processes. Thanks to the increasing power and decreasing costs of computation devices, the search for the best features and model parameters can be conducted with different meta-heuristics. Thus, researchers can focus on other important tasks like data wrangling or feature engineering. This article details a comparative study of a GAparsimony R Package with six model complexity metrics. The objective was to identify an adequate model complexity measure for searching for accurate parsimonious solutions by combining feature selection, hyperparameter optimization, and parsimonious evaluation. This study also includes a regression code example to address some recommended precautions and considerations to find robust parsimonious models. This code can be easily adapted to other problems, databases, or algorithms.(c) 2020 Elsevier B.V. All rights reserved.
机译:如今,兴趣在自动化KDD流程中越来越大。 由于电力增加和计算设备的成本降低,可以使用不同的元启发式来进行最佳特征和模型参数的搜索。 因此,研究人员可以专注于数据绞刑或特征工程等其他重要任务。 本文详细介绍了具有六种模型复杂度指标的Gaparsimony R包的比较研究。 目的是通过组合特征选择,封路计优化和解析评估来确定用于搜索准确解析解决方案的适当模型复杂度措施。 本研究还包括回归代码示例,以解决一些建议的预防措施和考虑,以寻找强大的解析模型。 此代码可以很容易地适应其他问题,数据库或算法。(c)2020 Elsevier B.v.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号