Sciweavers

121 search results - page 21 / 25
» Algorithms for optimal dyadic decision trees
Sort
View
IJBRA
2007
80views more  IJBRA 2007»
14 years 11 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip
90
Voted
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
15 years 6 months ago
Rule Ensembles for Multi-target Regression
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
Timo Aho, Bernard Zenko, Saso Dzeroski
98
Voted
ICCV
2009
IEEE
16 years 4 months ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
ICS
2010
Tsinghua U.
15 years 9 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
SSPR
2004
Springer
15 years 5 months ago
Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Fatih Murat Porikli