Calculating normal tissue complication probabilities and probabilities of complication-free tumour control from stochastic models of population dynamics
We use a stochastic birth-death model for a population of cells to estimate the normal tissue complication probability (NTCP) under a particular radiotherapy protocol. We specifically allow for interaction between cells, via a nonlinear logistic growth model. To capture some of the effects of intrinsic noise in the population we develop several approximations of NTCP, using Kramers-Moyal expansion techniques. These approaches provide an approximation to the first and second moments of a general first-passage time problem in the limit of large, but finite populations. We use this method to study NTCP in a simple model of normal cells and in a model of normal and damaged cells. We also study a combined model of normal tissue cells and tumour cells. Based on existing methods to calculate tumour control probabilities, and our procedure to approximate NTCP, we estimate the probability of complication free tumour control.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Probabilities of Causation and Root Cause Analysis with Quasi-Markovian Models
Probabilities of causation provide principled ways to assess causal relationships but face computational challenges due to partial identifiability and latent confounding. This paper introduces both algorithmic simplifica…
Extending the Relative Seriality Formalism for Interpretable Deep Learning of Normal Tissue Complication Probability Models
We formally demonstrate that the relative seriality model of Kallman, et al. maps exactly onto a simple type of convolutional neural network. This approach leads to a natural interpretation of feedforward connections in …
Leading Whitespaces of Language Models' Subword Vocabulary Pose a Confound for Calculating Word Probabilities
Predictions of word-by-word conditional probabilities from Transformer-based language models are often evaluated to model the incremental processing difficulty of human readers. In this paper, we argue that there is a co…
Bayesian Tensor Network with Polynomial Complexity for Probabilistic Machine Learning
It is known that describing or calculating the conditional probabilities of multiple events is exponentially expensive. In this work, Bayesian tensor network (BTN) is proposed to efficiently capture the conditional proba…
BIG-bench Machine LearningA Polynomial Time Algorithm for Finding Bayesian Probabilities from Marginal Constraints
A method of calculating probability values from a system of marginal constraints is presented. Previous systems for finding the probability of a single attribute have either made an independence assumption concerning the…
Attribute