Skip to content

Modular AI/ML framework in MATLAB for classification. PhD project T-DTS v3.0 — tree-based, entropy-driven, RBF-enabled ANN. Based on work by Dr. Rybnik.

Notifications You must be signed in to change notification settings

jeanbou/t-dts--tree-like-divide-to-simplify

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

T-DTS: Tree-like Divide to Simplify

A Modular, Self-Organizing ANN Framework for Classification Tasks


[ WHAT IS T-DTS? ]

T-DTS (Tree-like Divide to Simplify) is a modular, AI/ML classification framework developed in Matlab 6. This repository presents version 3.0, which was enhanced and extended as part of my doctoral thesis:

"Contribution to the Study and Implementation of Intelligent Modular Self-organizing Systems" Link to Thesis

T-DTS is designed as a Lego-like neural network tool for solving classification problems using a tree-based decomposition method and problem complexity estimation.


[ KEY CONCEPTS & STRUCTURE ]

  • Hierarchical, tree-like breakdown of classification problems into simpler, manageable subspaces
  • Modular integration of:
    • Classification decomposers
    • End-node classifiers
    • Estimators of classification complexity
  • Based on core principles developed by Dr. M. Rybnik (ResearchGate)
  • Significantly extended and debugged in this version

[ HIGHLIGHTED CONTRIBUTIONS IN VERSION 3.0 ]

1. RBF-Based Estimator (My Contribution)

  • Inspired by IBM ZISC-036 (Zero Instruction Set Computing)
  • Implements a Radial Basis Function (RBF) approach: RBF Net - Wikipedia
  • Enables T-DTS logic to be adapted for on-chip deployment

2. Max-Entropy Search Loop (My Contribution)

  • Automatically selects the most effective complexity estimator from the library
  • Based on the principle of maximum entropy
  • Solves the trial-and-error dilemma for selecting estimator parameters
  • Replaces "try, check, fail, repeat" with guided selection logic

[ VERSION HISTORY ]

  • Version 2.0 (Beta): Developed by Dr. M. Rybnik
  • Version 3.0: Fully restructured and enhanced as part of my PhD research

Supervised by:


[ APPLICATIONS ]

  • Classification in complex, high-dimensional datasets
  • Experimental modular neural network design
  • Dynamic complexity estimation
  • Educational tool for ANN self-organization concepts
  • Prototype logic for embedded, on-chip AI processing

[ TAGS (FOR SEARCH OPTIMIZATION) ]

t-dts, tree-like divide to simplify, modular neural networks, ai classification framework, self-organizing systems, radial basis function estimator, rbf net, ibm zisc, on-chip ai, complexity estimation, entropy-based model selection, matlab neural network, phd thesis ai, artificial intelligence research, object-oriented ai modeling, machine learning tree-based, modular ai architecture, neuro-inspired system design, classification algorithm tool, small footprint neural networks


[ SUPPORT & VISIBILITY ]

If you're exploring modular AI systems, classification strategies, or experimental ANN architectures — this project can serve as a foundation or point of reference.

To support visibility of academic and modular AI work: Please consider giving this repository a star (?). It helps other researchers and developers discover underrepresented approaches to intelligent systems.