Decision tree classifier implemented using gini index splitting
Project description
DEEPTREE
A simple Decision Tree Classifier
Overview
This project is a custom implementation of a decision tree classifier inspired from scikit-learn-decision-tree-classifier. The classifier is built from scratch without any external dependencies.
Gini index is used by the classifier to construct the decision tree. Using the gini index for partitioning has allowed the classifier to handle both continuous and categorical features. This allows the classifier to be used in a wider range of applications and datasets.
In addition, the classifier also includes a basic tree printing functionality, which can be used to visualize the tree structure and gain a better understanding of how the classifier is making its decisions.
Features
- No external dependencies
- Handles both continuous and categorical features
- Uses Gini index to measure impurity of partion
- Includes basic tree printing functionality for tree visualization
Requirements
Python 3.x [Optional] Any text editor or IDE of your choice for editing the code.
Installation
deeptree can be installed using the following command:
pip install deeptree
or
pip3 install deeptree
Dependencies
deeptree is built using only in built python libraries.
Functionalities
The functions in deeptree package come as part of two classes Node and Classifier. The functions are:-
deeptree.Node.get_feature_midpoints(i=0)
This function finds the midpoints for any continuous feature corresponding to index 'i' in the dataset.
deeptree.Node.get_splitting_subsets(i=0)
This function finds the splitting subsets for any discrete feature corresponding to index 'i' in the dataset.
deeptree.Node.get_gini_value()
This function calculates the gini value of the deeptree node.
deeptree.Classifier.fit(dataset=[],label_index=-1)
This function trains the decision tree classifier on the given dataset.
deeptree.Classifier.predict(dataset=[]):
This function predicts the labels/classes of the given dataset.
deeptree.Classifier.print_tree(node, level=0)
This function prints the structure of the decision tree with the details at each node.
Example on how to use deeptree are provided in example.py. The example is based on the iris.data dataset downloaded from UCI achine learning repository.
License
MIT License
Acknowledgments
The source code for this project was created as part of one of the courseworks for MSc. Data Science program at Lancaster University. Thanks to Leandro Soriano Marcolino for his amazing classes and this coursework topic.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file deeptree-0.0.2.tar.gz.
File metadata
- Download URL: deeptree-0.0.2.tar.gz
- Upload date:
- Size: 8.3 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.9.6
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
dc87a0d1424d75f75db14aae56457177fb9cd94597b501d74a2de6b35189826f
|
|
| MD5 |
02eac88718c529d5a6eb9178cad0c87c
|
|
| BLAKE2b-256 |
57ee199aae996e87d72e0fece3d7dfb25d98e114378d2d8d43d6bbba245ffff2
|
File details
Details for the file deeptree-0.0.2-py3-none-any.whl.
File metadata
- Download URL: deeptree-0.0.2-py3-none-any.whl
- Upload date:
- Size: 8.6 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.9.6
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
deea7b2158a2491a73e85e029e8257b9a8aed41092792ad79109e19cad1228fd
|
|
| MD5 |
bfcdce90811d3e53c14614769096e030
|
|
| BLAKE2b-256 |
4fb721fbc805359d2c198c3991f650f465750c8e3a7aa14a942b412aa1e5735a
|