Sciweavers

20 search results - page 2 / 4
» On the Complexity of Branching Programs and Decision Trees f...
Sort
View
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 2 days 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...
JUCS
2006
107views more  JUCS 2006»
13 years 5 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
CVPR
2010
IEEE
14 years 1 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 5 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
CEC
2010
IEEE
13 years 6 months ago
Improving GP classification performance by injection of decision trees
This paper presents a novel hybrid method combining genetic programming and decision tree learning. The method starts by estimating a benchmark level of reasonable accuracy, based ...
Rikard König, Ulf Johansson, Tuve Löfstr...