DecisionTree: A very simple implementation of decision trees for discrete attributes.

[ algorithms, library, pattern-classification ] [ Propose Tags ]

A very simple implementation of decision trees, built with ID3. You can use it to classify data with a set of discrete attributes.

[Skip to Readme]

Modules

[Index]

Data
- Data.DecisionTree

Downloads

DecisionTree-0.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

AdrianNeumann

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	0.0
Dependencies	base, containers (>=0.2.0.0) [details]
License	LicenseRef-LGPL
Author	Adrian Neumann
Maintainer	aneumann@inf.fu-berlin.de
Category	Algorithms, Pattern Classification
Home page	http://page.mi.fu-berlin.de/~aneumann/decisiontree.html
Uploaded	by AdrianNeumann at 2009-01-25T07:31:12Z
Distributions
Reverse Dependencies	1 direct, 0 indirect [details]
Downloads	2122 total (5 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs uploaded by user Build status unknown [no reports yet]

Readme for DecisionTree-0.0

[back to package description]

This is the DecisionTree library. 
Build it as you would build any cabal package. Have a look at the Haskellwiki (haskell.org) if you don't know how.

Feel free to send me patches, comments, suggestions.