{"id":22221666,"url":"https://github.com/jeanbou/tdts","last_synced_at":"2025-03-25T07:43:45.901Z","repository":{"id":107577252,"uuid":"113651615","full_name":"jeanbou/TDTS","owner":"jeanbou","description":"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","archived":false,"fork":false,"pushed_at":"2024-05-31T15:18:31.000Z","size":58061,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-30T07:14:45.651Z","etag":null,"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"],"latest_commit_sha":null,"homepage":"https://www.researchgate.net/profile/Ivan-Budnyk/","language":"MATLAB","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jeanbou.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-12-09T07:38:34.000Z","updated_at":"2024-11-07T11:41:39.000Z","dependencies_parsed_at":"2023-06-08T13:15:29.859Z","dependency_job_id":null,"html_url":"https://github.com/jeanbou/TDTS","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jeanbou%2FTDTS","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jeanbou%2FTDTS/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jeanbou%2FTDTS/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jeanbou%2FTDTS/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jeanbou","download_url":"https://codeload.github.com/jeanbou/TDTS/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245422921,"owners_count":20612725,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["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"],"created_at":"2024-12-02T23:14:14.644Z","updated_at":"2025-03-25T07:43:45.863Z","avatar_url":"https://github.com/jeanbou.png","language":"MATLAB","funding_links":[],"categories":[],"sub_categories":[],"readme":"# T-DTS (Tree-like Divide to Simplify)\n\n*T-DTS (Tree-like Divide to Simplify)* is a next software *version 3.0* writen in Matlab 6 in the scope of *my thesis*: \n[\"Contribution to the Study and Implementation of Intelligent Modular Self-organizing Systems\"](https://www.theses.fr/144154781) \n\nThe beta *version 2.0* was initially developed by [*Dr. M. Rybnik*](https://www.researchgate.net/profile/Mariusz-Rybnik-2) \n\nThe 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)\n\nMy 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:\n* 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*)\n* Increased library of classification task complexety estimators (*Rybnik's and my contributions plus a lot of debug*)\n* 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*)\n* 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 \u0026 try again approach (*my contribution*) \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjeanbou%2Ftdts","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjeanbou%2Ftdts","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjeanbou%2Ftdts/lists"}