Sciweavers

63 search results - page 10 / 13
» Kernelizing the output of tree-based methods
Sort
View
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 7 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
ESANN
2006
13 years 9 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
SAC
2009
ACM
14 years 2 months ago
A gradient oriented recombination scheme for evolution strategies
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
Haifeng Chen, Guofei Jiang
TKDE
2002
133views more  TKDE 2002»
13 years 7 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
SMC
2007
IEEE
123views Control Systems» more  SMC 2007»
14 years 2 months ago
Logarithmic edge detection with applications
—In real world machine vision problems, numerous issues such as variable scene illumination make edge and object detection difficult. There exists no universal edge detection met...
Eric J. Wharton, Karen Panetta, Sos S. Agaian