98%
921
2 minutes
20
Rating and composite scales are commonly used to assess treatment efficacy. The two main strategies for modelling such endpoints are to treat them as a continuous or an ordered categorical variable (CV or OC). Both strategies have disadvantages, including making assumptions that violate the integer nature of the data (CV) and requiring many parameters for scales with many response categories (OC). We present a method, called the bounded integer (BI) model, which utilises the probit function with fixed cut-offs to estimate the probability of a certain score through a latent variable. This method was successfully implemented to describe six data sets from four different therapeutic areas: Parkinson's disease, Alzheimer's disease, schizophrenia, and neuropathic pain. Five scales were investigated, ranging from 11 to 181 categories. The fit (likelihood) was better for the BI model than for corresponding OC or CV models (ΔAIC range 11-1555) in all cases but one (∆AIC - 63), while the number of parameters was the same or lower. Markovian elements were successfully implemented within the method. The performance in external validation, assessed through cross-validation, was also in favour of the new model (ΔOFV range 22-1694) except in one case (∆OFV - 70). A residual for diagnostic purposes is discussed. This study shows that the BI model respects the integer nature of data and is parsimonious in terms of number of estimated parameters.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6554249 | PMC |
http://dx.doi.org/10.1208/s12248-019-0343-9 | DOI Listing |
Math Program
October 2024
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada.
A rational number is if it has a finite binary representation , where is an integer and is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in floating-point arithmetic on a computer. A vector is if all its entries are dyadic rationals.
View Article and Find Full Text PDFBiometrika
April 2025
Departments of Biostatistics and Statistics, University of Washington, Box 351617, Seattle, Washington 98195, USA.
We study the problem of learning directed acyclic graphs from continuous observational data, generated according to a linear Gaussian structural equation model. State-of-the-art structure learning methods for this setting have at least one of the following shortcomings: (i) they cannot provide optimality guarantees and can suffer from learning suboptimal models; (ii) they rely on the stringent assumption that the noise is homoscedastic, and hence the underlying model is fully identifiable. We overcome these shortcomings and develop a computationally efficient mixed-integer programming framework for learning medium-sized problems that accounts for arbitrary heteroscedastic noise.
View Article and Find Full Text PDFAlgorithmica
April 2025
Department of Computer Science, ETH Zürich, Rämistrasse 101, 8092 Zurich, Switzerland.
MaxCut is a classical -complete problem and a crucial building block in many combinatorial algorithms. The famous states that any connected graph on vertices with edges contains a cut of size at least . Crowston, Jones and Mnich [Algorithmica, 2015] showed that the MaxCut problem on simple connected graphs admits an FPT algorithm, where the parameter is the difference between the desired cut size and the lower bound given by the Edwards-Erdös bound.
View Article and Find Full Text PDFJ Phys Condens Matter
August 2025
Key Laboratory of Artificial Structures and Quantum Control (Ministry of Education), Department of Physics and Astronomy, Shanghai Jiaotong University, 800 Dongchuan Road, Shanghai 200240, People's Republic of China.
In this paper, we derive the equations of motion for a system composed of a spinless quantum dot coupled to two normal leads and two Majorana bound states (MBSs), utilizing the auxiliary-mode expansion method and the nonequilibrium Green function technique. Subsequently, we use these equations to analyze the linear conductance, adiabatic linear capacitance, and adiabatic linear relaxation resistance of the system. We find that when the phase difference between the two MBSs is an integer multiple of, the MBSs enter the zero mode, leading to the complete suppression of the linear relaxation resistance.
View Article and Find Full Text PDFPLoS One
July 2025
School of Mathematics, Renmin University of China, Beijing, China.
The smoothing parameter on lattices is crucial for lattice-based cryptographic design. In this study, we establish a new upper bound for the lattice smoothing parameter, which represents an improvement over several significant classical findings. For one-dimensional integer lattices, under specific and optimized conditions, we have achieved a more precise upper bound compared to previous research.
View Article and Find Full Text PDF