dkam/decisiontree
1
0
Fork 0
mirror of https://github.com/dkam/decisiontree.git synced 2025-12-27 22:54:52 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update README.md

Browse Source 
fixed spelling mistake :)
This commit is contained in:
Laura
2018-03-11 23:58:32 -07:00
committed by GitHub
parent 8f73bb64dc
commit a2ec8e08a3
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@@ -6,7 +6,7 @@ A Ruby library which implements ID3 (information gain) algorithm for decision tr
- 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)
## Features
- ID3 algorithms for continuous and discrete cases, with support for incosistent datasets.
- ID3 algorithms for continuous and discrete cases, with support for inconsistent datasets.
- Graphviz component to visualize the learned tree (http://rockit.sourceforge.net/subprojects/graphr/)
- Support for multiple, and symbolic outputs and graphing of continuos trees.
- Returns default value when no branches are suitable for input