Dataset Information

On the stability of log-rank test under labeling errors.

ABSTRACT:

Motivation

Log rank test is a widely used test that serves to assess the statistical significance of observed differences in survival, when comparing two or more groups. The log rank test is based on several assumptions that support the validity of the calculations. It is naturally assumed, implicitly, that no errors occur in the labeling of the samples. That is - that the mapping between samples and groups is perfectly correct. In this work we investigate how test results may be affected when considering some errors in the original labeling.

Results

We introduce and define the uncertainty that arises from labeling errors in log rank test. In order to deal with this uncertainty, we develop a novel algorithm for efficiently calculating a stability interval around the original log rank p-value and prove its correctness. We demonstrate our algorithm on several datasets.

Availability

We provide a Python implementation, called LoRSI, for calculating the stability interval using our algorithm. https://github.com/YakhiniGroup/LoRSI.

Supplementary information

Supplementary data are available at Bioinformatics online.

SUBMITTER: Galili B

PROVIDER: S-EPMC8652036 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:BackgroundPatient data is considered particularly sensitive personal data. Privacy regulations strictly govern the use of patient data and restrict their exchange. However, medical research can benefit from multicentric studies in which patient data from different institutions are pooled and evaluated together. Thus, the goals of data utilization and data protection are in conflict. Secure multiparty computation (SMPC) solves this conflict because it allows direct computation on distributed proprietary data-held by different data owners-in a secure way without exchanging private data.ObjectiveThe objective of this work was to provide a proof-of-principle of secure and privacy-preserving multicentric computation by SMPC with real-patient data over the free internet. A privacy-preserving log-rank test for the Kaplan-Meier estimator was implemented and tested in both an experimental setting and a real-world setting between two university hospitals.MethodsThe domain of survival analysis is particularly relevant in clinical research. For the Kaplan-Meier estimator, we provided a secure version of the log-rank test. It was based on the SMPC realization SPDZ and implemented via the FRESCO framework in Java. The complexity of the algorithm was explored both for synthetic data and for real-patient data in a proof-of-principle over the internet between two clinical institutions located in Munich and Berlin, Germany.ResultsWe obtained a functional realization of an SMPC-based log-rank evaluation. This implementation was assessed with respect to performance and scaling behavior. We showed that network latency strongly influences execution time of our solution. Furthermore, we identified a lower bound of 2 Mbit/s for the transmission rate that has to be fulfilled for unimpeded communication. In contrast, performance of the participating parties have comparatively low influence on execution speed, since the peer-side processing is parallelized and the computational time only constitutes 30% to 50% even with optimal network settings. In the real-world setting, our computation between three parties over the internet, processing 100 items each, took approximately 20 minutes.ConclusionsWe showed that SMPC is applicable in the medical domain. A secure version of commonly used evaluation methods for clinical studies is possible with current implementations of SMPC. Furthermore, we infer that its application is practically feasible in terms of execution time.