1107 search results - page 74 / 222 » Multi-instance tree learning |
109
click to vote
ILP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
110
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...
131
click to vote
SAC
2006
ACM
15 years 7 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...
111
click to vote
NIPS
2001
15 years 2 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
137
click to vote
UAI
2001
15 years 2 months ago
2001
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...