usecase: Concrete Algorithm

public usecase: Concrete Algorithm
Project: Phase: 1.0; Status: Proposed; Version: 1.0; Complexity: 1
Dates: Created: 7.12.2005 22:45:42; Modified: 10.12.2005 10:48:15;
Flags: Active: false; IsRoot: false; IsLeaf: false;
Extension Points:
UUID: {A366629C-C29B-4cb6-A4D0-F92C00DBABE9}

Goto: Scenarios

Extends: General Algorithm

See also: General Algorithm, One Step, Build Whole Tree, Step Building tree

Appears in: Build Tree

Concrete Algorithm Scenarios
Scenario Type Detail
About Basic Path This is realized by CART and ID3. It is not difficult to write a new method, because the ancestor DecTreeMethod provide a very comfort framework.
Initialization Basic Path This is realized by DecTreeMethod.Build and by BuildSpecific of the concrete algorithm.

Preparing of data:

1. Add column with column number (working information) to the chosen table. (The table is already chosen by DecTreeDataBuild dialog).
2. Initialize this column with value 1 - first node - root.

Checking some prerequisites according to a concrete algorithm.