Efficient Modeling of Deterministic Decision Trees for Recognition of Realizable Decision Rules: Bounds on Weighted Depth
In this paper, an efficient algorithm for modeling the operation of a DDT (Deterministic Decision Tree) solving the problem of realizability of DRs (Decision Rules) is proposed and analyzed. For this problem, it is assumed that a DRS (Decision Rule System) is given; for an arbitrary tuple of feature...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
MDPI AG
2025-10-01
|
| סדרה: | Axioms |
| נושאים: | |
| גישה מקוונת: | https://www.mdpi.com/2075-1680/14/11/794 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|