Please use this identifier to cite or link to this item:
|Title:||A kernel autoassociator approach to pattern classification|
Nonlinear associative memory
|Citation:||Zhang, H., Huang, W., HUANG ZHIYONG, Zhang, B. (2005). A kernel autoassociator approach to pattern classification. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 35 (3) : 593-606. ScholarBank@NUS Repository. https://doi.org/10.1109/TSMCB.2005.843980|
|Abstract:||Autoassociators are a special type of neural networks which, by learning to reproduce a given set of patterns, grasp the underlying concept that is useful for pattern classification. In this paper, we present a novel nonlinear model referred to as kernel autoassociators based on kernel methods. While conventional nonlinear autoassociation models emphasize searching for the nonlinear representations of input patterns, a kernel autoassociator takes a kernel feature space as the nonlinear manifold, and places emphasis on the reconstruction of input patterns from the kernel feature space. Two methods are proposed to address the reconstruction problem, using linear and multivariate polynomial functions, respectively. We apply the proposed model to novelty detection with or without novelty examples and study it on the promoter detection and sonar target recognition problems. We also apply the model to mclass classification problems including wine recognition, glass recognition, handwritten digit recognition, and face recognition. The experimental results show that, compared with conventional autoassociators and other recognition systems, kernel autoassociators can provide better or comparable performance for concept learning and recognition in various domains. © 2005 IEEE.|
|Source Title:||IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 14, 2019
WEB OF SCIENCETM
checked on Mar 6, 2019
checked on Mar 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.