Sciweavers

507 search results - page 3 / 102
» Sizes of Ordered Decision Trees
Sort
View
CBMS
2007
IEEE
14 years 2 months ago
Increasing Acceptability of Decision Trees with Domain Attributes Partial Orders
There are several domains, such as health-care, in which the decision process usually has a background knowledge that must be considered. We need to maximize the accuracy of the m...
Joan Albert López-Vallverdú, David R...
KDD
1999
ACM
185views Data Mining» more  KDD 1999»
13 years 12 months ago
Visual Classification: An Interactive Approach to Decision Tree Construction
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
Mihael Ankerst, Christian Elsen, Martin Ester, Han...
PAAPP
2006
85views more  PAAPP 2006»
13 years 7 months ago
A new metric splitting criterion for decision trees
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partiti...
Dan A. Simovici, Szymon Jaroszewicz
PLANX
2007
13 years 9 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
JSAT
2010
158views more  JSAT 2010»
13 years 2 months ago
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...
Olga Tveretina, Carsten Sinz, Hans Zantema