A divide and conquer method for learning large Fuzzy Cognitive Maps

被引:81
|
作者
Stach, Wojciech [1 ]
Kurgan, Lukasz [1 ]
Pedrycz, Witold [1 ]
机构
[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB, Canada
关键词
Fuzzy Cognitive Maps; Qualitative modeling; Inductive learning; Genetic algorithms; Parallel genetic algorithms; GENETIC ALGORITHM; MODEL;
D O I
10.1016/j.fss.2010.04.008
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems FCMs were applied in a large number of diverse areas and have already gained momentum due to their simplicity and easiness of use However, these models are usually generated manually, and thus they cannot be applied when dealing with large number of variables In such cases, their development could be significantly affected by the limited knowledge and skills of the designer. In the past few years we have witnessed the development of several methods that support experts in establishing the FCMs or even replace humans by automating the construction of the maps from data. One of the problems of the existing automated methods is their limited scalability. which results in inability to handle large number of variables The proposed method applies a divide and conquer strategy to speed up a recently proposed genetic optimization of FCMs. We empirically contrast several different designs, including parallelized genetic algorithms. FCM-specific designs based on sampling of the input data, and existing Hebbian-based methods. The proposed method. which utilizes genetic algorithm to learn and merge multiple FCM models that are computed from subsets of the original data, is shown to be faster than other genetic algorithm-based designs while resulting in the FCMs of comparable quality We also show that the proposed method generates FCMs of higher quality than those obtained with the use of Hebbian-based methods. (C) 2010 Elsevier B V. All rights reserved.
引用
收藏
页码:2515 / 2532
页数:18
相关论文
共 50 条
  • [31] Learning computer programming using "divide and conquer" strategy vs. without "divide and conquer strategy"
    Trejos, O., I
    Munoz, L. E.
    [J]. ENTRE CIENCIA E INGENIERIA, 2020, 14 (28): : 34 - 39
  • [32] Learning Large Scale Ordinal Ranking Model via Divide-and-Conquer Technique
    Tang, Lu
    Chaudhuri, Sougata
    Bagherjeiran, Abraham
    Zhou, Ling
    [J]. COMPANION PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2018 (WWW 2018), 2018, : 1901 - 1909
  • [33] A Divide-and-Conquer Approach for Large-scale Multi-label Learning
    Zhang, Wenjie
    Wang, Xiangfeng
    Yan, Junchi
    Zha, Hongyuan
    [J]. 2017 IEEE THIRD INTERNATIONAL CONFERENCE ON MULTIMEDIA BIG DATA (BIGMM 2017), 2017, : 398 - 401
  • [34] Learning Causal Structures Based on Divide and Conquer
    Zhang, Hao
    Zhou, Shuigeng
    Yan, Chuanxu
    Guan, Jihong
    Wang, Xin
    Zhang, Ji
    Huan, Jun
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (05) : 3232 - 3243
  • [35] A new conception on the Fuzzy Cognitive Maps method
    Vergini, Eleni S.
    Groumpos, Petros P.
    [J]. IFAC PAPERSONLINE, 2016, 49 (29): : 300 - 304
  • [36] Application of Fuzzy Cognitive Maps in large manufacturing systems
    Stylios, CD
    Groumpos, PP
    [J]. LARGE SCALE SYSTEMS: THEORY AND APPLICATIONS 1998 (LSS'98), VOL 1, 1999, : 521 - 526
  • [37] A DIVIDE-AND-CONQUER METHOD FOR POLYNOMIAL ZEROS
    FREEMAN, TL
    BRANKIN, RW
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1990, 30 (01) : 71 - 79
  • [38] A Divide and Conquer Method For Periodic Jacobi Matrix
    Xu, Yinghong
    Zhang, Lipu
    [J]. PROCEEDINGS OF THE THIRD INTERNATIONAL WORKSHOP ON APPLIED MATRIX THEORY, 2009, : 193 - 195
  • [39] A DIVIDE AND CONQUER METHOD FOR THE SYMMETRIC TRIDIAGONAL EIGENPROBLEM
    CUPPEN, JJM
    [J]. NUMERISCHE MATHEMATIK, 1981, 36 (02) : 177 - 195
  • [40] Matching large ontologies: A divide-and-conquer approach
    Hu, Wei
    Qu, Yuzhong
    Cheng, Gong
    [J]. DATA & KNOWLEDGE ENGINEERING, 2008, 67 (01) : 140 - 160