Best Procedures For Sample-Free Item Analysis

Similar documents
Biostatistics Department Technical Report

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

A Simple Regression Problem

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Block designs and statistics

SPECTRUM sensing is a core concept of cognitive radio

Estimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples

Keywords: Estimator, Bias, Mean-squared error, normality, generalized Pareto distribution

3.3 Variational Characterization of Singular Values

Ensemble Based on Data Envelopment Analysis

A note on the multiplication of sparse matrices

Ch 12: Variations on Backpropagation

Meta-Analytic Interval Estimation for Bivariate Correlations

A Note on the Applied Use of MDL Approximations

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

Sequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5,

In this chapter, we consider several graph-theoretic and probabilistic models

OBJECTIVES INTRODUCTION

Estimation of the Population Mean Based on Extremes Ranked Set Sampling

An Introduction to Meta-Analysis

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

Non-Parametric Non-Line-of-Sight Identification 1

CS Lecture 13. More Maximum Likelihood

Projectile Motion with Air Resistance (Numerical Modeling, Euler s Method)

Boosting with log-loss

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels

Estimating Parameters for a Gaussian pdf

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

Machine Learning Basics: Estimators, Bias and Variance

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

Intelligent Systems: Reasoning and Recognition. Artificial Neural Networks

paper prepared for the 1996 PTRC Conference, September 2-6, Brunel University, UK ON THE CALIBRATION OF THE GRAVITY MODEL

Testing equality of variances for multiple univariate normal populations

Probability Distributions

Analyzing Simulation Results

Pattern Recognition and Machine Learning. Artificial Neural networks

Kinematics and dynamics, a computational approach

When Short Runs Beat Long Runs

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Feature Extraction Techniques

Ph 20.3 Numerical Solution of Ordinary Differential Equations

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period

arxiv: v1 [cs.ds] 3 Feb 2014

are equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,

The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information

Lower Bounds for Quantized Matrix Completion

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm

On the Maximum Likelihood Estimation of Weibull Distribution with Lifetime Data of Hard Disk Drives

What is Probability? (again)

C na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction

IN modern society that various systems have become more

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

Polygonal Designs: Existence and Construction

Randomized Recovery for Boolean Compressed Sensing

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:

Handwriting Detection Model Based on Four-Dimensional Vector Space Model

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

A remark on a success rate model for DPA and CPA

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition

Birthday Paradox Calculations and Approximation

Combining Classifiers

Modeling the Structural Shifts in Real Exchange Rate with Cubic Spline Regression (CSR). Turkey

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

Principal Components Analysis

Research in Area of Longevity of Sylphon Scraies

arxiv: v1 [stat.ot] 7 Jul 2010

LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES

A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version

Support recovery in compressed sensing: An estimation theoretic approach

Pattern Recognition and Machine Learning. Artificial Neural networks

Solving initial value problems by residual power series method

TABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS. By William W. Chen

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

A Smoothed Boosting Algorithm Using Probabilistic Output Codes

Inference in the Presence of Likelihood Monotonicity for Polytomous and Logistic Regression

COS 424: Interacting with Data. Written Exercises

Bayesian Approach for Fatigue Life Prediction from Field Inspection

Fixed-to-Variable Length Distribution Matching

Paul M. Goggans Department of Electrical Engineering, University of Mississippi, Anderson Hall, University, Mississippi 38677

Topic 5a Introduction to Curve Fitting & Linear Regression

Two New Unbiased Point Estimates Of A Population Variance

AN OPTIMAL SHRINKAGE FACTOR IN PREDICTION OF ORDERED RANDOM EFFECTS

Kernel Methods and Support Vector Machines

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Sharp Time Data Tradeoffs for Linear Inverse Problems

Lecture 21. Interior Point Methods Setup and Algorithm

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Examining the Effects of Site Selection Criteria for Evaluating the Effectiveness of Traffic Safety Countermeasures

