Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Assessment of the Influence of Features on a Classification Problem: An Application to COVID-19 Patients

  • Davila-Pena, Laura
  • García-Jurado, Ignacio
  • Casas Méndez, Balbina Virginia
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] This paper deals with an important subject in classification problems addressed by machine learning techniques: the evaluation of the influence of each of the features on the classification of individuals. Specifically, a measure of that influence is introduced using the Shapley value of cooperative games. In addition, an axiomatic characterisation of the proposed measure is provided based on properties of efficiency and balanced contributions. Furthermore, some experiments have been designed in order to validate the appropriate performance of such measure. Finally, the methodology introduced is applied to a sample of COVID-19 patients to study the influence of certain demographic or risk factors on various events of interest related to the evolution of the disease., The authors are grateful to Ricardo Cao Abad and to the Dirección Xeral de Saúde Pública of the Xunta de Galicia in Spain. This work has been supported by the ERDF, the Government of Spain/AEI [grants MTM2017-87197-C3-1-P and MTM2017-87197-C3-3-P]; the Xunta de Galicia [Grupos de Referencia Competitiva ED431C2016-015, ED431C2017/38, and ED431C 2021/24, and Centro Singular de Investigación de Galicia ED431G/01]; and by the collaborative research project of the IMAT “Mathematical, statistical and dynamic study of the epidemic COVID-19”, subsidized by the Vice-Rector’s Office for Research and Innovation at the University of Santiago de Compostela, Spain. The research of Laura Davila-Pena has been funded by the Government of Spain [grant FPU17/02126], Xunta de Galicia; ED431C2016-015, Xunta de Galicia; ED431C2017/38, Xunta de Galicia; ED431C 2021/24, Xunta de Galicia; ED431G/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

An allocation rule for connection scheduling problems

  • Davila-Pena, Laura
  • Borm, Peter
  • García-Jurado, Ignacio
  • Schouten, Jop
[Abstract]: This paper studies so-called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a source is minimal and second to find a fair cost allocation of such an optimal order among the players involved. We restrict our attention to connection scheduling problems on trees and propose a recursive method to solve these tree connection scheduling problems integrated with an allocation approach. This latter mechanism consistently and recursively uses benchmark endogenous myopic orders to determine potential cost savings, which will then be appropriately allocated. Interestingly, the transition process from a benchmark myopic order to an optimal one will be smooth using the switching of blocks of agents based on the basic notion of merge segments., Laura Davila-Pena’s research was funded by the Ministry of Education, Culture and Sports ofSpain (contract FPU17/02126). This work is part of the R&D projects MTM2017-87197-C3-1-P, MTM2017-87197-C3-3-P, PID2021-124030NB-C31, and PID2021-124030NB-C32, granted byMICIU/AEI/10.13039/501100011033/ and by “ERDF A way of making Europe”/EU. This re-search was also funded by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C2021/24 and ED431C 2020/14). The authors would like to thank the editor-in-chief, the asso-ciate editor, and the three anonymous referees for their valuable comments, which helped improvean earlier version of this paper.