Learning with adaptivity is a key issue in many nowadays applications. The most important aspect of such an issue is incremental learning (IL). This latter seeks to equip learning algorithms with the ability to deal with data arriving over long periods of time. Once used during the learning process, old data is never used in subsequent learning stages. This paper suggests a new IL algorithm which generates categories. Each is associated with one class. To show the efficiency of the algorithm, several experiments are carried out. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Bouchachia, A. (2006). Learning with incrementality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4232 LNCS, pp. 137–146). Springer Verlag. https://doi.org/10.1007/11893028_16
Mendeley helps you to discover research relevant for your work.