94 search results - page 3 / 19 » The Random Subspace Method for Constructing Decision Forests |
MCS
2009
Springer
14 years 7 days ago
2009
Springer
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...
ICMLA
2008
13 years 9 months ago
2008
When using the output of classifiers to calculate the expected utility of different alternatives in decision situations, the correctness of predicted class probabilities may be of...
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...