Árbol de Decisión de Ruta Óptima

dc.contributor.advisorRuíz-Cruz, Riemann
dc.contributor.authorZárate-Carbajal, José M.
dc.date.accessioned2025-09-15T18:32:06Z
dc.date.available2025-09-15T18:32:06Z
dc.date.issued2024-01
dc.description.abstractThis thesis presents an Optimal Path Decision Tree (OPDT), an innovative regression-based decision tree algorithm featuring a specialized split function designed to simplify the creation of decision trees and enhance the comprehension of decision paths. This enhancement is particularly beneficial for their application in framing decision-making policies. In contrast to traditional approaches, the OPDT algorithm singularly utilizes predictive variables to determine the most efficacious pathway to reach specific objectives, thereby minimizing the complexity and bolstering the interpretability of the generated trees. The versatility of the OPDT model was thoroughly investigated through its application to both regression and classification datasets, thereby emphasizing its adaptability. The effectiveness of the model was validated through empirical analyses using datasets sourced from public repositories, thereby demonstrating its applicability across diverse fields. A comparative evaluation of the established Classification and Regression Trees using the Gini index (CART-Gini) method highlights the unique approach of the OPDT model. The Gini index optimizes thresholds for sample division to improve predictability, and the OPDT identifies a singular optimal path, enhancing the probability of meeting a specific target. OPDT represents a specific functionality within the CART algorithm family. This makes OPDT particularly adept within the CART-Gini family for tailoring decision policies and effectively bridging the gap in the capabilities of the original CART-Gini framework. Additionally, this thesis delves into incorporating OPDT logic into ensemble methodologies, such as Bagged Trees and Random Forests, suggesting a broader applicability of OPDT principles. This thesis concludes that the OPDT model represents the most concise decision tree approach for achieving targeted outcomes. The algorithm and code developed in this study contribute significantly to the knowledge of machine learning in the context of decision trees and their integration into decision-policy frameworks.
dc.identifier.citationZárate-Carbajal, J. M. (2025). Árbol de Decisión de Ruta Óptima. Tesis de doctorado, Doctorado en Ciencias de la Ingeniería. Tlaquepaque, Jalisco: ITESO.
dc.identifier.urihttps://hdl.handle.net/11117/11860
dc.language.isoeng
dc.publisherITESO
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/deed.es
dc.subjectMachine Learning
dc.subjectOptimization
dc.subjectDecision Tree
dc.subjectDecision System
dc.titleÁrbol de Decisión de Ruta Óptima
dc.title.alternativeOptimal Path Decision Tree
dc.typeinfo:eu-repo/semantics/doctoralThesis
dc.type.versioninfo:eu-repo/semantics/publishedVersion

Archivos

Bloque original

Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
Thesis_OPDT.pdf
Tamaño:
1.06 MB
Formato:
Adobe Portable Document Format

Bloque de licencias

Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
license.txt
Tamaño:
4.82 KB
Formato:
Item-specific license agreed upon to submission
Descripción: