Optimal algorithmic complexity of fuzzy ART

被引：15
|
作者：
Burwick, T [1 ]
Joublin, F [1 ]
机构：
[1] Ruhr Univ Bochum, Inst Neuroinformat, D-44780 Bochum, Germany
来源：
NEURAL PROCESSING LETTERS | 1998年 / 7卷 / 01期
关键词：
adaptive resonance theory; algorithmic complexity; fuzzy systems; neural networks; unsupervised learning;
D O I：
10.1023/A:1009632604848
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We discuss implementations of the Adaptive Resonance Theory (ART) on a serial machine. The standard formulation of ART, which was inspired by recurrent brain structures, corresponds to a recursive algorithm. This induces an algorithmic complexity of order O(N-2)+O(MN) in worst and average case, N being the number of categories, and M the input dimension. It is possible, however, to formulate ART in a non-recursive algorithm such that the complexity is of order O(MN) only.
引用
收藏
页码：37 / 41
页数：5
相关论文
共 50 条
  • [41] Algorithmic art: Technology, mathematics and art
    Ceric, Vlatko
    PROCEEDINGS OF THE ITI 2008 30TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2008, : 75 - 81
  • [42] Creativity in Algorithmic Art
    Nake, Frieder
    C & C 09: PROCEEDINGS OF THE 2009 ACM SIGCHI CONFERENCE ON CREATIVITY AND COGNITION, 2009, : 97 - 106
  • [43] Algorithmic Art Machines
    Edmonds, Ernest
    ARTS, 2018, 7 (01)
  • [44] On the algorithmic complexity of edge total domination
    Zhao, Yancai
    Liao, Zuhua
    Miao, Lianying
    THEORETICAL COMPUTER SCIENCE, 2014, 557 : 28 - 33
  • [45] Algorithmic complexity of thermal ratchet motion
    Sanchez, JR
    Family, F
    Arizmendi, CM
    PHYSICS LETTERS A, 1998, 249 (04) : 281 - 285
  • [46] ALGORITHMIC AND COMPLEXITY ANALYSIS OF INTERPOLATION SEARCH
    GONNET, GH
    ROGERS, LD
    GEORGE, JA
    ACTA INFORMATICA, 1980, 13 (01) : 39 - 52
  • [47] Algorithmic complexity of protein structure alignment
    Dewey, G
    Jia, YT
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2005, 229 : U796 - U796
  • [48] The Algorithmic Complexity of the Paired Matching Problem
    Verhaegh, Ruben F. A.
    GRAPHS AND COMBINATORIAL OPTIMIZATION: FROM THEORY TO APPLICATIONS, CTW 2023, 2024, 13 : 1 - 13
  • [49] Algorithmic complexity of proper labeling problems
    Dehghan, Ali
    Sadeghi, Mohammad-Reza
    Ahadi, Arash
    THEORETICAL COMPUTER SCIENCE, 2013, 495 : 25 - 36
  • [50] Probability, algorithmic complexity, and subjective randomness
    Griffiths, TL
    Tenenbaum, JB
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL CONFERENCE OF THE COGNITIVE SCIENCE SOCIETY, PTS 1 AND 2, 2003, : 480 - 485
12345