Sciweavers

1923 search results - page 133 / 385
» Weighted Decision Trees
Sort
View
JMLR
2010
104views more  JMLR 2010»
15 years 1 months ago
How to Explain Individual Classification Decisions
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the...
David Baehrens, Timon Schroeter, Stefan Harmeling,...
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 11 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
PR
2007
81views more  PR 2007»
15 years 5 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
JCB
2000
101views more  JCB 2000»
15 years 6 months ago
Evaluation Measures of Multiple Sequence Alignments
Multiple sequence alignments (MSAs) are frequently used in the study of families of protein sequences or DNA/RNA sequences. They are a fundamental tool for the understanding of th...
Gaston H. Gonnet, Chantal Korostensky, Steven A. B...
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 6 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer