Grafting (algorithm)
Encyclopedia
In computer science
, grafting is a method used to manipulate trees. One such tree is an ordered tree
, which is where the subtrees for any node are ordered. Let root(T1), ..., root(Tn) be the children of root(T) and root(Ti) be the ith child. A suitable representation of ordered trees is to make them a rooted binary tree
, where each node is stored in the same amount of memory.
The conversion to a rooted binary tree root(T) is:
1. For each child of root(T), remove all the edges from the child to the parent.
2. For each node:
a. Add an edge to the first child (if one exists) as the left child.
b. Add an edge to the next sibling (if one exists) as the right child.
Grafting can identify regions where there are no occupancies and correct the poor class assignments to increase accuracy. The extension to graft multiple branches at each leaf reduces the number of errors.
Computer science
Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...
, grafting is a method used to manipulate trees. One such tree is an ordered tree
Tree (graph theory)
In mathematics, more specifically graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one simple path. In other words, any connected graph without cycles is a tree...
, which is where the subtrees for any node are ordered. Let root(T1), ..., root(Tn) be the children of root(T) and root(Ti) be the ith child. A suitable representation of ordered trees is to make them a rooted binary tree
Rooted binary tree
In computer science, a rooted binary tree is a tree with a root node in which every node has at most two children. A rooted binary tree is a tree with a root which has degree 2 and all other nodes of degree 3....
, where each node is stored in the same amount of memory.
The conversion to a rooted binary tree root(T) is:
1. For each child of root(T), remove all the edges from the child to the parent.
2. For each node:
a. Add an edge to the first child (if one exists) as the left child.
b. Add an edge to the next sibling (if one exists) as the right child.
Grafting can identify regions where there are no occupancies and correct the poor class assignments to increase accuracy. The extension to graft multiple branches at each leaf reduces the number of errors.
See also
- Grafting and pruningPruning (decision trees)Pruning is a technique in machine learning that reduces the size of decision trees by removing sections of the tree that provide little power to classify instances...
for decision treeDecision treeA decision tree is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. It is one way to display an algorithm. Decision trees are commonly used in operations research, specifically...
s - Left child-right sibling binary treeLeft child-right sibling binary treeIn computer science, a left child-right sibling binary tree is a binary tree representation of a k-ary tree. The process of converting from a k-ary tree to an LC-RS binary tree is not reversible in general without additional information....