Identifying Guttman Structures in Incomplete Rasch Datasets

In applications of IRT, it often happens that many examinees omit a substantial proportion of item responses. This can occur for various reasons, though it may well be due to no more than the simple fact of design incompleteness. In such circumstances, literature not infrequently refers to various types of estimation problem, often in terms of generic “convergence problems” in the software used to estimate model parameters. With reference to the Partial Credit Model and the instance of data missing at random, this article demonstrates that as their number increases, so does that of anomalous datasets, intended as those not corresponding to a finite estimate of (the vector parameter that identifies) the model. Moreover, the necessary and sufficient conditions for the existence and uniqueness of the maximum likelihood estimation of the Partial Credit Model (and hence, in particular, the Rasch model) in the case of incomplete data are given – with reference to the model in its more general form, the number of response categories varying according to item. A taxonomy of possible cases of anomaly is then presented, together with an algorithm useful in diagnostics.     

Fractional Factorial Designs for Model-Based Evaluation of Customer Preferences

In this article, we explore the connection between Conjoint Analysis (CA) and a recent theory for minimum size orthogonal fractional factorial design generation (Fontana, 2013 Fontana , R. ( 2013 ). Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming . Computat. Statist. 28 : 241 – 253 .[Crossref], [Web of Science ®] , [Google Scholar]).

We show how searching for a minimum size OFFD that satisfies a set of constraints, expressed in terms of orthogonality between simple and interaction effects, is equivalent to solving an integer linear programming problem. It is worth noting that the methodology puts no restriction either on the number of levels of each factor or on the orthogonality constraints and so it can be applied to a very wide range of designs, including mixed orthogonal arrays. An algorithm, that has been implemented in SAS/IML, is briefly described.

The use of this algorithm during the design stage of a generic CA is shown in two applications.     

Graphical evaluation of robust parameter designs based on extended scaled prediction variance and extended spherical average prediction variance

For any response surface design, there are locations in the design region where responses are estimated well and locations where estimation is relatively poor. Consequently, graphical evaluation—such as variance dispersion graphs and the fraction of design space—is used as an alternative to a single-valued criterion. Such plots are used to investigate and compare the prediction capabilities of certain response surface designs currently available to the researcher. In this article, we propose the extended scaled prediction variance and extended spherical average prediction variance as prediction methods. We also illustrate how graphical methods can be employed to evaluate robust parameter designs.     

Optimal two-level conjoint designs with constant attributes in the profile sets

We propose a simple strategy to construct D-, A-, G- and V-optimal two-level designs for rating-based conjoint studies with large numbers of attributes. In order to simplify the rating task, the designs hold one or more attributes at a constant level in each profile set. Our approach combines orthogonal designs and binary incomplete block designs with equal replication. The designs are variance-balanced meaning that they yield an equal amount of information on each of the part-worths.     

Bayesian D-optimal supersaturated designs

We introduce a new class of supersaturated designs using Bayesian D-optimality. The designs generated using this approach can have arbitrary sample sizes, can have any number of blocks of any size, and can incorporate categorical factors with more than two levels. In side by side diagnostic comparisons based on the E(s²)$E(s^2)$ criterion for two-level experiments having even sample size, our designs either match or out-perform the best designs published to date. The generality of the method is illustrated with quality improvement experiment with 15 runs and 20 factors in 3 blocks.     

New 3-level response surface designs constructed from incomplete block designs

Box and Behnken [1958. Some new three level second-order designs for surface fitting. Statistical Technical Research Group Technical Report No. 26. Princeton University, Princeton, NJ; 1960. Some new three level designs for the study of quantitative variables. Technometrics 2, 455–475.] introduced a class of 3-level second-order designs for fitting the second-order response surface model. These 17 Box–Behnken designs (BB designs) are available for 3–12 and 16 factors. Although BB designs were developed nearly 50 years ago, they and the central-composite designs of Box and Wilson [1951. On the experimental attainment of optimum conditions. J. Royal Statist. Soc., Ser. B 13, 1–45.] are still the most often recommended response surface designs. Of the 17 aforementioned BB designs, 10 were constructed from balanced incomplete block designs (BIBDs) and seven were constructed from partially BIBDs (PBIBDs). In this paper we show that these seven BB designs constructed from PBIBDs can be improved in terms of rotatability as well as average prediction variance, D$D$- and G$G$-efficiency. In addition, we also report new orthogonally blocked solutions for 5, 8, 9, 11 and 13 factors. Note that an 11-factor BB design is available but cannot be orthogonally blocked. All new designs can be found at http://www.math.montana.edu/∼$\sim$jobo/bbd/.     

Classification of orthogonal arrays by integer programming

The problem of classifying all isomorphism classes of OA(N,k,s,t)$\mathrm{OA}(N,k,s,t)$'s is shown to be equivalent to finding all isomorphism classes of non-negative integer solutions to a system of linear equations under the symmetry group of the system of equations. A branch-and-cut algorithm developed by Margot [2002. Pruning by isomorphism in branch-and-cut. Math. Programming Ser. A 94, 71–90; 2003a. Exploiting orbits in symmetric ILP. Math. Programming Ser. B 98, 3–21; 2003b. Small covering designs by branch-and-cut. Math. Programming Ser. B 94, 207–220; 2007. Symmetric ILP: coloring and small integers. Discrete Optim., 4, 40–62] for solving integer programming problems with large symmetry groups is used to find all non-isomorphic OA(24,7,2,2)$\mathrm{OA}(24,7,2,2)$'s, OA(24,k,2,3)$\mathrm{OA}(24,k,2,3)$'s for 6?k?11$6?k?11$, OA(32,k,2,3)$\mathrm{OA}(32,k,2,3)$'s for 6?k?11$6?k?11$, OA(40,k,2,3)$\mathrm{OA}(40,k,2,3)$'s for 6?k?10$6?k?10$, OA(48,k,2,3)$\mathrm{OA}(48,k,2,3)$'s for 6?k?8$6?k?8$, OA(56,k,2,3)$\mathrm{OA}(56,k,2,3)$'s, OA(80,k,2,4)$\mathrm{OA}(80,k,2,4)$'s, OA(112,k,2,4)$\mathrm{OA}(112,k,2,4)$'s, for k=6,7$k=6,7$, OA(64,k,2,4)$\mathrm{OA}(64,k,2,4)$'s, OA(96,k,2,4)$\mathrm{OA}(96,k,2,4)$'s for k=7,8$k=7,8$, and OA(144,k,2,4)$\mathrm{OA}(144,k,2,4)$'s for k=8,9$k=8,9$. Further applications to classifying covering arrays with the minimum number of runs and packing arrays with the maximum number of runs are presented.     

Cost-cautious designs for confirmatory bioassay

Confirmatory bioassay experiments take place in late stages of the drug discovery process when a small number of compounds have to be compared with respect to their properties. As the cost of the observations may differ considerably, the design problem is well specified by the cost of compound used rather than by the number of observations. We show that cost-efficient designs can be constructed using useful properties of the minimum support designs. These designs are particularly suited for studies where the parameters of the model to be estimated are known with high accuracy prior to the experiment, although they prove to be robust against typical inaccuracies of these values. When the parameters of the model can only be specified with ranges of values or by a probability distribution, we use a Bayesian criterion of optimality to construct the required designs. Typically, the number of their support points depends on the prior knowledge for the model parameters. In all cases we recommend identifying a set of designs with good statistical properties but different potential costs to choose from.