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 条
  • [31] On algorithmic complexity of imprecise spanners
    Poureidi, Abolfazl
    Farshi, Mohammad
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2024, 117
  • [32] Algorithmic complexity of quantum capacity
    Samad Khabbazi Oskouei
    Stefano Mancini
    Quantum Information Processing, 2018, 17
  • [33] Algorithmic complexity and efficiency of a ratchet
    Depto. de Física, Fac. Ing., Univ. Nac. Mar Plata, A., Plata, Argentina
    不详
    Phys A Stat Mech Appl, 2 (285-292):
  • [34] Algorithmic complexity of quantum capacity
    Oskouei, Samad Khabbazi
    Mancini, Stefano
    QUANTUM INFORMATION PROCESSING, 2018, 17 (04)
  • [35] On the algorithmic complexity of static structures
    Joel Ratsaby
    J. Chaskalovic
    Journal of Systems Science and Complexity, 2010, 23 : 1037 - 1053
  • [36] ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES
    Ratsaby, Joel
    Chaskalovic, J.
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2010, 23 (06) : 1037 - 1053
  • [37] ALGORITHMIC COMPLEXITY OF DISCRETE FUNCTIONS
    OFMAN, Y
    DOKLADY AKADEMII NAUK SSSR, 1962, 145 (01): : 48 - &
  • [38] Algorithmic complexity as a criterion of unsolvability
    Burgin, Mark
    THEORETICAL COMPUTER SCIENCE, 2007, 383 (2-3) : 244 - 259
  • [39] ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS
    ALDER, A
    STRASSEN, V
    THEORETICAL COMPUTER SCIENCE, 1981, 15 (02) : 201 - 211
  • [40] On the Improbability of Algorithmic Specified Complexity
    Ewert, Winston
    Marks, Robert J., II
    Dembski, William A.
    45TH SOUTHEASTERN SYMPOSIUM ON SYSTEM THEORY, 2013, : 68 - 70
12345