Sciweavers

1661 search results - page 95 / 333
» Decision Tree Fields
Sort
View
DMIN
2009
136views Data Mining» more  DMIN 2009»
15 years 4 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...
COLT
2004
Springer
15 years 10 months ago
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
Gilles Blanchard, Christin Schäfer, Yves Roze...
IJIT
2004
15 years 7 months ago
Evaluation of Algorithms for Sequential Decision in Biosonar Target Classification
A sequential decision problem, based on the task of identifying the species of trees given acoustic echo data collected from them, is considered with well-known stochastic classifi...
Turgay Temel, John Hallam
FCCM
2004
IEEE
91views VLSI» more  FCCM 2004»
15 years 10 months ago
An FPGA Interpolation Processor for Soft-Decision Reed-Solomon Decoding
We propose a parallel architecture for implementing the interpolation step in the Koetter-Vardy soft-decision ReedSolomon decoding algorithm. The key feature is the embedding of b...
Warren J. Gross, Frank R. Kschischang, P. Glenn Gu...
JCT
2006
110views more  JCT 2006»
15 years 6 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený