5463 search results - page 682 / 1093 » Evaluating algorithms that learn from data streams |
201
Voted
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
213
Voted
BMCBI
2008
15 years 7 months ago
2008
Background: Non-homology based methods such as phylogenetic profiles are effective for predicting functional relationships between proteins with no considerable sequence or struct...
193
Voted
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
208
Voted
ECML
2004
Springer
16 years 1 months ago
2004
Springer
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
233
Voted
NIPS
2001
15 years 9 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...