Sciweavers

188 search results - page 2 / 38
» Random Forests and Kernel Methods
Sort
View
NDT
2010
13 years 3 months ago
Web Document Classification by Keywords Using Random Forests
Web directory hierarchy is critical to serve user’s search request. Creating and maintaining such directories without human experts involvement requires good classification of we...
Myungsook Klassen, Nikhila Paturi
ICMLA
2008
13 years 6 months ago
Calibrating Random Forests
When using the output of classifiers to calculate the expected utility of different alternatives in decision situations, the correctness of predicted class probabilities may be of...
Henrik Boström
ILP
2004
Springer
13 years 10 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
NIPS
2001
13 years 6 months ago
Sampling Techniques for Kernel Methods
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels: sampling and quantization of the Gram matrix in training, randomized rounding...
Dimitris Achlioptas, Frank McSherry, Bernhard Sch&...
TRECVID
2008
13 years 6 months ago
Oxford/IIIT TRECVID 2008 - Notebook paper
The Oxford/IIIT team participated in the high-level feature extraction and interactive search tasks. A vision only approach was used for both tasks, with no use of the text or aud...
James Philbin, Manuel J. Marín-Jimén...