Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 723 for “"random forests"”.

  1. Streaming Random Forests

    … ensemble algorithm, Streaming Random Forests, an extension of the Random Forests algorithm by Breiman, which is a standard classification algorithm. Our algorithm is designed to handle multi-class classification problems. It is able to deal with data streams having an evolving …

    queens Repository record for Streaming Random Forests (opens in a new tab)

  2. Random forests on trees

    … model is related to other models such as the random cluster measure. We mainly study the Arboreal gas and a related model on the $d$-ary wired tree which is simply the $d$-ary wired tree with the leaves identified as a single vertex. Our first result is finding a distribution on the infinite …

    uvic Repository record for Random forests on trees (opens in a new tab)

  3. An Interval-Valued Random Forests

    There is a growing demand for the development of new statistical models and the refinement of established methods to accommodate different data structures. This need arises from the recognition that traditional statistics often assume the value of each observation to be precise, which may not hold …

    utahstate Repository record for An Interval-Valued Random Forests (opens in a new tab)

  4. Active learning with random forests

    … we take advantage of the nice properties of the random forest algorithm to do active learning in a computationally economical way. In Chapter 2, we rigorously establish that random forests are stable under mild conditions. This result not only serves as the theoretical foundation of our method, …

    iastate Repository record for Active learning with random forests (opens in a new tab)

  5. Pseudo Random Forests for Tube Identification

    Random forests are widely used in machine learning as they can potentially offer higher accuracy than individual decision trees by the averaging of multiple independent models. We propose a modification called “Pseudo-random forests” that combines stochastic feature selection with dynamic …

    umkc Repository record for Pseudo Random Forests for Tube Identification (opens in a new tab)

  6. Analysis of missing data with random forests

    Random Forests are widely used for data prediction and interpretation purposes. They show many appealing characteristics, such as the ability to deal with high dimensional data, complex interactions and correlations. Furthermore, missing values can easily be processed by the built-in procedure of …

    lmu-germany Repository record for Analysis of missing data with random forests (opens in a new tab)

  7. Improving random forests by feature dependence analysis

    Random forests (RFs) have been widely used for supervised learning tasks because of their high prediction accuracy good model interpretability and fast training process. However they are not able to learn from local structures as convolutional neural networks (CNNs) do when there exists high …

    mississippi Repository record for Improving random forests by feature dependence analysis (opens in a new tab)

  8. Understanding Random Forests: From Theory to Practice

    … thesis is to provide an in-depth analysis of random forests, consistently calling into question each and every part of the algorithm, in order to shed new light on its learning capabilities, inner workings and interpretability. The first part of this work studies the induction of decision …

    liege Repository record for Understanding Random Forests: From Theory to Practice (opens in a new tab) Download PDF for Understanding Random Forests: From Theory to Practice (opens in a new tab)

  9. Investigations of Variable Importance Measures Within Random Forests

    Random Forests (RF) (Breiman 2001; Breiman and Cutler 2004) is a completely nonparametric statistical learning procedure that may be used for regression analysis and. A feature of RF that is drawing a lot of attention is the novel algorithm that is used to evaluate the relative importance of the …

    utahstate Repository record for Investigations of Variable Importance Measures Within Random Forests (opens in a new tab)

  10. Extensions and Improvements to Random Forests for Classification

    … my dissertation is to improve two weaknesses of Random Forests. One, the failure to detect genetic interactions between two single nucleotide polymorphisms (SNPs) in higher dimensions when the interacting SNPs both have weak main effects and two, the difficulty of interpretation in comparison to …

    utahstate Repository record for Extensions and Improvements to Random Forests for Classification (opens in a new tab)

  11. Large Margin Random Forests On Mixed Type Data

    … is thus important. We propose a large margin random forests classification approach based on random forests proximity. Random forests accommodate mixed data types naturally. Large margin classifiers are obtained from the random forests proximity kernel or its derivative kernels. We test the …

    mississippi Repository record for Large Margin Random Forests On Mixed Type Data (opens in a new tab)

  12. Random Forests Based Rule Learning And Feature Elimination

    … feature elimination, based on 1-norm regularized random forests. This approach simultaneously extracts a small number of rules generated by random forests and selects important features. To evaluate this approach, we have applied it to several drug activity prediction data sets, microarray data …

    mississippi Repository record for Random Forests Based Rule Learning And Feature Elimination (opens in a new tab)

  13. Principles of machine learning - Random forests and applications

    Αυτή η μεταπτυχιακή εργασία εμπεριέχει μια σύντομη εισαγωγή στη θεωρία μηχανικής μάθησης (από μία στατιστική προοπτική), η οποία προσφέρει αυτοματοποιημένες διαδικασίες για την πρόβλεψη ενός φαινομένου βασισμένη σε παρελθοντικές παρατηρήσεις. Τονίζονται οι ομοιότητες και οι διαφορές μεταξύ των …

    athens Repository record for Principles of machine learning - Random forests and applications (opens in a new tab)

  14. Shape-restricted random forests and semiparametric prediction intervals

    … to generate prediction intervals for random forests. We compare these methods via simulation. We also apply a subset of these methods to a drug-discovery data analysis problem.</p> <p>Chapter 4 introduces multiple monotone restriction methods for random forest predictions. We compare …

    iastate Repository record for Shape-restricted random forests and semiparametric prediction intervals (opens in a new tab)

  15. THE USE OF RANDOM FORESTS IN PROPENSITY SCORE WEIGHTING

    … score. Recently, a machine learning method, random forests, has been proposed as an alternative to the conventional method of logistic regression to estimate the propensity score as it requires less stringent assumptions and provides less biased and more reliable estimate of the treatment …

    maryland Repository record for THE USE OF RANDOM FORESTS IN PROPENSITY SCORE WEIGHTING (opens in a new tab)

  16. Enhancement of Random Forests Using Trees with Oblique Splits

    … is made by aggregating many trees created from randomly sampled data into a Random Forest, similarly to consulting several doctors with different training backgrounds before stating a subtle diagnosis. In this work the tree classification algorithm was enhanced with the ability to consider the …

    utahstate Repository record for Enhancement of Random Forests Using Trees with Oblique Splits (opens in a new tab)

  17. Importance measures derived from random forests: characterisation and extension

    Nowadays new technologies, and especially artificial intelligence, are more and more established in our society. Big data analysis and machine learning, two sub-fields of artificial intelligence, are at the core of many recent breakthroughs in many application fields (e.g., medicine, communication, …

    liege Repository record for Importance measures derived from random forests: characterisation and extension (opens in a new tab) Download PDF for Importance measures derived from random forests: characterisation and extension (opens in a new tab)

  18. Budget allocation on differentially private decision trees and random forests

    … of differential privacy on decision trees and forests. This thesis focuses on the dynamic privacy budget allocation algorithm to have more control over the consumption of the budget in the data mining techniques. There are three contributions in this thesis. Contribution 1 proposes a …

    uts Repository record for Budget allocation on differentially private decision trees and random forests (opens in a new tab)

Page 1 of 37