Results 1 to 10 of about 246,128 (313)
Rapidly Exploring Random Tree Algorithm-Based Path Planning for Worm-Like Robot. [PDF]
Biomimetics (Basel), 2020 Wang Y +4 more
europepmc +3 more sources
A new machine learning method for rainfall classification: temporal random tree. [PDF]
PeerJ Comput SciBirant KU +3 more
europepmc +3 more sources
Optimal randomized classification trees [PDF]
Computers & Operations Research, 2021 This research has been financed in part by research projects EC H2020 MSCA RISE NeEDS (Grant agreement ID: 822214), FQM-329 and P18-FR-2369 (Junta de Andaluc\'ia), and PID2019-110886RB-I00 (Ministerio de Ciencia, Innovaci\'on y Universidades, Spain).
Blanquero, Rafael +3 more
openaire +3 more sources
Extremely randomized trees [PDF]
Machine Learning, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geurts, Pierre +2 more
openaire +5 more sources
Ergodic Theory and Dynamical Systems, 2013 AbstractWe consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek.
Benjamini, Itai +2 more
openaire +3 more sources
Journal of Statistical Mechanics: Theory and Experiment, 2010 We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from the target node to its most ancient ancestor are equiprobable destinations.
Ben-Naim, E., Krapivsky, P. L.
openaire +2 more sources
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled n n -vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n n increases, and the set of trees referred to as "almost all" depends
Bender, E. A., Wormald, N. C.
openaire +2 more sources
Fragmentation of random trees [PDF]
Journal of Physics A: Mathematical and Theoretical, 2014 We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees,
Kalay, Z, Ben-Naim, E
openaire +2 more sources
Random Hyperplane Search Trees
SIAM Journal on Computing, 2009 Summary: A hyperplane search tree is a binary tree used to store a set \(S\) of \(n\) \(d\)-dimensional data points. In a random hyperplane search tree for \(S\), the root represents a hyperplane defined by \(d\) data points drawn uniformly at random from \(S\).
Devroye, L, King, J, McDiarmid, C
openaire +1 more source
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees [PDF]
Combinatorics, Probability and Computing, 2018 We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree.
openaire +3 more sources