Sciweavers

5699 search results - page 85 / 1140
» Alternating model trees
Sort
View
IJCAI
1993
15 years 5 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
ROCAI
2004
Springer
15 years 9 months ago
An Empirical Evaluation of Supervised Learning for ROC Area
We present an empirical comparison of the AUC performance of seven supervised learning methods: SVMs, neural nets, decision trees, k-nearest neighbor, bagged trees, boosted trees,...
Rich Caruana, Alexandru Niculescu-Mizil
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 3 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
FOCS
2008
IEEE
15 years 10 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
IMR
2004
Springer
15 years 9 months ago
Reliable Isotropic Tetrahedral Mesh Generation Based on an Advancing Front Method
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...
Yasushi Ito, Alan M. Shih, Bharat K. Soni