Residential Collegefalse
Status已發表Published
A novel algorithm for neural network architecture generation, parameter optimization and feature selection - ParFeatArch generator
Ricardo Brito1; Simon Fong1; Yaoyang WU1; Suash Deb2,3
2018-03-24
Conference NameISMSI '18: 2018 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence
Source PublicationISMSI '18: Proceedings of the 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence
Pages17-23
Conference Date24 March, 2018- 25 March, 2018
Conference PlacePhuket Thailand
PublisherASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
Abstract

In this paper, we propose ParFeatArch Generator, a new algorithm for generating Neural Network architectures with optimal features and parameters through Particle Swarm Optimization. Selecting the best architecture for a Neural Network is usually done through a trial and error process, in which the number of layers is selected usually based on previous experience and then the network is trained and tested. When using Neural Networks as classifiers in feature selection algorithms, usually the number of layers in the Neural Network is selected prior to using the Neural Network as a classifier to the feature selection algorithm. In this work we propose a new generative algorithm called ParFeatArch Generator, which is based on PSO and combines the feature selection process with the Neural Network architecture selection process and parameter optimization in one algorithm which generates the Neural Network topology with optimal parameters while at the same time performs feature selection and evaluates the Neural Network topology to determine its quality. With the proposed algorithm, given a dataset, it is possible to end up with the optimal features on the dataset and with an optimal Neural Network classifier with optimal parameters for such features.

KeywordParticle Swarm Optimization (Pso) Neural Networks Feature Selection Generative Algorithms
DOI10.1145/3206185.3206193
URLView the original
Indexed ByCPCI-S
Language英語English
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Artificial Intelligence ; Computer Science, Theory & Methods ; Engineering, Electrical & Electronic
WOS IDWOS:000475551900004
Scopus ID2-s2.0-85057602833
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionDEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Affiliation1.Department of Computer and Information Science Faculty of Science and Technology University of Macau Taipa, Macau SAR
2.IT & Educational Consultant, Ranchi, Jharkhand, India
3.Distinguished Professorial Associate, Decision Sciences & Modeling Program, Victoria University, Melbourne, Melbourne 8001, Australia
First Author AffilicationFaculty of Science and Technology
Recommended Citation
GB/T 7714
Ricardo Brito,Simon Fong,Yaoyang WU,et al. A novel algorithm for neural network architecture generation, parameter optimization and feature selection - ParFeatArch generator[C]:ASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, NY 10036-9998 USA, 2018, 17-23.
APA Ricardo Brito., Simon Fong., Yaoyang WU., & Suash Deb (2018). A novel algorithm for neural network architecture generation, parameter optimization and feature selection - ParFeatArch generator. ISMSI '18: Proceedings of the 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, 17-23.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Ricardo Brito]'s Articles
[Simon Fong]'s Articles
[Yaoyang WU]'s Articles
Baidu academic
Similar articles in Baidu academic
[Ricardo Brito]'s Articles
[Simon Fong]'s Articles
[Yaoyang WU]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Ricardo Brito]'s Articles
[Simon Fong]'s Articles
[Yaoyang WU]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.