Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ICPR
2004
IEEE

favoriteEmaildiscussreport

229views computer vision» more ICPR 2004»

Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm

14 years 5 months ago

Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm

Download www.livia.etsmtl.ca

In this work, the authors have evaluated almost 20 millions ensembles of classifiers generated by several methods. Trying to optimize those ensembles based on the nearest neighbours and the random subspaces paradigms, we found that the use of a diversity metric called "ambiguity" had no better positive impact than plain stochastic search.

Guillaume Tremblay, Robert Sabourin, Patrick Maupi

Real-time Traffic

Computer Vision | ICPR 2004 | Millions Ensembles | Random Subspaces Paradigms |

claim paper

Related Content

» Genetic algorithms with selforganized criticality for dynamic optimization problems

» Reverse Nearest Neighbors Search in Adhoc Subspaces

» Evolving ensemble of classifiers in random subspace

» An age artificial immune system for order pickings in an ASRS with multiple IO stations

» Optimization of SelfOrganizing Maps Ensemble in Prediction

Post Info
More Details (n/a)

Added	09 Nov 2009
Updated	09 Nov 2009
Type	Conference
Year	2004
Where	ICPR
Authors	Guillaume Tremblay, Robert Sabourin, Patrick Maupin

Comments (0)