188 search results - page 16 / 38 » Random Forests and Kernel Methods |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...
21
Voted
DGCI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Watershed segmentation of spectral images is typically achieved by first transforming the high-dimensional input data into a scalar boundary indicator map which is used ...
ICONIP
2008
13 years 9 months ago
2008
In this paper, we present the performance of machine learning-based methods for detection of phishing sites. We employ 9 machine learning techniques including AdaBoost, Bagging, S...
BIBE
2005
IEEE
14 years 1 months ago
2005
IEEE
We introduce a new ensemble method based on decision tree to discover significant and diversified rules for subtype classification of childhood acute lymphoblastic leukemia, a ...
ML
2006
ACM
13 years 7 months ago
2006
ACM
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...