Sciweavers

481 search results - page 14 / 97
» Learning relational probability trees
Sort
View
ECML
2003
Springer
14 years 28 days ago
Improving the AUC of Probabilistic Estimation Trees
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...
César Ferri, Peter A. Flach, José He...
ICML
2006
IEEE
14 years 8 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang
ECML
2007
Springer
14 years 1 months ago
Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling
In this paper we investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a n...
Jan Ramon, Kurt Driessens, Tom Croonenborghs
ICML
2009
IEEE
14 years 2 months ago
Decision tree and instance-based learning for label ranking
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
Weiwei Cheng, Jens C. Huhn, Eyke Hüllermeier
BMCBI
2006
72views more  BMCBI 2006»
13 years 7 months ago
Selecting effective siRNA sequences by using radial basis function network and decision tree learning
Background: Although short interfering RNA (siRNA) has been widely used for studying gene functions in mammalian cells, its gene silencing efficacy varies markedly and there are o...
Shigeru Takasaki, Yoshihiro Kawamura, Akihiko Kona...