AND FITTING OF SINGLE-CHANNEL DWELL

Optimal nonlinear Bayesian experimental design: an application to amplitude versus offset experiments

PULSE-TRAIN BASED TIME-DELAY ESTIMATION IMPROVES RESILIENCY TO NOISE

Bootstrapping Dependent Data

Bayes Estimation of the Logistic Distribution Parameters Based on Progressive Sampling

Stochastic Subgradient Methods

Transcription:

Best Procedures For Saple-Free Ite Analysis Benjain D. Wright University of Chicago Graha A. Douglas University of Western Australia Wright s (1969) widely used "unconditional" procedure for Rasch saple-free ite calibration is biased. A correction factor which akes the bias negligible is identified and deonstrated. Since this procedure, in spite of its superiority over "conditional" procedures, is nevertheless slow at calibrating 60 or ore ites, a siple approxiation which produces coparable estiates in a few seconds is developed. Since no procedure works on data containing persons or ites with infinite paraeter estiates, an editing algorith for preparing ite response data for calibration is appended. Wright and Panchapakesan (1969) described a procedure for saple-free ite analysis based on Rasch s siple logistic response odel (Rasch, 1960, 1966a, 1966b) and listed its. essential FOR- TRAN segents. Since then that procedure has been incorporated in a nuber of coputer progras for ite analysis and widely used in this country and abroad. The procedure described is incoplete in two inor but iportant ways. It entions neither the editing of incoing ite response data necessary to reove persons or ites whose paraeters will have infinite estiates nor the bias in estiation (Andersen, 1973) which the procedure entails, because the estiation equations are not conditioned for person ability. In addition, although the Wright-Panchapakesan procedure has proven far ore efficient and practical than any other ethod reported in the literature (Rasch, 1960; Andersen, 1972), it can nevertheless take a quarter of an hour on a sall coputer to handle a large proble. An approxiation which provided accurate calibrations, but executed ore rapidly, would be useful. We will refer to the Wright-Panchapakesan procedure as the &dquo;unconditional&dquo; solution. UCON. We will review UCON, discuss its inadequacies, report on an investigation of its bias, and describe a new &dquo;approxiate&dquo; calibration procedure, PROX, which we have found to be as accurate as UCON z under ordinary circustances and uch ore rapid. 281

282 The UncondiNonal Procedure The Rasch odel for binary observations defines the probability of a response x,i to ite i by person v as where x The likelihood of the data atrix (x~,) is the continued product of Equation 1 over all values of a and i, where L is the nuber of ites and N is the nuber of persons with test scores between 0 and L, since scores of 0 and L lead to infinite ability estiates. Upon taking logariths and letting and the log likelihood becoes The reduction of the data atrix (x,j) to its argins (rj and (s;) and the separation of rv{3,. and si6i in Equation 3 establish the sufficiency of r,. for estiating 0, and of s; for estiating 6i. It is iportant to recognize, of course, that although r, and si lead to sufficient estiates of {3v and 6i, they theselves are not satisfactory as estiates. Person score r, is not free fro the particular ite difficulties encountered in the test. Nor is ite score si free fro the ability distribution of the persons who happen to be taking the ite. To achieve independence fro these local factors requires

283 adjusting the observed r~ and si for the related ite difficulty and person-ability distributions to produce the test-free person easures and saple-free ite calibrations desired. L With a side condition such as X6i = 0 to restrain the indeterinacy of origin in the response paraeters, the first and second derivatives of A with respect to f3v and 6i becoe and where These are the equations necessary for unconditional axiu likelihood estiation. The solutions for ite difficulty estiates in Equations 6 and 7 depend on the presence of values for the personability estiates. Because unweighted test scores are the sufficient statistics for estiating people s abilities, all persons with identical scores obtain identical ability estiates. Hence, we ay group persons by their score, letting br be the ability estiate for any person with score r, di be the difficulty estiate of ite i, n, be the nuber of persons with score r. and write the estiated probability that a person with a score r will succeed on ite i as Then as far as estiates are concerned. A convenient algorith for coputing estiates (di) is: (i) Define an initial set of (br) as

284 (ii) Define an initial set of (d;), centered at d = 0, as where b/ is the axiu likelihood estiate of /3v for a test of.l equivalent ites centered at zero and d (O) is the siilarly centered axiu likelihood estiate of 6i for a saple of N equal-ability persons. (iii) Iprove each estiate di by applying the NeBB10n-Raphson ethod to Equation 6; i.e., until convergence at where and convergence to.01 is usually reached in three or four iterations. (iv) Recenter the set of (d;) at d = 0. (v) Using this iproved set of (d;), apply Newton-Raphson to Equation 4 to iprove each br until convergence at where (vi) Repeat steps (iii) through (v) until successive estiates of the whole set of (di) becoe stable, i.e.,

285 which usually takes three or four cycles. (vii) Use the reciprocal of the square root of the negative of the second derivatives defined in Equation 7 as asyptotic estiates of the standard errors of difficulty estiates, Andersen (1973) has shown that the presence of the ability paraeters (J3v) in the likelihood equation of this unconditional approach leads to biased estiates of ite difficulties (d;). Because siulations undertaken to test UCON in 1966 indicated that the factor (L-1 )/L would copensate for the bias, ost versions in use today contain that unbiasing coefficient. However, this correction factor was not entioned by Wright and Panchapakesan (1969) and no docuentation was published. The Bias in the Unconditional Procedure Our evaluation of the bias in UCON is based on a coparison of the unconditional estiation, Equation 6, and its conditional counterpart. Fro Equation 6 we have in which dt 1 is the biased UCON estiate of 6 i* Fro the conditional probability of a response vector (x,j) given a score r, naely, in which r has replaced P, so that Equation 18 is not a function of f3v, r and i is the su over all response vectors (x~,) with 2x~;= r, we derive (,~i), L in which

286 and The conditional axiu likelihood estiate of the ability br that goes with a score r then becoes br = 1 og(gr-;i gr). If we define the ability estiate that goes with a score of r, when ite i is reoved fro the test, as bri, then and the condition estiation equation coparable to Equation 17 becoes Since Equations 17 and 24 estiate siilar paraeters for identical data, we can set. Thus, the bias in the UCON estiate of ite difficulty d at person score r, when copared with the unbiased di, becoes The siplest way to correct d? would be with a correction factor k= dild*i. If we define c,,i=a,i/di as the relative bias in the difficulty estiate of ite i as score r. then the utility of which depends on how uch Cr, varies.. We explored the possibilities for k by studying how values of a,; and Cr, vary over r and di in a variety of typical test structures. For each test we i) Specified test length L and ite dispersion standard deviation Z for a noral distribution of ite difficulties; ii) Generated the consequent set of ite difficulties (d;); - iii) Calculated ability estiates fro (d;), naely,

... 287 iv) Arrived at the biases v) Calculated the ean relative bias The results are suarized in Table 1 for norally shaped tests of lengths L = 20, 30, 40, 50, and 80 and ite difficulty standard deviations of Z = 1.0, 1.5, 2.0, 2.5. The values ofc in Table 1 are well approxiated by 1/(L-1) regardless of Z. TABLE 1 Relative Bias in the Unconditional Procedure (Averaged over Ites and Scores)

288 This is the correction factor used in ost versions of UCON and coincides with the correction deducible in the siple case where L=2 and the unconditional estiates can be shown to be exactly twice the conditional ones. The correction factor (L-1)/L is based on averaging the relative bias Cr, over scores and ites. This assues that the distribution of ite difficulties and of persons over scores is ore or less unifor. In order to aster the extent to which skewed ite or person distributions ight interfere with the accuracy of the corrected UCON procedure, we also exained how bias varies with ite difficulty di and, at each difficulty, how it varies over scores. Table 2 shows how the eans and standard deviations of ari over r vary with di for a test of L = 20 and Z = 1.5 and also indicates the residual bias in d after applying the correction factor (L-1 )/L. TABLE 2 Means and Standard Deviations of Bias in the Unconditional Procedure (For Ites Averaged Over Scores) where

289 The results in Table 2 are typical of the cases we studied. The bias represented by a.; increases as di departs fro zero and can becoe substantial in short, wide tests. But, as the residual bias colun shows, the correction factor reoves this bias for all practical purposes. This leaves for investigation the fluctuation of bias over scores at a particular di which is ost extree when d; = 0. In order to evaluate the threat of this fluctuation, we exained the axiu bias standard deviations over a wide variety of tests. Table 3 gives these axia for the test covered in Table 1. Two trends are apparent: as test length increases the fluctuation of UCON bias over ite and score decreases, but as ite dispersion increases the fluctuation increases. However, as Table 2 illustrates, the axiu fluctuation of bias is aong ites at the center of the test where precision in ite cali- Z>1.5) bration has least effect on precision of person easureent. Only for short, wide tests (L<30, did the fluctuation in bias becoe detectable in the corrected estiates of ite difficulty, and then only when the distribution of ites or persons was distinctly skewed. for a typical test of L=30, Z=1 bias had standard deviations over an ite or score of.02 or less, virtually nil, and was successfully corrected for. Thus, we found the corrected UCON procedure to be indistinguishable in results fro the conditional procedure. Fro a practical point of view, however, even the calibration accuracy available in UCON ay be ore than is needed for adequate easureent. When we studied (Wright and Douglas, 1975) the deterioration of easureent precision which arises when errors are introduced into the estiation of ite paraeters by generating disturbed ite difficulties, with di 6i = + e; and e; norally distributed around zero, we found that, for test designs encountered_in practice, rando disturbances in ite calibration ei can be as large as 1 logit before distortions in the estiates of (3, reached 0.1 logit. In view of this robustness with respect to easureent precision, we concluded that even the corrected UCON ay be unnecessarily precise in any applications and that a further approxiation would be useful. TABLE 3 Maxiu Standard Deviations of Bias in the Unconditiona l Procedure (For Ites Over Scores) where

290 The Approxiate Procedure In order to discover a satisfactory shortcut to UCON we return to the crude initial estiates for UCON given by Equation 10 and note that they are exact when the variation in ability is zero. The first row of Table 4 contains estiates of this kind for a typical test. Coparison with the UCON estiates in the second row shows that these estiates are too crude. The extree ites are not far enough out on the latent variable. What is needed is an expansion factor to take into account the dispersion in abilities. A siple approach to this dispersion (for which we are grateful to Leslie Cohen of the University of Southapton) is to assue that abilities are norally distributed, and so can be adequately described by their ean and variance. It is not necessary for abilities actually to be distributed in this way in order to use the assuption as the basis for developing an approxiate calibration procedure, the utility of which can be investigated. In our study of best test design (Wright and Douglas, 1975), we developed an approxiation for the ability estiate br when the ite difficulties (d;) are norally distributed. Extensive siulations showed that this forula gave results extreely close to the axiu likelihood ability estiates. By interchanging ites and abilities we arrived at a siilar forula for approxiating an ite difficulty estiate di when people s abilities are norally distributed: where V6 is the observed variance of the estiated abilities and the constant, 1.7, arises because the relation between the noral and logistic cuulative distributions, j<) (X)-~ (1.7x))<.01 for all x, is used as a basis for equating and exchanging the in the derivation of the approxiation (see Wright and Douglas, 1975, for details). TABLE 4 Ite Difficulty Estiates Based on Initial,UCON and PROX Procedures, for a Moderately Skewed Set of 60 Ites

