- random tree
-
случайное дерево
Англо-русский словарь технических терминов. 2005.
random tree
Смотреть что такое "random tree" в других словарях:
Rapidly-exploring random tree — A Rapidly exploring Random Tree (RRT) is a data structure and algorithm designed for efficiently searching nonconvex, high dimensional search spaces. Simply put, the tree is constructed in such a way that any sample in the space is added by… … Wikipedia
Rapidly-exploring random tree — (RRT) (dt. etwa schnell erkundender zufälliger Baum) ist ein Suchalgorithmus (und dessen zugrunde liegende Baum Datenstruktur), der hochdimensionale Suchräume zufällig nach möglichen Pfaden absucht. In der Robotik werden der Algorithmus und… … Deutsch Wikipedia
Random minimal spanning tree — In mathematics, random minimal spanning tree, or random MST, is a model (actually two related models) for a random tree (see also minimal spanning tree). It might be compared against the uniform spanning tree, a different model for a random tree… … Wikipedia
Tree breeding — is the application of genetic principles to the genetic improvement and management of forest trees. In contrast to the selective breeding of livestock, arable crops, and horticultural flowers over the last few centuries, the breeding of trees,… … Wikipedia
Random forest — (англ. случайный лес) алгоритм машинного обучения, предложенный Лео Брейманом[1][2] и Адель Катлер, заключающийся в использовании комитета (ансамбля) решающих деревьев. Алгоритм сочетает в себе две основные идеи: метод бэггинга… … Википедия
Random forest — In machine learning, a random forest is a classifier that consists of many decision trees and outputs the class that is the mode of the classes output by individual trees. The algorithm for inducing a random forest was developed by Leo Breiman… … Wikipedia
Random multinomial logit — In statistics and machine learning, random multinomial logit (RMNL) is a technique for (multi class) statistical classification using repeated multinomial logit analyses via Leo Breiman s random forests. Rationale for the new methodSeveral… … Wikipedia
Tree of life — For other uses, see Tree of life (disambiguation). An 1847 depiction of the Norse Yggdrasil as described in the Icelandic Prose Edda by Oluf Olufsen Bagge The concept of a tree of life, a many branched tree illustrating the idea that all life on… … Wikipedia
Random regular graph — A random d regular graph is a graph from mathcal{G} {n,d}, which denotes the probability space of all d regular graphs on vertex set [n] , where nd is even and [n] :={1,2,3,...,n 1,n}, with uniform distribution. Pairing ModelPairing Model, also… … Wikipedia
Loop-erased random walk — In mathematics, loop erased random walk is a model for a random simple path with important applications in combinatorics and, in physics, quantum field theory. It is intimately connected to the uniform spanning tree, a model for a random tree.… … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
