Sciweavers

1060 search results - page 33 / 212
» On the Discovery of Random Trees
Sort
View
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
15 years 4 months ago
Combinatorial Models for Cooperation Networks
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
CVPR
2003
IEEE
15 years 3 months ago
Adaptive Pattern Discovery for Interactive Multimedia Retrieval
Relevance feedback has been an indispensable component for multimedia retrieval systems. In this paper, we present an adaptive pattern discovery method, which addresses relevance ...
Yimin Wu, Aidong Zhang
IPPS
1998
IEEE
15 years 2 months ago
A Survey of Randomness and Parallelism in Comparison Problems
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
Danny Krizanc
ICIP
2010
IEEE
14 years 8 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao
MCS
2009
Springer
15 years 2 months ago
Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data
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 ...
Amir Ahmad, Gavin Brown