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 条
  • [1] Optimal Algorithmic Complexity of Fuzzy ART
    T. Burwick
    F. Joublin
    Neural Processing Letters, 1998, 7 : 37 - 41
  • [2] Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
    Zhang, Liang
    Yang, Junchi
    Karbasi, Amin
    He, Niao
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [3] Outlier detection under interval and fuzzy uncertainty:: Algorithmic solvability and computational complexity
    Kreinovich, V
    Patangay, P
    Longpré, L
    Starks, SA
    Campos, C
    Ferson, S
    Ginzburg, L
    NAFIPS'2003: 22ND INTERNATIONAL CONFERENCE OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY - NAFIPS PROCEEDINGS, 2003, : 401 - 406
  • [4] Algorithmic complexity and randomness
    Partovi, AH
    BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING, PT 2, 2001, 568 : 31 - 37
  • [5] Algorithmic complexity and applications
    Calude, Cristian S.
    Jurgensen, Helmut
    FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : VII - VIII
  • [6] Algorithmic Folding Complexity
    Jean Cardinal
    Erik D. Demaine
    Martin L. Demaine
    Shinji Imahori
    Tsuyoshi Ito
    Masashi Kiyomi
    Stefan Langerman
    Ryuhei Uehara
    Takeaki Uno
    Graphs and Combinatorics, 2011, 27 : 341 - 351
  • [7] Algorithmic complexity of a protein
    Dewey, TG
    PHYSICAL REVIEW E, 1996, 54 (01): : R39 - R41
  • [8] The Algorithmic Complexity of Landscapes
    Papadimitriou, Fivos
    LANDSCAPE RESEARCH, 2012, 37 (05) : 591 - 611
  • [9] The history of Algorithmic complexity
    Nasar, Audrey A.
    MATHEMATICS ENTHUSIAST, 2016, 13 (03): : 217 - 242
  • [10] Chaos and algorithmic complexity
    Batterman, RW
    White, H
    FOUNDATIONS OF PHYSICS, 1996, 26 (03) : 307 - 336
12345