5699 search results - page 5 / 1140 » Alternating model trees |
ML
2002
ACM
14 years 10 months ago
2002
ACM
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
CHI
1994
ACM
15 years 2 months ago
1994
ACM
This paper introduces multitrees, a new type of structure for representing information. Multitrees are a class of directed acyclic graphs (DAGs) with the unusual property that the...
ACSC
2002
IEEE
15 years 3 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
ICML
1999
IEEE
15 years 11 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
CSL
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...