Sciweavers

720 search results - page 31 / 144
» Linear k-arboricities on trees
Sort
View
FLAIRS
2010
13 years 11 months ago
Generalized Non-impeding Noisy-AND Trees
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs assessed for each node. Its complexity is generally expon...
Yang Xiang
IPL
2010
71views more  IPL 2010»
13 years 7 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
ECML
2005
Springer
14 years 2 months ago
Model Selection in Omnivariate Decision Trees
We propose an omnivariate decision tree architecture which contains univariate, multivariate linear or nonlinear nodes, matching the complexity of the node to the complexity of the...
Olcay Taner Yildiz, Ethem Alpaydin
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 3 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen