• DocumentCode
    2725112
  • Title

    A Constructive Incremental Learning Algorithm for Binary Classification Tasks

  • Author

    Giraud-Carrier, Christophe ; Martinez, Tony

  • Author_Institution
    Dept. of Comput. Sci., Brigham Young Univ., Provo, UT
  • fYear
    2006
  • fDate
    24-26 July 2006
  • Firstpage
    213
  • Lastpage
    218
  • Abstract
    This paper presents i-AA1* a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1*, learning consists of adapting the nodes\´ functions and the network\´s overall topology as each new training pattern is presented. Provided the training data is consistent, computational complexity is low and prior factual knowledge may be used to "prime" the network and improve its predictive accuracy. Empirical generalization results on both toy problems and more realistic tasks demonstrate promise
  • Keywords
    computational complexity; learning (artificial intelligence); pattern classification; binary classification tasks; computational complexity; constructive incremental learning algorithm; self-organizing networks; Accuracy; Adaptive algorithm; Adaptive systems; Classification algorithms; Computer networks; Computer science; Concurrent computing; Data flow computing; Logic; Network topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Adaptive and Learning Systems, 2006 IEEE Mountain Workshop on
  • Conference_Location
    Logan, UT
  • Print_ISBN
    1-4244-0166-6
  • Type

    conf

  • DOI
    10.1109/SMCALS.2006.250718
  • Filename
    4016789