254 search results - page 9 / 51 » Multi-interval Discretization Methods for Decision Tree Lear... |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
JAIR
2011
13 years 2 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...