以矛曼相关系数为指导的稀疏大规模高阶模糊认知图谱

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Soft Computing Pub Date : 2024-09-18 DOI:10.1016/j.asoc.2024.112253
{"title":"以矛曼相关系数为指导的稀疏大规模高阶模糊认知图谱","authors":"","doi":"10.1016/j.asoc.2024.112253","DOIUrl":null,"url":null,"abstract":"<div><p>Time series prediction is one of the most important applications of Fuzzy Cognitive Maps (FCMs). In general, the state of FCMs in forecasting depends only on the state of the previous moment, but in fact it is also affected by the past state. Hence Higher-Order Fuzzy Cognitive Maps (HFCMs) are proposed based on FCMs considering historical information and have been widely used for time series forecasting. However, using HFCMs to deal with sparse and large-scale multivariate time series are still a challenge, while large-scale data makes it difficult to determine the causal relationship between nodes because of the increased number of nodes, so it is necessary to explore the relationship between nodes to guide large-scale HFCMs learning. Therefore, a sparse large-scale HFCMs learning algorithm guided by Spearman correlation coefficient, called SG-HFCM, is proposed in the paper. The SG-HFCM model is specified as follows: First, the solving of HFCMs model is transform into a regression model and an adaptive loss function is utilized to enhance the robustness of the model. Second, <span><math><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-norm is used to improve the sparsity of the weight matrix. Third, in order to more accurately characterize the correlation relationship between variables, the Spearman correlation coefficients is added as a regular term to guide the learning of weight matrices. When calculating the Spearman correlation coefficient, through splitting domain interval method, we can better understand the characteristics of the data, and get better correlation in different small intervals, and more accurately characterize the relationship between the variables in order to guide the weight matrix. In addition, the Alternating Direction Multiplication Method and quadratic programming method are used to solve the algorithms to get better solutions for the SG-HFCM, where the quadratic programming can well ensure that the range of the weights and obtaining the optimal solution. Finally, by comparing with five algorithms, the SG-HFCM model showed an average improvement of 11.93% in prediction accuracy for GRNs, indicating that our proposed model has good predictive performance.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sparse large-scale high-order fuzzy cognitive maps guided by spearman correlation coefficient\",\"authors\":\"\",\"doi\":\"10.1016/j.asoc.2024.112253\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Time series prediction is one of the most important applications of Fuzzy Cognitive Maps (FCMs). In general, the state of FCMs in forecasting depends only on the state of the previous moment, but in fact it is also affected by the past state. Hence Higher-Order Fuzzy Cognitive Maps (HFCMs) are proposed based on FCMs considering historical information and have been widely used for time series forecasting. However, using HFCMs to deal with sparse and large-scale multivariate time series are still a challenge, while large-scale data makes it difficult to determine the causal relationship between nodes because of the increased number of nodes, so it is necessary to explore the relationship between nodes to guide large-scale HFCMs learning. Therefore, a sparse large-scale HFCMs learning algorithm guided by Spearman correlation coefficient, called SG-HFCM, is proposed in the paper. The SG-HFCM model is specified as follows: First, the solving of HFCMs model is transform into a regression model and an adaptive loss function is utilized to enhance the robustness of the model. Second, <span><math><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-norm is used to improve the sparsity of the weight matrix. Third, in order to more accurately characterize the correlation relationship between variables, the Spearman correlation coefficients is added as a regular term to guide the learning of weight matrices. When calculating the Spearman correlation coefficient, through splitting domain interval method, we can better understand the characteristics of the data, and get better correlation in different small intervals, and more accurately characterize the relationship between the variables in order to guide the weight matrix. In addition, the Alternating Direction Multiplication Method and quadratic programming method are used to solve the algorithms to get better solutions for the SG-HFCM, where the quadratic programming can well ensure that the range of the weights and obtaining the optimal solution. Finally, by comparing with five algorithms, the SG-HFCM model showed an average improvement of 11.93% in prediction accuracy for GRNs, indicating that our proposed model has good predictive performance.</p></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494624010275\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624010275","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

时间序列预测是模糊认知图(FCM)最重要的应用之一。一般来说,FCMs 在预测中的状态只取决于前一时刻的状态,但事实上它也受到过去状态的影响。因此,在考虑历史信息的 FCM 基础上提出了高阶模糊认知图(HFCM),并被广泛用于时间序列预测。然而,使用 HFCMs 处理稀疏和大规模的多元时间序列仍是一个挑战,而大规模数据由于节点数量的增加,很难确定节点之间的因果关系,因此有必要探索节点之间的关系,以指导大规模 HFCMs 的学习。因此,本文提出了一种以斯皮尔曼相关系数为指导的稀疏大规模 HFCMs 学习算法,称为 SG-HFCM。SG-HFCM 模型具体如下:首先,将 HFCMs 模型的求解转化为回归模型,并利用自适应损失函数来增强模型的鲁棒性。其次,利用 l1-norm 来改善权重矩阵的稀疏性。第三,为了更准确地描述变量之间的相关关系,加入了斯皮尔曼相关系数作为正则项来指导权重矩阵的学习。在计算斯皮尔曼相关系数时,通过分割域区间的方法,可以更好地了解数据的特点,在不同的小区间内得到更好的相关性,更准确地表征变量之间的关系,从而指导权重矩阵的学习。此外,利用交替方向乘法和二次编程法对算法进行求解,得到 SG-HFCM 的较好解,其中二次编程法可以很好地保证权重的范围,获得最优解。最后,通过与五种算法的比较,SG-HFCM 模型对 GRN 的预测准确率平均提高了 11.93%,表明我们提出的模型具有良好的预测性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Sparse large-scale high-order fuzzy cognitive maps guided by spearman correlation coefficient

Time series prediction is one of the most important applications of Fuzzy Cognitive Maps (FCMs). In general, the state of FCMs in forecasting depends only on the state of the previous moment, but in fact it is also affected by the past state. Hence Higher-Order Fuzzy Cognitive Maps (HFCMs) are proposed based on FCMs considering historical information and have been widely used for time series forecasting. However, using HFCMs to deal with sparse and large-scale multivariate time series are still a challenge, while large-scale data makes it difficult to determine the causal relationship between nodes because of the increased number of nodes, so it is necessary to explore the relationship between nodes to guide large-scale HFCMs learning. Therefore, a sparse large-scale HFCMs learning algorithm guided by Spearman correlation coefficient, called SG-HFCM, is proposed in the paper. The SG-HFCM model is specified as follows: First, the solving of HFCMs model is transform into a regression model and an adaptive loss function is utilized to enhance the robustness of the model. Second, l1-norm is used to improve the sparsity of the weight matrix. Third, in order to more accurately characterize the correlation relationship between variables, the Spearman correlation coefficients is added as a regular term to guide the learning of weight matrices. When calculating the Spearman correlation coefficient, through splitting domain interval method, we can better understand the characteristics of the data, and get better correlation in different small intervals, and more accurately characterize the relationship between the variables in order to guide the weight matrix. In addition, the Alternating Direction Multiplication Method and quadratic programming method are used to solve the algorithms to get better solutions for the SG-HFCM, where the quadratic programming can well ensure that the range of the weights and obtaining the optimal solution. Finally, by comparing with five algorithms, the SG-HFCM model showed an average improvement of 11.93% in prediction accuracy for GRNs, indicating that our proposed model has good predictive performance.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
期刊最新文献
LesionMix data enhancement and entropy minimization for semi-supervised lesion segmentation of lung cancer Fuzzy Self-tuning Bees Algorithm for designing optimal product lines GANs-generated synthetic datasets for face alignment algorithms in complex environments Competitive swarm optimizer with dynamic multi-competitions and convergence accelerator for large-scale optimization problems Adaptive Neighbors Graph Learning for Large-Scale Data Clustering using Vector Quantization and Self-Regularization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1