Goal attainment scaling: An idiosyncratic method to assess treatment effectiveness in agoraphobia

Goal attainment scaling (GAS) is an individually tailored way to measure treatment gains, using a highly standardized procedure. An advantage of the method is that it takes into account individual characteristics of the patients, and at the same time the data are suitable for quantitative analysis and comparable across patients. Despite the wide acceptance and use of the method in the evaluation of psychotherapy, data on its psychometric properties are rather scarce. In the current study, GAS was used as one of several outcome measures in a research project on the effectiveness of various treatments for panic disorder with agoraphobia. Guidelines for GAS are presented as well as data on the reliability and validity of the procedure. Results indicate that the procedure is reliable, valid, and sensitive to the improvement of patients during treatment. Comparison of GAS with standardized measures revealed considerable concordance, although the clinical end status of patients diverged somewhat dependent on the measure considered.     

A generalized majorization method for least souares multidimensional scaling of pseudodistances that may be negative

The usual convergence proof of the SMACOF algorithm model for least squares multidimensional scaling critically depends on the assumption of nonnegativity of the quantities to be fitted, called the pseudodistances. When this assumption is violated, erratic convergence behavior is known to occur. Three types of circumstances in which some of the pseudodistances may become negative are outlined: nonmetric multidimensional scaling with normalization on the variance, metric multidimensional scaling including an additive constant, and multidimensional scaling under the city-block distance model. A generalization of the SMACOF method is proposed to resolve the difficulty that is based on the same rationale frequently involved in robust fitting with least absolute residuals.I am grateful to Patrick Groenen and Rian van Blokland-Vogelesang for their help with some of the computations, and to the anonymous referees for their very useful comments.     

Mixture-modelling-based Bayesian MH-RM algorithm for the multidimensional 4PLM

Several recent works have tackled the estimation issue for the unidimensional four-parameter logistic model (4PLM). Despite these efforts, the issue remains a challenge for the multidimensional 4PLM (M4PLM). Fu et al. (2021) proposed a Gibbs sampler for the M4PLM, but it is time-consuming. In this paper, a mixture-modelling-based Bayesian MH-RM (MM-MH-RM) algorithm is proposed for the M4PLM to obtain the maximum a posteriori (MAP) estimates. In a comparison of the MM-MH-RM algorithm to the original MH-RM algorithm, two simulation studies and an empirical example demonstrated that the MM-MH-RM algorithm possessed the benefits of the mixture-modelling approach and could produce more robust estimates with guaranteed convergence rates and fast computation. The MATLAB codes for the MM-MH-RM algorithm are available in the online appendix.     

Evaluating the desirability of meals: an illustrative multiattribute decision analysis procedure to assess portfolios with interdependent items

This paper presents an exploratory study designed to address complex scaling problems in applying value/utility theory to measuring preferences over alternative combinations (or portfolios) of multiattributed items. This application considers meals served to nursing home residents as portfolios of food items and seeks to maximize meal appeal. We consider food interrelation and link single food measurements to overall meal measurements in the process of constructing meal desirability scales. We test the resulting scales to capture one expert's professional judgments and discuss issues raised in this specific application in the context of general portfolio evaluation problems. © 1998 John Wiley & Sons, Ltd.     

Optimal scaling by alternating length-constrained nonnegative least squares, with application to distance-based analysis

An important feature of distance-based principal components analysis, is that the variables can be optimally transformed. For monotone spline transformation, a nonnegative least-squares problem with a length constraint has to be solved in each iteration. As an alternative algorithm to Lawson and Hanson (1974), we propose the Alternating Length-Constrained Non-Negative Least-Squares (ALC-NNLS) algorithm, which minimizes the nonnegative least-squares loss function over the parameters under a length constraint, by alternatingly minimizing over one parameter while keeping the others fixed. Several properties of the new algorithm are discussed. A Monte Carlo study is presented which shows that for most cases in distance-based principal components analysis, ALC-NNLS performs as good as the method of Lawson and Hanson or sometimes even better in terms of the quality of the solution. Supported by The Netherlands Organization for Scientific Research (NWO) by grant nr. 030-56403 for the “PIONEER” project “Subject Oriented Multivariate Analysis” to the third author. We would like to thank the anonymous referees for their valuable remarks that have improved the quality of this paper.     

多维对数正态作答时间模型：对潜在加工速度多维性的探究

在心理与教育测量中, 潜在加工速度反映学生运用潜在能力解决问题的效率。为在多维测验中探究潜在加工速度的多维性并实现参数估计, 本研究提出多维对数正态作答时间模型。实证数据分析及模拟研究结果表明：(1)潜在加工速度具有与潜在能力相匹配的多维结构; (2)新模型可精确估计个体水平的多维潜在加工速度及与作答时间有关的题目参数; (3)冗余指定潜在加工速度具有多维性带来的负面影响低于忽略其多维性所带来的。     

An improved stochastic EM algorithm for large-scale full-information item factor analysis

In this paper, we explore the use of the stochastic EM algorithm (Celeux & Diebolt (1985) Computational Statistics Quarterly, 2, 73) for large-scale full-information item factor analysis. Innovations have been made on its implementation, including an adaptive-rejection-based Gibbs sampler for the stochastic E step, a proximal gradient descent algorithm for the optimization in the M step, and diagnostic procedures for determining the burn-in size and the stopping of the algorithm. These developments are based on the theoretical results of Nielsen (2000, Bernoulli, 6, 457), as well as advanced sampling and optimization techniques. The proposed algorithm is computationally efficient and virtually tuning-free, making it scalable to large-scale data with many latent traits (e.g. more than five latent traits) and easy to use for practitioners. Standard errors of parameter estimation are also obtained based on the missing-information identity (Louis, 1982, Journal of the Royal Statistical Society, Series B, 44, 226). The performance of the algorithm is evaluated through simulation studies and an application to the analysis of the IPIP-NEO personality inventory. Extensions of the proposed algorithm to other latent variable models are discussed.     

MCMC estimation and some model-fit analysis of multidimensional IRT models

A Bayesian procedure to estimate the three-parameter normal ogive model and a generalization of the procedure to a model with multidimensional ability parameters are presented. The procedure is a generalization of a procedure by Albert (1992) for estimating the two-parameter normal ogive model. The procedure supports analyzing data from multiple populations and incomplete designs. It is shown that restrictions can be imposed on the factor matrix for testing specific hypotheses about the ability structure. The technique is illustrated using simulated and real data. The authors would like to thank Norman Verhelst for his valuable comments and ACT, CITO group and SweSAT for the use of their data.     

Random effects diagonal metric multidimensional scaling models

By assuming a distribution for the subject weights in a diagonal metric (INDSCAL) multidimensional scaling model, the subject weights become random effects. Including random effects in multidimensional scaling models offers several advantages over traditional diagonal metric models such as those fitted by the INDSCAL, ALSCAL, and other multidimensional scaling programs. Unlike traditional models, the number of parameters does not increase with the number of subjects, and, because the distribution of the subject weights is modeled, the construction of linear models of the subject weights and the testing of those models is immediate. Here we define a random effects diagonal metric multidimensional scaling model, give computational algorithms, describe our experiences with these algorithms, and provide an example illustrating the use of the model and algorithms.We would like to thank J. Douglas Carroll for early consultation of this research, and Robert I. Jennrich for commenting on an earlier draft of this paper and for help on the computational algorithms. James O. Ramsay and Forrest W. Young were instrumental in providing the example data. This work was supported in part by National Institute of Mental Health grant 1 R43 MH57559-01. We would also like to thank the anonymous referees for comments that helped to clarify our work.