Different Scenarios for the Prediction of Hospital Readmission of Diabetic Patients

Hospitals generate large amounts of data on a daily basis, but most of the time that data is just an overwhelming amount of information which never transitions to knowledge. Through the application of Data Mining techniques it is possible to find hidden relations or patterns among the data and conve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of medical systems 2021, Vol.45 (1), p.11-11, Article 11
Hauptverfasser: Neto, Cristiana, Senra, Fábio, Leite, Jaime, Rei, Nuno, Rodrigues, Rui, Ferreira, Diana, Machado, José
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Hospitals generate large amounts of data on a daily basis, but most of the time that data is just an overwhelming amount of information which never transitions to knowledge. Through the application of Data Mining techniques it is possible to find hidden relations or patterns among the data and convert those into knowledge that can further be used to aid in the decision-making of hospital professionals. This study aims to use information about patients with diabetes, which is a chronic (long-term) condition that occurs when the body does not produce enough or any insulin. The main purpose is to help hospitals improve their care with diabetic patients and consequently reduce readmission costs. An hospital readmission is an episode in which a patient discharged from a hospital is admitted again within a specified period of time (usually a 30 day period). This period allows hospitals to verify that their services are being performed correctly and also to verify the costs of these re-admissions. The goal of the study is to predict if a patient who suffers from diabetes will be readmitted, after being discharged, using Machine Leaning algorithms. The final results revealed that the most efficient algorithm was Random Forest with 0.898 of accuracy.
ISSN:0148-5598
1573-689X
DOI:10.1007/s10916-020-01686-4