Conditional Random Fields Based on Neiderreit Sequence Initialized Eagle Perching Optimizer

Zhihan Yu, Yuning He, Mengyao Shi, Mengdi Zhen, Zan Yang, Dan Li, Wei Nai
{"title":"Conditional Random Fields Based on Neiderreit Sequence Initialized Eagle Perching Optimizer","authors":"Zhihan Yu, Yuning He, Mengyao Shi, Mengdi Zhen, Zan Yang, Dan Li, Wei Nai","doi":"10.1109/IAEAC54830.2022.9930085","DOIUrl":null,"url":null,"abstract":"Conditional random field (CRF) is a spatial state model proposed by the probability graph school of thought, and it belongs to the undirected probability inference model in the area of probability graph model. CRF combines the advantages of several classical models in machine learning (ML) and plays an important role in solving the model parameters of ML algorithms which describe unconstrained optimization problems. However, CRF also have its own defects, for some functions, such as multi-modal non convex smooth objective functions, it is difficult for it to find the global optimal solution by using gradient dependent methods, and the solution process is easy to fall into local optimal solution. At present, many scholars have studied CRF related issues, but most of them have just tried to use CRF algorithm to solve specific application problems in various industries, there are few reports on the optimization of CRF algorithm itself, especially its solution process. Thus, in this paper, a derivative free optimization swarm intelligence method, namely Neiderreit sequence initialized eagle percolating optimizer (NSIEPO) has been proposed to replace the gradient dependent method in finding the global optimal solution. By numerical analysis, the effectiveness of the proposed algorithm has been verified.","PeriodicalId":349113,"journal":{"name":"2022 IEEE 6th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC )","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 6th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC )","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAEAC54830.2022.9930085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Conditional random field (CRF) is a spatial state model proposed by the probability graph school of thought, and it belongs to the undirected probability inference model in the area of probability graph model. CRF combines the advantages of several classical models in machine learning (ML) and plays an important role in solving the model parameters of ML algorithms which describe unconstrained optimization problems. However, CRF also have its own defects, for some functions, such as multi-modal non convex smooth objective functions, it is difficult for it to find the global optimal solution by using gradient dependent methods, and the solution process is easy to fall into local optimal solution. At present, many scholars have studied CRF related issues, but most of them have just tried to use CRF algorithm to solve specific application problems in various industries, there are few reports on the optimization of CRF algorithm itself, especially its solution process. Thus, in this paper, a derivative free optimization swarm intelligence method, namely Neiderreit sequence initialized eagle percolating optimizer (NSIEPO) has been proposed to replace the gradient dependent method in finding the global optimal solution. By numerical analysis, the effectiveness of the proposed algorithm has been verified.
基于Neiderreit序列初始化的条件随机场鹰栖息优化器
条件随机场(CRF)是由概率图学派提出的一种空间状态模型,属于概率图模型领域的无向概率推理模型。CRF结合了机器学习中几种经典模型的优点,在求解描述无约束优化问题的机器学习算法的模型参数方面起着重要作用。然而,CRF也有其自身的缺陷,对于一些函数,如多模态非凸光滑目标函数,使用梯度相关方法难以找到全局最优解,求解过程容易陷入局部最优解。目前,已有很多学者对CRF相关问题进行了研究,但大多只是尝试用CRF算法解决各个行业的具体应用问题,对CRF算法本身的优化,尤其是其求解过程的优化报道较少。因此,本文提出了一种无导数优化群体智能方法,即Neiderreit序列初始化鹰渗透优化器(NSIEPO),以取代梯度依赖方法寻找全局最优解。通过数值分析,验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信