Sciweavers

94 search results - page 7 / 19
» The Random Subspace Method for Constructing Decision Forests
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
14 years 8 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
ICPR
2010
IEEE
14 years 1 months ago
On-Line Random Naive Bayes for Tracking
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
Martin Godec, Christian Leistner, Amir Saffari, Ho...
ICPR
2008
IEEE
14 years 9 months ago
The implication of data diversity for a classifier-free ensemble selection in random subspaces
Ensemble of Classifiers (EoC) has been shown effective in improving the performance of single classifiers by combining their outputs. By using diverse data subsets to train classi...
Albert Hung-Ren Ko, Robert Sabourin, Luiz E. Soare...
ACCV
2010
Springer
13 years 2 months ago
Randomised Manifold Forests for Principal Angle-Based Face Recognition
Abstract. In set-based face recognition, each set of face images is often represented as a linear/nonlinear manifold and the Principal Angles (PA) or Kernel PAs are exploited to me...
Ujwal D. Bonde, Tae-Kyun Kim, K. R. Ramakrishnan