PolyU Institutional Repository >
COMP Conference Papers & Presentations >
Please use this identifier to cite or link to this item:
|Title: ||Bagging evolutionary feature extraction algorithm for classification|
|Authors: ||Zhao, Tianwen|
Zhang, David D.
|Subjects: ||Classification (of information)|
State space methods
|Issue Date: ||2007 |
|Publisher: ||IEEE Computer Society|
|Citation: ||ICNC 2007 : third International Conference on Natural Computation : Haikou, Hainan, China, 24-27 August, 2007 : proceedings, v. 3, p. 540-545.|
|Abstract: ||Feature extraction is significant for pattern analysis and classification. Those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale and high dimensional data classification. Most recently, Zhao et al. presented a direct evolutionary feature extraction algorithm (DEFE) which can reduce the space complexity and improve the efficiency, thus overcoming the limitations of many genetic algorithm based feature extraction algorithms (EFE). However, DEFE does not consider the outlier problem which could deteriorate the classification performance, especially when the training sample set is small. Moreover, when there are many classes, the null space of within-class scatter matrix (S[sub w]) becomes small, resulting in poor discrimination performance in that space. In this paper, we propose a bagging evolutionary feature extraction algorithm (BEFE) incorporating bagging into a revised DEFE algorithm to improve the DEFE's performance in cases of small training sets and large number of classes. The proposed algorithm has been applied to face recognition and testified using the Yale and ORL face databases.|
|Rights: ||© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Type: ||Conference Paper|
|Appears in Collections:||COMP Conference Papers & Presentations|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.