: The prediction at baseline of patients at high risk for therapy failure or recurrence would significantly impact on Hodgkin Lymphoma patients treatment, informing clinical practice. Current literature is extensively searching insights in radiomics, a promising framework for high-throughput imaging feature extraction, to derive biomarkers and quantitative prognostic factors from images. However, existing studies are limited by intrinsic radiomic limitations, high dimensionality among others. We propose an exhaustive patient representation and a recurrence-specific multi-view supervised clustering algorithm for estimating patient-to-patient similarity graph and learning recurrence probability. We stratified patients in two risk classes and characterize each group in terms of clinical variables.
Recurrence-specific supervised graph clustering for subtyping Hodgkin Lymphoma radiomic phenotypes
Cavinato, L;Gozzi, N;Ieva, F
2021-01-01
Abstract
: The prediction at baseline of patients at high risk for therapy failure or recurrence would significantly impact on Hodgkin Lymphoma patients treatment, informing clinical practice. Current literature is extensively searching insights in radiomics, a promising framework for high-throughput imaging feature extraction, to derive biomarkers and quantitative prognostic factors from images. However, existing studies are limited by intrinsic radiomic limitations, high dimensionality among others. We propose an exhaustive patient representation and a recurrence-specific multi-view supervised clustering algorithm for estimating patient-to-patient similarity graph and learning recurrence probability. We stratified patients in two risk classes and characterize each group in terms of clinical variables.File | Dimensione | Formato | |
---|---|---|---|
Recurrence-specific_supervised_graph_clustering_for_subtyping_Hodgkin_Lymphoma_radiomic_phenotypes.pdf
accesso aperto
:
Publisher’s version
Dimensione
918.97 kB
Formato
Adobe PDF
|
918.97 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.