Sciweavers

1923 search results - page 39 / 385
» Weighted Decision Trees
Sort
View
PDCAT
2005
Springer
15 years 11 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
ICML
2005
IEEE
16 years 6 months ago
Multi-instance tree learning
We introduce a novel algorithm for decision tree learning in the multi-instance setting as originally defined by Dietterich et al. It differs from existing multi-instance tree lea...
Hendrik Blockeel, David Page, Ashwin Srinivasan
ICML
2005
IEEE
16 years 6 months ago
Generalized skewing for functions with continuous and nominal attributes
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
Soumya Ray, David Page
ACL
2001
15 years 7 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
SWAT
2000
Springer
114views Algorithms» more  SWAT 2000»
15 years 9 months ago
Maintaining Center and Median in Dynamic Trees
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
Stephen Alstrup, Jacob Holm, Mikkel Thorup