OSA's Digital Library

Journal of the Optical Society of America

Journal of the Optical Society of America

  • Vol. 45, Iss. 5 — May. 1, 1955
  • pp: 373–378

New Method for the Assignment of Psychometric Scale Values from Incomplete Paired Comparisons

J. H. MORRISSEY  »View Author Affiliations


JOSA, Vol. 45, Issue 5, pp. 373-378 (1955)
http://dx.doi.org/10.1364/JOSA.45.000373


View Full Text Article

Acrobat PDF (691 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

The principle of least squares is applied to the selection of an optimum set of n response values, or of (n-1) basic response differences, corresponding to n stimuli, from m observed response differences provided by the paired-comparison method of psychometric measurement. This method of selection is shown to be the most appropriate generalization, to the case of a usable but incomplete set, i.e., with n-1≦mn(n-1), of observed response differences, of a corrected form of the algorithm of J. P. Guilford. Unlike the Guilford algorithm, however, direct application of the least-squares principle implies response values which are independent of the a priori ordering of the n stimuli, even in the incomplete-set case.

Citation
J. H. MORRISSEY, "New Method for the Assignment of Psychometric Scale Values from Incomplete Paired Comparisons," J. Opt. Soc. Am. 45, 373-378 (1955)
http://www.opticsinfobase.org/josa/abstract.cfm?URI=josa-45-5-373


Sort:  Author  |  Journal  |  Reset

References

  1. L. L. Thurstone, Am. J. Psychol. 38, 368–389 (1927)
  2. F. Kottler, unpublished work.
  3. J. P. Guilford, Psyclhomtetric Metllods (McGraw-Hill Book Company, Inc., New York, 1936), pp. 217–243.
  4. It can be shown, however, that the Guilford-type solution is equivalent to the new method only if these apparent redundancies are not discarded. Their retention characterizes the "corrected form of the algorithm of J. P. Guilford" mentioned in the abstract. of this paper.
  5. A convenient method for the inversion of integer-element matrices, using row transformations only, is given by J. Barkley Rosser in J. Research Natl. Bur. Standards 49, 349 (No. 5, November, 1952).
  6. This departure, for derivation only, is temporary.
  7. P. S. Dwyer, Ann. Math. Stat. (1)15, 82 (March, 1944).
  8. An alternative procedure, which will not be further elaborated here, for avoiding the impasse resulting from singularity of AA, where A′ is not augmented as described above, is to factor A into a product of two rank-(n-1) matrices B and M, where M consists of (n-1) rows, each specifying a differencing operation, and then to solve for the (n-1)-element vector represented by the matrix product Mr; this procedure involves the inversion of the (n-1) × (n-l) symmetric matrix BB, which is generally nonsingular. An interesting feature of this solution for Mr, entirely equivalent to that for r, is its interpretation as the correct way to calculate, according to the least-squares principle, a set of (n-1) "basic differences," the objective of the Guilford "differencing" algorithm.
  9. In this case, the new method degenerates into the Kottler "summation algorithm."
  10. G. C. Higgins and R. N. Wolfe, J. Opt. Soc. Am. 45, 121 (1955).

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited