Results 21 to 30 of about 338,729 (282)
Non-unitarisable representations and random forests [PDF]
We establish a connection between Dixmier's unitarisability problem and the expected degree of random forests on a group. As a consequence, a residually finite group is non-unitarisable if its first L2-Betti number is non-zero or if it is finitely ...
Epstein, Inessa, Monod, Nicolas
core +3 more sources
Given an ensemble of randomized regression trees, it is possible to restructure them as a collection of multilayered neural networks with particular connection weights. Following this principle, we reformulate the random forest method of Breiman (2001) into a neural network setting, and in turn propose two new hybrid procedures that we call neural ...
Biau, Gérard +2 more
openaire +3 more sources
Space partitioning methods such as random forests and the Mondrian process are powerful machine learning methods for multi-dimensional and relational data, and are based on recursively cutting a domain. The flexibility of these methods is often limited by the requirement that the cuts be axis aligned.
Ge, S +4 more
openaire +4 more sources
Tuning parameters in random forests
Breiman's (2001) random forests are a very popular class of learning algorithms often able to produce good predictions even in high-dimensional frameworks, with no need to accurately tune its inner parameters.
Scornet Erwan
doaj +1 more source
RFDCR:Automated brain lesion segmentation using cascaded random forests with dense conditional random fields [PDF]
Segmentation of brain lesions from magnetic resonance images (MRI) is an important step for disease diagnosis, surgical planning, radiotherapy and chemotherapy.
Chen, Gaoxiang +5 more
core +2 more sources
Soil Mapping Based on the Integration of the Similarity-Based Approach and Random Forests
Digital soil mapping (DSM) is currently the primary framework for predicting the spatial variation of soil information (soil type or soil properties). Random forests and similarity-based methods have been used widely in DSM.
Desheng Wang, A-Xing Zhu
doaj +1 more source
Aggregated Recommendation through Random Forests
Aggregated recommendation refers to the process of suggesting one kind of items to a group of users. Compared to user-oriented or item-oriented approaches, it is more general and, therefore, more appropriate for cold-start recommendation.
Heng-Ru Zhang, Fan Min, Xu He
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sunwoo Han, Hyunjoong Kim, Yung-Seop Lee
openaire +1 more source
Random forests are known to be good for data mining of classification tasks, because random forests are robust for datasets having insufficient information possibly with some errors. But applying random forests blindly may not produce good results, and a
Hyontai Sug
doaj +1 more source
Conditional variable importance for random forests
Background Random forests are becoming increasingly popular in many scientific fields because they can cope with "small n large p" problems, complex interactions and even highly correlated predictor variables.
Augustin Thomas +4 more
doaj +1 more source

