Objective: In the present paper, we describe an application of case-based retrieval to the domain of end stage renal failure patients, treated with hemodialysis. Materials and methods: Defining a dialysis session as a case, retrieval of past similar cases has to operate both on static and on dynamic features, since most of the monitoring variables of a dialysis session are time series. Retrieval is then articulated as a two-step procedure: (1) classification, based on static features and (2) intra-class retrieval, in which dynamic features are considered. As regards step (2), we concentrate on a classical dimensionality reduction technique for time series allowing for efficient indexing, namely discrete Fourier transform (DFT). Thanks to specific index structures (i.e. k —d trees), range queries (on local feature similarity) can be efficiently performed on our case base, allowing the physician to examine the most similar stored dialysis sessions with respect to the current one. Results: The retrieval tool has been positively tested on real patients’ data, coming from the nephrology and dialysis unit of the Vigevano hospital, in Italy. Conclusions: The overall system can be seen as a means for supporting quality assessment of the hemodialysis service, providing a useful input from the knowledge management perspective.

Case-based retrieval to support the treatment of end stage renal failure patients

MONTANI, Stefania;PORTINALE, Luigi;LEONARDI, GIORGIO;
2006-01-01

Abstract

Objective: In the present paper, we describe an application of case-based retrieval to the domain of end stage renal failure patients, treated with hemodialysis. Materials and methods: Defining a dialysis session as a case, retrieval of past similar cases has to operate both on static and on dynamic features, since most of the monitoring variables of a dialysis session are time series. Retrieval is then articulated as a two-step procedure: (1) classification, based on static features and (2) intra-class retrieval, in which dynamic features are considered. As regards step (2), we concentrate on a classical dimensionality reduction technique for time series allowing for efficient indexing, namely discrete Fourier transform (DFT). Thanks to specific index structures (i.e. k —d trees), range queries (on local feature similarity) can be efficiently performed on our case base, allowing the physician to examine the most similar stored dialysis sessions with respect to the current one. Results: The retrieval tool has been positively tested on real patients’ data, coming from the nephrology and dialysis unit of the Vigevano hospital, in Italy. Conclusions: The overall system can be seen as a means for supporting quality assessment of the hemodialysis service, providing a useful input from the knowledge management perspective.
File in questo prodotto:
File Dimensione Formato  
AIM2006.pdf

file disponibile solo agli amministratori

Tipologia: Documento in Post-print
Licenza: DRM non definito
Dimensione 646.24 kB
Formato Adobe PDF
646.24 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11579/30415
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 55
  • ???jsp.display-item.citation.isi??? 40
social impact