Sciweavers

188 search results - page 14 / 38
» Random Forests and Kernel Methods
Sort
View
ECAI
2008
Springer
13 years 9 months ago
MTForest: Ensemble Decision Trees based on Multi-Task Learning
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
Qing Wang, Liang Zhang, Mingmin Chi, Jiankui Guo
ICPR
2002
IEEE
14 years 8 months ago
Robust Appearance-Based Object Recognition Using a Fully Connected Markov Random Field
This paper presents a new kernel method for appearance-based object recognition, highly robust to noise and occlusion. It consists of a fully connected Markov Random Field that in...
Barbara Caputo, Sahla Bouattour, Heinrich Niemann
JAIR
2008
93views more  JAIR 2008»
13 years 7 months ago
Spectrum of Variable-Random Trees
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
Fei Tony Liu, Kai Ming Ting, Yang Yu, Zhi-Hua Zhou
ICPR
2006
IEEE
14 years 8 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
CVPR
2011
IEEE
13 years 3 months ago
Combining Randomization and Discrimination for Fine-Grained Image Categorization
In this paper, we study the problem of fine-grained image categorization. The goal of our method is to explore fine image statistics and identify the discriminative image patche...
Bangpeng Yao, Aditya Khosla, Li Fei-Fei