Particle Swarm Model Selection for Authorship Verification
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Evolutionary Model Type Selection for Global Surrogate Modeling
The Journal of Machine Learning Research
Model Selection: Beyond the Bayesian/Frequentist Divide
The Journal of Machine Learning Research
Tuning SVM parameters by using a hybrid CLPSO-BFGS algorithm
Neurocomputing
An energy-based model for region-labeling
Computer Vision and Image Understanding
Information Sciences: an International Journal
Automated design of dependable intelligent sensory systems with self-x properties
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part IV
A probabilistic iterative local search algorithm applied to full model selection
CIARP'11 Proceedings of the 16th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Multi-class particle swarm model selection for automatic image annotation
Expert Systems with Applications: An International Journal
Acute leukemia classification by ensemble particle swarm model selection
Artificial Intelligence in Medicine
Full model selection in the space of data mining operators
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Models of performance of time series forecasters
Neurocomputing
Pairwise meta-rules for better meta-learning-based algorithm ranking
Machine Learning
Hi-index | 0.00 |
This paper proposes the application of particle swarm optimization (PSO) to the problem of full model selection, FMS, for classification tasks. FMS is defined as follows: given a pool of preprocessing methods, feature selection and learning algorithms, to select the combination of these that obtains the lowest classification error for a given data set; the task also includes the selection of hyperparameters for the considered methods. This problem generates a vast search space to be explored, well suited for stochastic optimization techniques. FMS can be applied to any classification domain as it does not require domain knowledge. Different model types and a variety of algorithms can be considered under this formulation. Furthermore, competitive yet simple models can be obtained with FMS. We adopt PSO for the search because of its proven performance in different problems and because of its simplicity, since neither expensive computations nor complicated operations are needed. Interestingly, the way the search is guided allows PSO to avoid overfitting to some extend. Experimental results on benchmark data sets give evidence that the proposed approach is very effective, despite its simplicity. Furthermore, results obtained in the framework of a model selection challenge show the competitiveness of the models selected with PSO, compared to models selected with other techniques that focus on a single algorithm and that use domain knowledge.