Results 281 to 290 of about 452,858 (310)
Some of the next articles are maybe not open access.
Soft Computing, 2018
Random forest (RF) is an ensemble learning method, and it is considered a reference due to its excellent performance. Several improvements in RF have been published. A kind of improvement for the RF algorithm is based on the use of multivariate decision trees with local optimization process (oblique RF).
CARLOS J Mantas +2 more
exaly +2 more sources
Random forest (RF) is an ensemble learning method, and it is considered a reference due to its excellent performance. Several improvements in RF have been published. A kind of improvement for the RF algorithm is based on the use of multivariate decision trees with local optimization process (oblique RF).
CARLOS J Mantas +2 more
exaly +2 more sources
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
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
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
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 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
WIREs Data Mining and Knowledge Discovery, 2011
AbstractRandom forests have emerged as a versatile and highly accurate classification and regression methodology, requiring little tuning and providing interpretable outputs. Here, we briefly outline the genesis of, and motivation for, the random forest paradigm as an outgrowth from earlier tree‐structured techniques.
Mark R. Segal, Yuanyuan Xiao
openaire +1 more source
AbstractRandom forests have emerged as a versatile and highly accurate classification and regression methodology, requiring little tuning and providing interpretable outputs. Here, we briefly outline the genesis of, and motivation for, the random forest paradigm as an outgrowth from earlier tree‐structured techniques.
Mark R. Segal, Yuanyuan Xiao
openaire +1 more source
Random Structures & Algorithms, 1994
AbstractA random recursive forest is defined as a union of random recursive trees. We find the expected number of trees in the uniform random recursive forest as well as the number of vertices of given degree, the maximum degree, the height of vertices, the order of branches, the root of the component containing a given vertex, and the last root of ...
Krystyna T. Balinska +2 more
openaire +1 more source
AbstractA random recursive forest is defined as a union of random recursive trees. We find the expected number of trees in the uniform random recursive forest as well as the number of vertices of given degree, the maximum degree, the height of vertices, the order of branches, the root of the component containing a given vertex, and the last root of ...
Krystyna T. Balinska +2 more
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
2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops, 2009
Random Forests (RFs) are frequently used in many computer vision and machine learning applications. Their popularity is mainly driven by their high computational efficiency during both training and evaluation while achieving state-of-the-art results. However, in most applications RFs are used off-line.
Amir Saffari +4 more
openaire +1 more source
Random Forests (RFs) are frequently used in many computer vision and machine learning applications. Their popularity is mainly driven by their high computational efficiency during both training and evaluation while achieving state-of-the-art results. However, in most applications RFs are used off-line.
Amir Saffari +4 more
openaire +1 more source