usecase: General Algorithm

public usecase: General Algorithm
Project: Phase: 1.0; Status: Proposed; Version: 1.0; Complexity: 1
Dates: Created: 7.12.2005 22:44:20; Modified: 10.12.2005 10:48:15;
Flags: Active: false; IsRoot: false; IsLeaf: false;
Extension Points:
UUID: {6655B502-E549-42e3-A694-F03E03316C2B}

Goto: Scenarios

See also: Concrete Algorithm

Appears in: Build Tree

General Algorithm Scenarios
Scenario Type Detail
About Basic Path It is realized by DecTreeMethod - abstract class. This class provides a comfort framework for programming concrete building methods. You have to override only these methods:

1. DescribeMethod - information for stepping and debuging
2. BuildSpecific - special initialization of new method building
3. CompareSplitters - tells which of two splitters is better
4. GetSplitters - returns a list of possible splitters in some node
Splitters idea Basic Path The splitter is instance of some DecTreeSplitter and describes how to split data. It has its own implementation for all the concrete algorithms (e.g. CARTSplitter, ID3Splitter). DecTreeMethod works only with general DecTreeSplitter class.

The interface of the splitter (DecTreeSplitter) is simple:
It has the Count value and it has a method SQLWhere which returns a SQL conditions for every part of splitted data. The parts are adressed by a number from 0 to Count -1. There are also some other methods for describing splitter, but there are not so important.