https://github.com/jeanbou/tdts
Matlab based Ph.D. project T-DTS, developed during for the thesis 2006-2009. It's the enhanced version of Tree-like Divide to Simplify (T-DTS) ANN (AI/ML) structure-based tool used for classification tasks. The credits: the v.1.0 was developed by Dr. M. Rybnik under supervision of Prof. K. Madani
https://github.com/jeanbou/tdts
ai ann artificial-intelligence artificial-neural-networks big-data bigdata classification classification-algorithm classification-trees coding decomposition ibm-neuro-computer love machine-learning t-dts tdts treelikedividetosimplify zisc zisc-036
Last synced: 3 months ago
JSON representation
Matlab based Ph.D. project T-DTS, developed during for the thesis 2006-2009. It's the enhanced version of Tree-like Divide to Simplify (T-DTS) ANN (AI/ML) structure-based tool used for classification tasks. The credits: the v.1.0 was developed by Dr. M. Rybnik under supervision of Prof. K. Madani
- Host: GitHub
- URL: https://github.com/jeanbou/tdts
- Owner: jeanbou
- Created: 2017-12-09T07:38:34.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2024-05-31T15:18:31.000Z (about 1 year ago)
- Last Synced: 2025-01-30T07:14:45.651Z (4 months ago)
- Topics: ai, ann, artificial-intelligence, artificial-neural-networks, big-data, bigdata, classification, classification-algorithm, classification-trees, coding, decomposition, ibm-neuro-computer, love, machine-learning, t-dts, tdts, treelikedividetosimplify, zisc, zisc-036
- Language: MATLAB
- Homepage: https://www.researchgate.net/profile/Ivan-Budnyk/
- Size: 55.4 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# T-DTS (Tree-like Divide to Simplify)
*T-DTS (Tree-like Divide to Simplify)* is a next software *version 3.0* writen in Matlab 6 in the scope of *my thesis*:
["Contribution to the Study and Implementation of Intelligent Modular Self-organizing Systems"](https://www.theses.fr/144154781)
The beta *version 2.0* was initially developed by [*Dr. M. Rybnik*](https://www.researchgate.net/profile/Mariusz-Rybnik-2)
The development was accomplished under supervision of [*Prof. K. Madani*](https://www.researchgate.net/profile/Kurosh-Madani) and [*Prof. A. Chebira*](https://www.researchgate.net/profile/Abdennasser-Chebira)
My enhanced version of Tree-like Divide to Simplify (T-DTS) ANN (AI/ML) lego-like tool used for any classification task which is grounded on the following ideas:
* The set of DB classification decomposers and the set of the end-tree-leaf classifiers (*Rybnik's implementation in code + his T-DTS code skeleton*)
* Increased library of classification task complexety estimators (*Rybnik's and my contributions plus a lot of debug*)
* Among them [RBF Net](https://en.wikipedia.org/wiki/Radial_basis_function_network) like [IBM ZISC(r)-036 RBF Net](https://en.wikipedia.org/wiki/No_instruction_set_computing#Zero_instruction_set_computer) based estimator that allows us to build T-TDS on chip (*my contribution*)
* Extra loop that allows us to find sub-optimal classification complexity estimator from lib based on max entropy principle and define its optimal value for a concrete classification problem as there is no absolute value and no approach for end-user to guess apriory except try, check, fail & try again approach (*my contribution*)