Sha256: c2507b544d538e01f8993b99b3eac7572c33e37b3fa0fdce64abb5270d0d0b55

Contents?: true

Size: 776 Bytes

Versions: 3

Compression:

Stored size: 776 Bytes

Contents

README for decision_tree
========================

A ruby library which implements ID3 (information gain) algorithm for decision tree learning. Currently, continuous and discrete datasets can be learned.

- Discrete assumes unique labels, can be graphed and converted into a png for visual analysis
- Continuous looks at all possible values for a variable and iteratively chooses the best threshold between all possible assignments. This results in a binary tree which is partitioned by the threshold at every step. (e.g. temperate > 20C)

Currently, graphing works properly only for discrete cases due to a limitation in graphviz code.
 
Graphviz dependency: http://rockit.sourceforge.net/subprojects/graphr/

Enjoy.

Ilya Grigorik (ilya <at> fortehost DOT com)

Version data entries

3 entries across 3 versions & 1 rubygems

Version Path
decisiontree-0.1.0 README.txt
decisiontree-0.2.0 README.txt
decisiontree-0.3.0 README.txt