Results 231 to 240 of about 404,815 (264)
Journal of Insurance Medicine, 2017 For the task of analyzing survival data to derive risk factors associated with mortality, physicians, researchers, and biostatisticians have typically relied on certain types of regression techniques, most notably the Cox model. With the advent of more widely distributed computing power, methods which require more complex mathematics have become ...
Steven J. Rigatti
openaire +3 more sources
Reinforced random forest [PDF]
Proceedings of the Tenth Indian Conference on Computer Vision, Graphics and Image Processing, 2016 Reinforcement learning improves classification accuracy. But use of reinforcement learning is relatively unexplored in case of random forest classifier. We propose a reinforced random forest (RRF) classifier that exploits reinforcement learning to improve classification accuracy. Our algorithm is initialized with a forest. Then the entire training data
Angshuman Paul, Dipti Prasad Mukherjee
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On learning Random Forests for Random Forest-clustering
2020 25th International Conference on Pattern Recognition (ICPR), 2021In this paper we study the poorly investigated problem of learning Random Forests for distance-based Random Forest clustering. We studied both classic schemes as well as alternative approaches, novel in this context. In particular, we investigated the suitability of Gaussian Density Forests [1], Random Forests specifically designed for density ...
Bicego, M, Escolano, F
openaire +2 more sources
Identifying Forest Fire Driving Factors and Related Impacts in China Using Random Forest Algorithm [PDF]
Forests, 2020 Reasonable forest fire management measures can effectively reduce the losses caused by forest fires and forest fire driving factors and their impacts are important aspects that should be considered in forest fire management.
Zhongke Feng, Shilin Chen, Wenyuan Ma
exaly +2 more sources
Assessment of Sentinel-2 Satellite Images and Random Forest Classifier for Rainforest Mapping in Gabon [PDF]
Forests, 2020 This study is focused on the assessment of the potential of Sentinel-2 satellite images and the Random Forest classifier for mapping forest cover and forest types in northwest Gabon.
Adam Waśniewski +2 more
exaly +2 more sources
Combinatorics, Probability and Computing, 1992
A forest ℱ(n, M) chosen uniformly from the family of all labelled unrooted forests with n vertices and M edges is studied. We show that, like the Érdős-Rényi random graph G(n, M), the random forest exhibits three modes of asymptotic behaviour: subcritical, nearcritical and supercritical, with the phase transition at the point M = n/2.
Tomasz Luczak 0001, Boris G. Pittel
openaire +2 more sources
A forest ℱ(n, M) chosen uniformly from the family of all labelled unrooted forests with n vertices and M edges is studied. We show that, like the Érdős-Rényi random graph G(n, M), the random forest exhibits three modes of asymptotic behaviour: subcritical, nearcritical and supercritical, with the phase transition at the point M = n/2.
Tomasz Luczak 0001, Boris G. Pittel
openaire +2 more sources
Pattern Recognition, 2022
Abstract Despite the impressive performance of random forests (RF), its theoretical properties have not been thoroughly understood. In this paper, we propose a novel RF framework, dubbed multinomial random forest (MRF), to analyze its consistency and privacy-preservation.
Jiawang Bai +5 more
openaire +1 more source
Abstract Despite the impressive performance of random forests (RF), its theoretical properties have not been thoroughly understood. In this paper, we propose a novel RF framework, dubbed multinomial random forest (MRF), to analyze its consistency and privacy-preservation.
Jiawang Bai +5 more
openaire +1 more source
2013 2nd IAPR Asian Conference on Pattern Recognition, 2013
We present an effective image representation based on a new tree-structured coding technique called `random decomposition forests' (RDFs). Our method combines the merits of visual-word representations and random forests. The proposed RDF is able to decompose a local descriptor into multiple sets of visual words in a recursive and randomized manner.
Chun-Han Chien, Hwann-Tzong Chen
openaire +1 more source
We present an effective image representation based on a new tree-structured coding technique called `random decomposition forests' (RDFs). Our method combines the merits of visual-word representations and random forests. The proposed RDF is able to decompose a local descriptor into multiple sets of visual words in a recursive and randomized manner.
Chun-Han Chien, Hwann-Tzong Chen
openaire +1 more source
Proceedings of the AAAI Conference on Artificial Intelligence, 2016
We introduce a broad family of decision trees, Composite Trees, whose leaf classifiers are selected out of a hypothesis set composed of p subfamilies with different complexities. We prove new data-dependent learning guarantees for this family in the multi-class setting.
Giulia DeSalvo, Mehryar Mohri
openaire +1 more source
We introduce a broad family of decision trees, Composite Trees, whose leaf classifiers are selected out of a hypothesis set composed of p subfamilies with different complexities. We prove new data-dependent learning guarantees for this family in the multi-class setting.
Giulia DeSalvo, Mehryar Mohri
openaire +1 more source
Proceedings of 3rd International Conference on Document Analysis and Recognition, 2002
Decision trees are attractive classifiers due to their high execution speed. But trees derived with traditional methods often cannot be grown to arbitrary complexity for possible loss of generalization accuracy on unseen data. The limitation on complexity usually means suboptimal accuracy on training data.
openaire +1 more source
Decision trees are attractive classifiers due to their high execution speed. But trees derived with traditional methods often cannot be grown to arbitrary complexity for possible loss of generalization accuracy on unseen data. The limitation on complexity usually means suboptimal accuracy on training data.
openaire +1 more source