|
|
|
Description |
This module provides a very simple implementation of a decisiontree. It is "optimized" for readability, not so much for performance. I doubt it can be used for real (=huge) datasets, but it should be ok for a couple of hundred (thousand?) items.
You are encouraged to have a look at the source
It is build (for now) using the ID3 algorithm (or at least something closely resembling that). That means the attributes you choose must have a finite set of possible values.
|
|
Synopsis |
|
|
|
Documentation |
|
|
Build a DecisionTree from the given Trainingset
|
|
|
Decide which label belongs to this Datum
|
|
|
Things we want to find labels for
| Constructors | D | | dName :: String | They have names
| attributes :: [(Attribute a, a)] | and attributes
|
|
| Instances | |
|
|
|
|
|
A Datum has Attributes
| Constructors | A | | aName :: String | Attributes have a name
| possibleValues :: [a] | and a set of possible values
|
|
| Instances | |
|
|
|
The type for our DecisionTree
| Instances | |
|
|
Produced by Haddock version 2.6.0 |