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...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
MDPI AG
2025-10-01
|
| Seri Bilgileri: | Axioms |
| Konular: | |
| Online Erişim: | https://www.mdpi.com/2075-1680/14/11/794 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|