1248 search results - page 107 / 250 » Decision Tree Grafting |
144
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
109
click to vote
ICPR
2002
IEEE
15 years 9 months ago
2002
IEEE
Output Coding is a method of converting a multiclass problem into several binary subproblems and gives an ensemble of binary classifiers. Like other ensemble methods, its perform...
139
click to vote
PLANX
2008
15 years 6 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
151
click to vote
AAAI
1996
15 years 6 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
186
click to vote
NAACL
2010
15 years 2 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...