291 The way in which this forula can be used for approxiate ite calibration outlined in the following sequence: - - -- ii) Define initial ability estiates and find their variance where iii) Set iv) Obtain the variance of these ite estiates. V d(j), an ite expansion factor arrive at a revised set of ability estiates and repeat (iii) and (iv) until convergence to v) At convergence, estiate the standard errors of ite difficulty estiates by using the analogous approxiations: The final row of Table 4 shows the estiates produced by PROX for siulated data in which neither ites nor persons were norally distributed. For all practical purposes, the PROX estiates are equivalent to the estiates obtained fro UCON.

292 Coparisons of UCON and PROX for Accuracy The siulations used to evaluate the perforance of these procedures were set up to expose their biases. We copared their estiates with known generating paraeters for calibrating saples which did not coincide with the tests on the latent variable. Saples for which the test was off-target. i.e., either too difficult or too easy, were used because that is the situation which produces the poorest ite difficulty estiation. i) For each &dquo;test&dquo; to be studied, a set ofl norally distributed ite difficulties was generated with a ean zero and a standard deviation Z. Although a great any cobinations of L and Z were reviewed. tests of length 20 and 40 and Z s of 1 and 2 are sufficient to suarize the results. ii) For each of these tests, 500 &dquo;persons&dquo; norally distributed in ability with a ean M, a standard deviation SD and an upper truncation of TR, were siulated for exposure to the test. Truncation was set to induce a pronounced skew in the ability distribution. iii) Each ability was cobined with each difficulty to yield a probability of success, and this probability was copared with a unifor rando nuber to produce a stochastic response. These responses were accuulated into the data vectors (si) and (nr) necessary for ite calibration. iv) Ite paraeters and their standard errors were estiated by each procedure. v) Steps (ii)-(iv) were repeated 15 ties for each test so that there were 15 replications of (s;) and (n,) with which to investigate the discrepancies aong the ethods. Table 5 shows how v-ell PROX perfors in coparison with UCON, even for oderately skewed saples. Only in the extree case, where ites range fro -4 to +4 and the saple has a ean of 2, standard deviation of 2. and is truncated at 4.5, does PROX becoe potentially unreliable. In this instance even UCON is not very satisfactory. When a reasonable editing of the data is undertaken before estiation so that extree ites such as those which interfered with successful calibration in case 12 in Table 5 are eliinated, then PROX is equivalent to UCON as far as accuracy of estiation is concerned. As for coputing efficiency, both UCON and PROX were applied to the 60-ite test used for Table 4. The coputer was a basic IBM 1130. The core storage used by the estiation portions of UCON and PROX were 740 and 672 bytes. The resulting ite calibrations were within.03 of one another, as Table 4 suggests. But the ties taken were draatically different. UCON took 314 seconds to converge to its estiates. PROX took 8 seconds. We found this ratio of about 40 to 1 to be typical for probles in the 50 to 60 ite range. PROX is ore that 40 ties faster than UCON for larger probles. However, for sall probles of 20 to 30 ites, the tie advantage of PROX is not so draatic, and when the calibrating saple (or the distribution of ite difficulties) is arkedly skewed. PROX can err by several tenths of a logit in soe of its ite difficulty estiates, as case 12 in Table 5 docuents. Editing Data Before Calibration The calibration procedures described in the previous pages depend upon the arginals of a data atrix (x,.;) for input, where v=l,n for persons and i=1,l for ites. When we su the entries (0 for incorrect and 1 for correct) in the,, &dquo; row of such a atrix, we obtain a score for the Vrh person, r... When we su the i h colun, we obtain a score si for the i&dquo; ite, reporting the nuber of persons who responded with a correct answer to ite i. Since the ability estiates are &dquo;ite-free,&dquo; we ay group subjects according to their scores. Thus, the initial N pieces of inforation in the person arginals ay be reduced to L+1 pieces by ietting n, be the nuber of persons at each raw score r. The vector (nr) is the frequency distribution of scores.

