16430 search results - page 698 / 3286 » On Computable Tree Functions |
200
click to vote
IDA
2005
Springer
16 years 24 days ago
2005
Springer
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
195
click to vote
ILP
2004
Springer
16 years 19 days ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
157
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
217
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
178
click to vote
SBBD
2007
15 years 8 months ago
2007
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...