Optimización de árboles de estrategia unicriterio y de coste-efectividad

Introduction: A cost-effectiveness analysis (CEA) helps us select the most effective intervention for the financial budget we have. In these analyzes through CEP, we generated several lambda intervals, each with the optimal intervention, its cost and expected effectiveness. Being able to represent t...

Full description

Bibliographic Details
Author: Gil González, Ángel Miguel
Format: master thesis
Publication Date:2020
Country:España
Institution:Universidad Nacional de Educación a Distancia
Repository:e-spacio. Repositorio Institucional de la UNED
Language:Spanish
OAI Identifier:oai:e-spacio.uned.es:20.500.14468/14558
Online Access:https://hdl.handle.net/20.500.14468/14558
Access Level:Open access
Keyword:1203.04 Inteligencia artificial
id ES_227ddda17c609eee08f352c4b805bb92
oai_identifier_str oai:e-spacio.uned.es:20.500.14468/14558
network_acronym_str ES
network_name_str España
repository_id_str
spelling Optimización de árboles de estrategia unicriterio y de coste-efectividadGil González, Ángel Miguel1203.04 Inteligencia artificialIntroduction: A cost-effectiveness analysis (CEA) helps us select the most effective intervention for the financial budget we have. In these analyzes through CEP, we generated several lambda intervals, each with the optimal intervention, its cost and expected effectiveness. Being able to represent these lambda intervals, through a graphic model, will help us see all the available information and will speed us up to make a decision. If we can optimize this tree, it will be easier to study and understand it. Objective: To find the algorithm that returns the best optimization of the generated tree after applying the deterministic CEA analysis. Methods: Applying pruning techniques on the tree nodes (variable exchange, elimination of redundancies, lambda displacement) in a search algorithm, we will be able to get partial results of the search optimization, until we reach the most optimal tree optimization result created with CEP results. Results: Once optimized with the most appropriate pruning techniques and algorithms, we will have a graphic model where the different options can be observed in a more effective and clear way than when we use a textual description. Conclusion: Through the open source software tool "OpenMarkov" the possibility of graphically displaying the result of a deterministic CEA analysis has been implemented. With this new tool we can graphically evaluate the results that were previously shown in a table, and that did not allow us to appreciate in the same detail, each of the concepts that are observed in each branch of the tree.Universidad Nacional de Educación a Distancia (España). Escuela Técnica Superior de Ingeniería Informática. Departamento de Inteligencia ArtificialArias Calleja, ManuelLuque Gallego, ManuelDíez Vegas, Francisco Javiere-Spacio UNED20242024-05-2020202020-10-0220202020-10-02master thesishttp://purl.org/coar/resource_type/c_bdccinfo:eu-repo/semantics/masterThesisapplication/pdfhttps://hdl.handle.net/20.500.14468/14558reponame:e-spacio. Repositorio Institucional de la UNEDinstname:Universidad Nacional de Educación a DistanciaEspañolspaopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/4.0/deed.esoai:e-spacio.uned.es:20.500.14468/145582026-06-06T12:38:31Z
dc.title.none.fl_str_mv Optimización de árboles de estrategia unicriterio y de coste-efectividad
title Optimización de árboles de estrategia unicriterio y de coste-efectividad
spellingShingle Optimización de árboles de estrategia unicriterio y de coste-efectividad
Gil González, Ángel Miguel
1203.04 Inteligencia artificial
title_short Optimización de árboles de estrategia unicriterio y de coste-efectividad
title_full Optimización de árboles de estrategia unicriterio y de coste-efectividad
title_fullStr Optimización de árboles de estrategia unicriterio y de coste-efectividad
title_full_unstemmed Optimización de árboles de estrategia unicriterio y de coste-efectividad
title_sort Optimización de árboles de estrategia unicriterio y de coste-efectividad
dc.creator.none.fl_str_mv Gil González, Ángel Miguel
author Gil González, Ángel Miguel
author_facet Gil González, Ángel Miguel
author_role author
dc.contributor.none.fl_str_mv Arias Calleja, Manuel
Luque Gallego, Manuel
Díez Vegas, Francisco Javier
e-Spacio UNED
dc.subject.none.fl_str_mv 1203.04 Inteligencia artificial
topic 1203.04 Inteligencia artificial
description Introduction: A cost-effectiveness analysis (CEA) helps us select the most effective intervention for the financial budget we have. In these analyzes through CEP, we generated several lambda intervals, each with the optimal intervention, its cost and expected effectiveness. Being able to represent these lambda intervals, through a graphic model, will help us see all the available information and will speed us up to make a decision. If we can optimize this tree, it will be easier to study and understand it. Objective: To find the algorithm that returns the best optimization of the generated tree after applying the deterministic CEA analysis. Methods: Applying pruning techniques on the tree nodes (variable exchange, elimination of redundancies, lambda displacement) in a search algorithm, we will be able to get partial results of the search optimization, until we reach the most optimal tree optimization result created with CEP results. Results: Once optimized with the most appropriate pruning techniques and algorithms, we will have a graphic model where the different options can be observed in a more effective and clear way than when we use a textual description. Conclusion: Through the open source software tool "OpenMarkov" the possibility of graphically displaying the result of a deterministic CEA analysis has been implemented. With this new tool we can graphically evaluate the results that were previously shown in a table, and that did not allow us to appreciate in the same detail, each of the concepts that are observed in each branch of the tree.
publishDate 2020
dc.date.none.fl_str_mv 2020
2020-10-02
2020
2020-10-02
2024
2024-05-20
dc.type.none.fl_str_mv master thesis
http://purl.org/coar/resource_type/c_bdcc
dc.type.openaire.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14468/14558
url https://hdl.handle.net/20.500.14468/14558
dc.language.none.fl_str_mv Español
spa
language_invalid_str_mv Español
language spa
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/4.0/deed.es
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
https://creativecommons.org/licenses/by-nc-nd/4.0/deed.es
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidad Nacional de Educación a Distancia (España). Escuela Técnica Superior de Ingeniería Informática. Departamento de Inteligencia Artificial
publisher.none.fl_str_mv Universidad Nacional de Educación a Distancia (España). Escuela Técnica Superior de Ingeniería Informática. Departamento de Inteligencia Artificial
dc.source.none.fl_str_mv reponame:e-spacio. Repositorio Institucional de la UNED
instname:Universidad Nacional de Educación a Distancia
instname_str Universidad Nacional de Educación a Distancia
reponame_str e-spacio. Repositorio Institucional de la UNED
collection e-spacio. Repositorio Institucional de la UNED
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869404584885092352
score 15,811543

Similar Items