The Learning of Fuzzy Cognitive Maps With Noisy Data: A Rapid and Robust Learning Method With Maximum Entropy
Guoliang Feng, Wei Lu, Witold Pedrycz, Jianhua Yang, and Xiaodong Liu

TL;DR
This paper introduces a fast, robust learning method for fuzzy cognitive maps that effectively handles noisy data and scales to large systems by transforming the problem into a convex optimization with maximum entropy regularization.
Contribution
The paper proposes a novel learning algorithm for FCMs that improves speed, robustness to noise, and weight distribution quality, especially for large-scale models.
Findings
The method is rapid and robust against noisy data.
It produces better weight distribution in learned FCMs.
It outperforms existing learning algorithms in experiments.
Abstract
Numerous learning methods for fuzzy cognitive maps (FCMs), such as the Hebbian-based and the population-based learning methods, have been developed for modeling and simulating dynamic systems. However, these methods are faced with several obvious limitations. Most of these models are extremely time consuming when learning the large-scale FCMs with hundreds of nodes. Furthermore, the FCMs learned by those algorithms lack robustness when the experimental data contain noise. In addition, reasonable distribution of the weights is rarely considered in these algorithms, which could result in the reduction of the performance of the resulting FCM. In this article, a straightforward, rapid, and robust learning method is proposed to learn FCMs from noisy data, especially, to learn large-scale FCMs. The crux of the proposed algorithm is to equivalently transform the learning problem of FCMs to a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
