Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Chen, Li-Feia; * | Su, Chao-Tonb | Chen, Kun-Huangb
Affiliations: [a] Department of Business Administration, Fu-Jen Catholic University, New Taipei City, Taiwan | [b] Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan
Correspondence: [*] Corresponding author: Li-Fei Chen, Assistant Professor, Department of Business Administration, Fu-Jen Catholic University, No. 510, Zhongzheng Rd., Xinzhung Dist., New Taipei City 24205, Taiwan. Tel.: +886 2 2905 2966; Fax: +886 2 2905 2753; E-mail: 075033@mail.fju.edu.tw
Abstract: Searching for an optimal feature subset in a high-dimensional feature space is an NP-complete problem; hence, traditional optimization algorithms are inefficient when solving large-scale feature selection problems. Therefore, meta-heuristic algorithms have been extensively adopted to solve the feature selection problem efficiently. This study proposes an improved particle swarm optimization (IPSO) algorithm using the opposite sign test (OST). The test increases population diversity in the PSO mechanism, and avoids local optimal trapping by improving the jump ability of flying particles. Data sets collected from UCI machine learning databases are used to evaluate the effectiveness of the proposed approach. Classification accuracy is employed as a criterion to evaluate classifier performance. Results show that the proposed approach outperforms both genetic algorithms and sequential search algorithms.
Keywords: Feature selection, particle swarm optimization, genetic algorithms, sequential search algorithms
DOI: 10.3233/IDA-2012-0517
Journal: Intelligent Data Analysis, vol. 16, no. 2, pp. 167-182, 2012
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl