Sciweavers

447 search results - page 11 / 90
» Decision trees with minimal costs
Sort
View
INTERSPEECH
2010
13 years 3 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...
ICML
2001
IEEE
14 years 9 months ago
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...
Bianca Zadrozny, Charles Elkan
CORR
2004
Springer
125views Education» more  CORR 2004»
13 years 8 months ago
Traffic Accident Analysis Using Decision Trees and Neural Networks
The costs of fatalities and injuries due to traffic accident have a great impact on society. This paper presents our research to model the severity of injury resulting from traffi...
Miao M. Chong, Ajith Abraham, Marcin Paprzycki
ADHOCNOW
2005
Springer
14 years 2 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 8 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan