No abstract

The sudden outbreak of coronavirus disease 2019 (COVID-19) revealed the need for fast and reliable automatic tools to help health teams. This paper aims to present understandable solutions based on Machine Learning (ML) techniques to deal with COVID-19 screening in routine blood tests. We tested different ML classifiers in a public dataset from the Hospital Albert Einstein, São Paulo, Brazil. After cleaning and pre-processing the data has 608 patients, of which 84 are positive for COVID-19 confirmed by RT-PCR. To understand the model decisions, we introduce (i) a local Decision Tree Explainer (DTX) for local explanation and (ii) a Criteria Graph to aggregate these explanations and portrait a global picture of the results. Random Forest (RF) classifier achieved the best results (accuracy 0.88, F1–score 0.76, sensitivity 0.66, specificity 0.91, and AUROC 0.86). By using DTX and Criteria Graph for cases confirmed by the RF, it was possible to find some patterns among the individuals able to aid the clinicians to understand the interconnection among the blood parameters either globally or on a case-by-case basis. The results are in accordance with the literature and the proposed methodology may be embedded in an electronic health record system.

No abstract

The Differential Evolution (DE) algorithm was ini tially proposed for continuous numerical optimization, but it has been applied with success in many combinatorial optimization problems, particularly permutation-based integer combinatorial problems. In this paper, a new and general approach for combinatorial optimization is proposed using the Differential Evolution algorithm. The proposed approach aims at preserving its interesting search mechanism for discrete domains, by defining the difference between two candidate solutions as a differential list of movements in the search space. Thus, a more meaningful and general differential mutation operator for the context of combina torial optimization problems can be produced. We discuss three alternatives for using the differential list of movements within the differential mutation operation. We present results on instances of the Traveling Salesman Problem (TSP) and the N-Queen Problem (NQP) to illustrate the adequacy of the proposed approach for combinatorial optimization.