2 November 2017 in IEEE Transactions on Fuzzy Systems
Recently, a learning procedure to improve the overall convergence of sigmoid fuzzy cognitive maps used in pattern classification was proposed. The algorithm estimates the slope of each sigmoid neuron while preserving the causal weights. This paper proposes a more realistic error function for this algorithm, which is based on 1) the dissimilarity between two consecutive responses, and 2) the dissimilarity between the current output and the expected one. As a second contribution, we introduce sufficient conditions to arrive at stability features. These conditions allow assessing the accuracy-convergence tradeoff attached to the proposed learning procedure.
13 February 2020 in IEEE Transactions on Fuzzy Systems
Fuzzy Cognitive Maps (FCMs) are recurrent neural networks comprised of well-defined concepts and causal relations. While the literature about real-world FCM applications is prolific, the studies devoted to understanding the foundations behind these neural networks are rather scant. In this paper, we introduce several definitions and theorems that unveil the dynamic behavior of FCM-based models equipped with transfer F-functions. These analytical expressions allow estimating bounds for the activation value of each neuron and analyzing the covering and proximity of feasible activation spaces. The main theoretical findings suggest that the state space of any FCM model equipped with transfer F-functions shrinks infinitely with no guarantee for the FCM to converge to a fixed point but to its limit state space. This result in conjunction with the covering and proximity values of FCM-based models help understand their poor performance when solving complex simulation problems.
7 October 2020 in IEEE Transactions on Cybernetics
Fuzzy-rough cognitive networks (FRCNs) are recurrent neural networks (RNNs) intended for structured classification purposes in which the problem is described by an explicit set of features. The advantage of this granular neural system relies on its transparency and simplicity while being competitive to state-of-the-art classifiers. Despite their relative empirical success in terms of prediction rates, there are limited studies on FRCNs' dynamic properties and how their building blocks contribute to the algorithm's performance. In this article, we theoretically study these issues and conclude that boundary and negative neurons always converge to a unique fixed-point attractor. Moreover, we demonstrate that negative neurons have no impact on the algorithm's performance and that the ranking of positive neurons is invariant. Moved by our theoretical findings, we propose two simpler fuzzy-rough classifiers that overcome the detected issues and maintain the competitive prediction rates of this classifier. Toward the end, we present a case study concerned with image classification, in which a convolutional neural network is coupled with one of the simpler models derived from the theoretical analysis of the FRCN model. The numerical simulations suggest that once the features have been extracted, our granular neural system performs as well as other RNNs.
7 November 2023 in Information Sciences
20 December 2024 in Applied Soft Computing