Please use this identifier to cite or link to this item:
|Title:||Incremental learning with respect to new incoming input attributes|
|Authors:||Guan, S.-U. |
|Keywords:||Constructive learning algorithms|
|Citation:||Guan, S.-U., Li, S. (2001-12). Incremental learning with respect to new incoming input attributes. Neural Processing Letters 14 (3) : 241-260. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1012799113953|
|Abstract:||Neural networks are generally exposed to a dynamic environment where the training patterns or the input attributes (features) will likely be introduced into the current domain incrementally. This Letter considers the situation where a new set of input attributes must be considered and added into the existing neural network. The conventional method is to discard the existing network and redesign one from scratch. This approach wastes the old knowledge and the previous effort. In order to reduce computational time, improve generalization accuracy, and enhance intelligence of the learned models, we present ILIA algorithms (namely ILIA1, ILIA2, ILIA3, ILIA4 and ILIA5) capable of Incremental Learning in terms of Input Attributes. Using the ILIA algorithms, when new input attributes are introduced into the original problem, the existing neural network can be retained and a new sub-network is constructed and trained incrementally. The new sub-network and the old one are merged later to form a new network for the changed problem. In addition, ILIA algorithms have the ability to decide whether the new incoming input attributes are relevant to the output and consistent with the existing input attributes or not and suggest to accept or reject them. Experimental results show that the ILIA algorithms are efficient and effective both for the classification and regression problems.|
|Source Title:||Neural Processing Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 19, 2018
WEB OF SCIENCETM
checked on Jul 3, 2018
checked on Mar 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.