usecase: One Step

public usecase: One Step
Project: Phase: 1.0; Status: Proposed; Version: 1.0; Complexity: 1
Dates: Created: 7.12.2005 23:50:39; Modified: 10.12.2005 10:48:38;
Flags: Active: false; IsRoot: false; IsLeaf: false;
Extension Points:
UUID: {F8B2D0AB-315D-4b17-BE1D-D3473596763D}

Goto: Scenarios

See also: Classification Algorithm, (The recursive cycle started for the actual node)

Appears in: Classification, Classification

One Step Scenarios
Scenario Type Detail
About Basic Path The algorithm is recursive, realized in DecTreeMethod.ClassifyRecursive. The first call is on the root node. One step is done in one actual node. It has several steps:

1. Into the actual node of the tree is written count value with the number of records in the node.
2. For each son of the node, the records that satisfies its SQL condition has marked as this subnode members, they gets a new number to the node column and the ClassifyRecursive is called on them.
3. If there is no son, the node is a leaf, the result class is written to the to the result column and this branch of algorihm is finished.
Split the data Basic Path In the inner node, the data is splitted according to the SQL conditions stored in the subnodes.
Store a result class Basic Path In the leaf node, the class stored in actual DecisionTreeNode is written to the records in this node.