Reproducibility test of radiomics using network analysis and Wasserstein K-means algorithm

PurposeTo construct robust and validated radiomic predictive models, the development of a reliable method that can identify reproducible radiomic features robust to varying image acquisition methods and other scanner parameters should be preceded with rigorous validation. Due to the property of high correlation present between radiomic features, we hypothesize that reproducible radiomic features across different datasets that are obtained from different image acquisition settings preserve some level of connectivity between features in the form of a network.\n\nMethodsWe propose a regularized partial correlation network to identify robust and reproducible radiomic features. This approach was tested on two radiomic feature sets generated with two different reconstruction methods from a cohort of 47 lung cancer patients. The commonality of the resulting two networks was assessed. A largest common network component from the two networks was tested on phantom data consisting of 5 cancer samples. We further propose a novel K-means algorithm coupled with the optimal mass transport (OMT) theory to cluster samples. This approach following the regularized partial correlation analysis was tested on computed tomography (CT) scans from 77 head and neck cancer patients that were downloaded from The Cancer Imaging Archive (TCIA) and validated on CT scans from 83 head and neck cancer patients treated at our institution.\n\nResultsCommon radiomic features were found in relatively large network components between the resulting two partial correlation networks from a cohort of 47 lung cancer patients. The similarity of network components in terms of the common number of radiomic features was statistically significant. For phantom data, the Wasserstein distance on a largest common network component from the lung cancer data was much smaller than the Wasserstein distance on the same network using random radiomic features, implying the reliability of those radiomic features present in the network. Further analysis using the proposed Wasserstein K-means algorithm on TCIA head and neck cancer data showed that the resulting clusters separate tumor subsites and this was validated on our institution data.\n\nConclusionsWe showed that a network-based analysis enables identifying reproducible radiomic features. This was validated using phantom data and external data via the Wasserstein distance metric and the proposed Wasserstein K-means method.