Sökning: "Random Trees"
Visar resultat 1 - 5 av 33 avhandlingar innehållade orden Random Trees.
1. Split Trees, Cuttings and Explosions
Sammanfattning : This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. LÄS MER
2. Symmetries in Random Trees
Sammanfattning : .... LÄS MER
3. Symmetry in Randomness : Additive Functionals and Symmetries of Random Trees and Tree-Like Graphs
Sammanfattning : Properties of symmetries in random trees and tree-like graphs are explored. The primary structures studied are Galton-Watson trees, unlabeled unordered trees as well as labeled subcritical graphs. LÄS MER
4. Random Forest for Histogram Data : An application in data-driven prognostic models for heavy-duty trucks
Sammanfattning : Data mining and machine learning algorithms are trained on large datasets to find useful hidden patterns. These patterns can help to gain new insights and make accurate predictions. Usually, the training data is structured in a tabular format, where the rows represent the training instances and the columns represent the features of these instances. LÄS MER
5. Learning Decision Trees and Random Forests from Histogram Data : An application to component failure prediction for heavy duty trucks
Sammanfattning : A large volume of data has become commonplace in many domains these days. Machine learning algorithms can be trained to look for any useful hidden patterns in such data. Sometimes, these big data might need to be summarized to make them into a manageable size, for example by using histograms, for various reasons. LÄS MER