293 N JC 4J < n M JC +- u V)fO N UJ I-- U3 0 C: <U 0 U3 <0!- i V ) 0...--0 <0 0 E S- ow 2:0 U3U3 =! C: 0 0 5 <0 <0 > U or- UJ i r.on. ti- N d _ U3 10 ~ w S- f&horbar; ~! -0 C: <U 0 U O C3 S- N a. cn o &dquo; U3 N &dquo;0 r- C: CL as E 2: t~ o U &dquo;0» «4- ~cs 0 (-) C U3> rti i -r- t&horbar; 1 I- < Ul rt V o v C S- v s- - tt- E 4-.. or- 1 </) *0 G- UQ) nu3 E N S.. ~ - - Or- q- ww cn Or- 0 C -0.r w -I- (/)Q)::3 U3«1-o cc3 S > ne- U r a7 d-~ ~i-.1-~ M 0 =3 «t/t 0 ~ V1 E N «(U-r-+JfC 3 r +~ 4- N QJ 0 S- ~: «N > OJC04- uo 0 Cor- Q) «1U3 s- <o (0 E Q)U::3Q) 4-- r CT -1-~ 4- r- N r-- or- CL ~3 <U C S- S-tOQ) E Q» ::3LO EO E &horbar; or- 4-~C X 4-0 tts <0 0 0 <U E s..e C n <U <0 <D <U iii -e-«l1-121 tj- - c:c 0..x X NQ Q S: LLt x Q~~ L S- 3 3

294 Finite estiates of ability for persons who obtain zero and perfect scores, however, do not exist. When a person gets all ites correct, we have no evidence that he is not perfect and can only estiate his ability as infinitely high. When a person gets all ites incorrect, we have no evidence that he can succeed at all and can only estiate his ability as infinitely low. Siilarly, it will be ipossible to obtain finite estiates of ite paraeters for those ites which nobody or everybody has answered correctly. These restrictions ean that we require a prior editing of the data atrix before a calibration procedure can be applied. This editing can be accoplished in the following anner: i) Drop persons with initial r 0 and = r = L. ii) Scan the ite score vector (s;) for i=1.l: a) Ifs,=0.then 1. drop ite i fro the test and decrease test length by 1 2. drop the nl-1 persons who now have perfect scores and decrease saple size by n1_, 3. reove their responses fro the ite scores in the ite score vector (s;) 4. return to (a) with i =1. b) If s; = N, then 1. drop ite i fro the test and decrease test length by 1 2. drop the n, persons who now have zero scores and decrease saple size by n; 3. shift each score group down one 4. return to (b) with i = 1. References Andersen, E. B. The nuerical solution of a set of conditional estiation equations. The Journal of the Royal Statistical Society. Series B, 1972. 34 (1), 42-54. Andersen, E. B. Conditional in ference and odels for easuring. Copenhagen, Denark: Mentalhygiejnisk Forlag, 1973. Rasch. G. Probabilistic odels for soe intelligence and attainent tests. Copenhagen. Denark: Danarks Paedogogiske Institut, 1960. Rasch, G. An individualistic approach to ite analysis. In P. F. Lazarsfeld and N.W. Henry (Eds.), Readings in atheatical social sciences. Chicago: Science Research Associates, 1966. (a)

295 Rasch, G. An ite analysis which takes individual differences into account. British Journal of Matheatical and Statistical Psychology, 1966. 19. 49-57. (b) Wright B. D. & Douglas, G. A. Best test design and self-tailored testing. (Research Meorandu No. 19). University of Chicago. Departent of Education. Statistical Laboratory, 1975. Wright, B. D. & Panchapakesan, N. A procedure for saple-free ite analysis. Educational and Psychological Measureent. 1969, 29, 23-48. Author s Address Benjain D. Wright, Departent of Education, 5835 Kibark Ave., University of Chicago, Chicago, IL 60037.