检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘庆[1] 任海鹏[1] 姚俊良[1] 刘龙[1] LIU Qing;REN Hai-peng;YAO Jun-liang;LIU Long(Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing,Xi’an University of Technology,Xi’an Shaanxi 710048,China)
机构地区:[1]西安理工大学陕西省复杂系统控制与智能信息处理重点实验室,陕西西安710048
出 处:《控制理论与应用》2020年第2期340-354,共15页Control Theory & Applications
基 金:国家自然科学基金项目(61502385,61673318);陕西省特支计划科技创新领军人才项目支持资助.
摘 要:针对现有符号回归方法仅关注拟合误差而忽略模型简化的问题,提出了一种基于多目标的人工鱼群算法,将拟合误差与模型复杂度同时作为目标函数进行优化.以二叉堆对语法树编码,优良分支得以稳定地遗传和继承,也更易解码.在引入蒙版、邻域、小生境、拥挤度等概念的基础上,设计和定义了适用于二叉堆编码的随机游动、觅食、追尾、逃脱等人工鱼行为算子.详尽的实验表明,提出算法在符号回归过程中能获取高质量的Pareto解.此外,对从Pareto前沿上选取折衷解及降低算法内存开销的方法也进行了讨论.Aiming at the issue that the existing methods for symbolic regression focus on minimizing the fitting error merely while ignore the model simplification,a multi-objective artificial fish school algorithm is proposed for minimizing the fitting error and the model complexity simultaneously during symbolic regression.The parse tree is encoded as the form of binary heap,such that fine branches of the parse tree could be stably inherited,and suchlike binary heap-based representation is easier to decode.By introducing the conceptions such as mask,neighborhood,niche,and crowding degree,several behavior operators performed by the artificial fish,including randomly moving,foraging,following,and escaping,are defined.Exhaustive simulation results show that the proposed algorithm is capable of obtaining high-quality Pareto solutions during symbolic regression.Besides,the method of determining a trade-off solution from the obtained Pareto front and that of reducing the memory overhead are also discussed.
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7