Sciweavers

272 search results - page 6 / 55
» Lazy tree splitting
Sort
View
ICIP
2004
IEEE
14 years 9 months ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler
ISMIS
2003
Springer
14 years 23 days ago
Comparing Simplification Methods for Model Trees with Regression and Splitting Nodes
In this paper we tackle the problem of simplifying tree-based regression models, called model trees, which are characterized by two types of internal nodes, namely regression nodes...
Michelangelo Ceci, Annalisa Appice, Donato Malerba
INTERSPEECH
2010
13 years 2 months ago
A discriminative splitting criterion for phonetic decision trees
Phonetic decision trees are a key concept in acoustic modeling for large vocabulary continuous speech recognition. Although discriminative training has become a major line of rese...
Simon Wiesler, Georg Heigold, Markus Nußbaum...
ENVSOFT
2006
125views more  ENVSOFT 2006»
13 years 7 months ago
Sensitivity analysis based on regional splits and regression trees (SARS-RT)
A global sensitivity analysis with regional properties is introduced. This method is demonstrated on two synthetic and one hydraulic example. It can be shown that an uncertainty a...
Florian Pappenberger, Ion Iorgulescu, Keith J. Bev...
PKDD
1999
Springer
272views Data Mining» more  PKDD 1999»
13 years 11 months ago
Handling Missing Data in Trees: Surrogate Splits or Statistical Imputation
Abstract. In many applications of data mining a - sometimes considerable - part of the data values is missing. This may occur because the data values were simply never entered into...
A. J. Feelders