249 search results - page 37 / 50 » Classification with Belief Decision Trees |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
: Boosting is a general method for improving the accuracy of any given learning algorithm. In this paper we employ combination of Adaboost with Support Vector Machine (SVM) as comp...
ADMA
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a study on the combination of different classifiers for toxicity prediction. Two combination operators for the Multiple-Classifier System definition are also pr...
CSDA
2008
13 years 9 months ago
2008
ABSTRACT. This paper introduces a tree-based model that combines aspects of CART (Classification and Regression Trees) and STR (Smooth Transition Regression). The model is called t...
CC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
FSKD
2006
Springer
14 years 18 days ago
2006
Springer
This paper presents an investigation into the combination of different classifiers for toxicity prediction. These classification methods involved in generating classifiers for comb...