Learning Fuzzy Cognitive Maps from Data by Ant Colony Optimization

被引:47
作者
Chen, Ye [1 ]
Mazlack, Lawrence J. [1 ]
Lu, Long J. [1 ]
机构
[1] Univ Cincinnati, Sch Elect & Comp Syst, Cincinnati, OH 45221 USA
来源
PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE | 2012年
关键词
Fuzzy Cognitive Maps; Ant Colony Optimization; numerical optimization; data-driven learning algorithm; ALGORITHM;
D O I
10.1145/2330163.2330166
中图分类号
TP301 [理论、方法];
学科分类号
080201 [机械制造及其自动化];
摘要
Fuzzy Cognitive Maps (FCMs) are a flexible modeling technique with the goal of modeling causal relationships. Traditionally FCMs are developed by experts. We need to learn FCMs directly from data when expert knowledge is not available. The FCM learning problem can be described as the minimization of the difference between the desired response of the system and the estimated response of the learned FCM model. Learning FCMs from data can be a difficult task because of the large number of candidate FCMs. A FCM learning algorithm based on Ant Colony Optimization (ACO) is presented in order to learn FCM models from multiple observed response sequences. Experiments on simulated data suggest that the proposed ACO based FCM learning algorithm is capable of learning FCM with at least 40 nodes. The performance of the algorithm was tested on both single response sequence and multiple response sequences. The test results are compared to several algorithms, such as genetic algorithms and nonlinear Hebbian learning rule based algorithms. The performance of the ACO algorithm is better than these algorithms in several different experiment scenarios in terms of model errors, sensitivities and specificities. The effect of number of response sequences and number of nodes is discussed.
引用
收藏
页码:9 / 16
页数:8
相关论文
共 22 条
[1]
Alizadeh S., 2007, International Journal of Computer Science, V2, P142
[2]
Learning FCM by chaotic simulated annealing [J].
Alizadeh, Somayeh ;
Ghazanfari, Mehdi .
CHAOS SOLITONS & FRACTALS, 2009, 41 (03) :1182-1190
[3]
Ant colony optimization: Introduction and recent trends [J].
Blum, Christian .
PHYSICS OF LIFE REVIEWS, 2005, 2 (04) :353-373
[4]
Chen N, 2011, GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P1029
[5]
Ding Z., 2011, J COMPUTATIONAL INFO, V7, P4756
[6]
Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[7]
Comparing simulated annealing and genetic algorithm in learning FCM [J].
Ghazanfari, M. ;
Alizadeh, S. ;
Fathian, M. ;
Koulouriotis, D. E. .
APPLIED MATHEMATICS AND COMPUTATION, 2007, 192 (01) :56-68
[8]
SamACO: Variable Sampling Ant Colony Optimization Algorithm for Continuous Optimization [J].
Hu, Xiao-Min ;
Zhang, Jun ;
Chung, Henry Shu-Hung ;
Li, Yun ;
Liu, Ou .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2010, 40 (06) :1555-1566
[9]
FUZZY COGNITIVE MAPS [J].
KOSKO, B .
INTERNATIONAL JOURNAL OF MAN-MACHINE STUDIES, 1986, 24 (01) :65-75
[10]
Koulouriotis DE, 2001, IEEE C EVOL COMPUTAT, P364, DOI 10.1109/CEC.2001.934413