基于蚁群优化的稀疏模糊认知地图学习

Nan Ye, Ming Gao, Rongwei Zhang, Dehong Wang, Xianhua He, Jun Lu, Zhengyan Wu, Qi Zheng
{"title":"基于蚁群优化的稀疏模糊认知地图学习","authors":"Nan Ye, Ming Gao, Rongwei Zhang, Dehong Wang, Xianhua He, Jun Lu, Zhengyan Wu, Qi Zheng","doi":"10.1109/FSKD.2013.6816169","DOIUrl":null,"url":null,"abstract":"Fuzzy Cognitive Maps (FCMs) are a causal modelling technique. FCM models contain nodes (representing the concepts to be modelled) and directed weighted edges (representing the causal relations between the concepts). Data-driven FCM learning algorithms are an objective approach with the potential to discover the causal relations that are unknown to human experts. Learning FCM from data can be a difficult problem because the size of the solution space grows quadratically with the number of nodes in the FCM models. A data-driven learning algorithm based on Ant Colony Optimization (ACO) is proposed to develop Fuzzy Cognitive Maps (FCMs). The FCM models can be isomorphically represented as weight vectors. The objective function is to minimize the difference between the estimated response of the FCM model and the target response observed from the to-be-modelled system. An ACO algorithm with heuristic information is proposed to find the best FCM model. The performance of the ACO algorithm was tested on both randomly generated data and DREAM4 project data (publicly available in-silico gene expression data). The experiment results show that the ACO algorithm is able to learn FCMs with at least 40 nodes.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Learning sparse Fuzzy Cognitive Maps by Ant Colony Optimization\",\"authors\":\"Nan Ye, Ming Gao, Rongwei Zhang, Dehong Wang, Xianhua He, Jun Lu, Zhengyan Wu, Qi Zheng\",\"doi\":\"10.1109/FSKD.2013.6816169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fuzzy Cognitive Maps (FCMs) are a causal modelling technique. FCM models contain nodes (representing the concepts to be modelled) and directed weighted edges (representing the causal relations between the concepts). Data-driven FCM learning algorithms are an objective approach with the potential to discover the causal relations that are unknown to human experts. Learning FCM from data can be a difficult problem because the size of the solution space grows quadratically with the number of nodes in the FCM models. A data-driven learning algorithm based on Ant Colony Optimization (ACO) is proposed to develop Fuzzy Cognitive Maps (FCMs). The FCM models can be isomorphically represented as weight vectors. The objective function is to minimize the difference between the estimated response of the FCM model and the target response observed from the to-be-modelled system. An ACO algorithm with heuristic information is proposed to find the best FCM model. The performance of the ACO algorithm was tested on both randomly generated data and DREAM4 project data (publicly available in-silico gene expression data). The experiment results show that the ACO algorithm is able to learn FCMs with at least 40 nodes.\",\"PeriodicalId\":368964,\"journal\":{\"name\":\"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2013.6816169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2013.6816169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

模糊认知图(fcm)是一种因果建模技术。FCM模型包含节点(表示要建模的概念)和有向加权边(表示概念之间的因果关系)。数据驱动的FCM学习算法是一种客观的方法,有可能发现人类专家未知的因果关系。从数据中学习FCM可能是一个困难的问题,因为解空间的大小随着FCM模型中节点的数量呈二次增长。提出了一种基于蚁群算法的数据驱动学习算法,用于模糊认知地图的生成。FCM模型可以同构地表示为权重向量。目标函数是最小化FCM模型的估计响应与待建模系统观察到的目标响应之间的差异。提出了一种启发式信息的蚁群算法来寻找最佳的FCM模型。在随机生成的数据和DREAM4项目数据(公开的计算机基因表达数据)上测试了蚁群算法的性能。实验结果表明,蚁群算法能够学习到至少有40个节点的fcm。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Learning sparse Fuzzy Cognitive Maps by Ant Colony Optimization
Fuzzy Cognitive Maps (FCMs) are a causal modelling technique. FCM models contain nodes (representing the concepts to be modelled) and directed weighted edges (representing the causal relations between the concepts). Data-driven FCM learning algorithms are an objective approach with the potential to discover the causal relations that are unknown to human experts. Learning FCM from data can be a difficult problem because the size of the solution space grows quadratically with the number of nodes in the FCM models. A data-driven learning algorithm based on Ant Colony Optimization (ACO) is proposed to develop Fuzzy Cognitive Maps (FCMs). The FCM models can be isomorphically represented as weight vectors. The objective function is to minimize the difference between the estimated response of the FCM model and the target response observed from the to-be-modelled system. An ACO algorithm with heuristic information is proposed to find the best FCM model. The performance of the ACO algorithm was tested on both randomly generated data and DREAM4 project data (publicly available in-silico gene expression data). The experiment results show that the ACO algorithm is able to learn FCMs with at least 40 nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信