Sciweavers

45 search results - page 6 / 9
» Decision Trees Using the Minimum Entropy-of-Error Principle
Sort
View
MLDM
2005
Springer
14 years 28 days ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé
INTERSPEECH
2010
13 years 2 months ago
Autoregressive clustering for HMM speech synthesis
The autoregressive HMM has been shown to provide efficient parameter estimation and high-quality synthesis, but in previous experiments decision trees derived from a non-autoregre...
Matt Shannon, William Byrne
IHI
2012
249views Healthcare» more  IHI 2012»
12 years 3 months ago
An intelligent web-based decision support tool for enhancing asthma guideline adherence
Asthma is a leading chronic disease of children and currently affects about 6.2 million (8.5%) children in the United States. National Asthma Education and Prevention Program (NAE...
Jinbo Bi, Arun Abraham
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 7 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
CIE
2006
Springer
13 years 11 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante