15 search results - page 2 / 3 » Strong Conditional Independence for Credal Sets |
ICML
1997
IEEE
14 years 8 months ago
1997
IEEE
Heuristic measures for estimating the quality of attributes mostly assume the independence of attributes so in domains with strong dependencies between attributes their performanc...
STACS
2012
Springer
12 years 3 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
FLAIRS
2004
13 years 8 months ago
2004
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...