A minimum-cost network-flow solution to the case V thurstone scaling problem

This paper presents an approach for determining unidimensional scale estimates that are relatively insensitive to limited inconsistencies in paired comparisons data. The solution procedure, shown to be a minimum-cost network-flow problem, is presented in conjunction with a sensitivity diagnostic that assesses the influence of a single pairwise comparison on traditional Thurstone (ordinary least squares) scale estimates. When the diagnostic indicates some source of distortion in the data, the network technique appears to be more successful than Thurstone scaling in preserving the interval scale properties of the estimates.My special thanks go to Alvin Silk, Thomas Magnanti, and Roy Welsch for their support and advice throughout the formative stages of this paper, and to V. Srinivasan for his helpful comments on a later draft of this paper. I also wish to thank the Editor, Associate Editor, and two reviewers for their constructive suggestions.James M. Lattin is Associate Professor of Marketing and Management Science and the James and Doris McNamara Faculty Fellow for 1988-1989.     

Least squares metric,unidimensional scaling of multivariate linear models

The squared error loss function for the unidimensional metric scaling problem has a special geometry. It is possible to efficiently find the global minimum for every coordinate conditioned on every other coordinate being held fixed. This approach is generalized to the case in which the coordinates are polynomial functions of exogenous variables. The algorithms shown in the paper are linear in the number of parameters. They always descend and, at convergence, every coefficient of every polynomial is at its global minimum conditioned on every other parameter being held fixed. Convergence is very rapid and Monte Carlo tests show the basic procedure almost always converges to the overall global minimum.The author thanks Ivo Molenaar, three anonymous referees, and Howard Rosenthal for their many helpful comments.     

A two-stage algorithm for assessing violations of additivity via axiomatic and numerical conjoint analysis

An algorithm for assessing additivity conjunctively via both axiomatic conjoint analysis and numerical conjoint scaling is described. The algorithm first assesses the degree of individual differences among sets of rankings of stimuli, and subsequently examines either individual or averaged data for violations of axioms necessary for an additive model. The axioms are examined at a more detailed level than has been previously done. Violations of the axioms are broken down into different types. Finally, a nonmetric scaling of the data can be done based on either or both of two different badness-of-fit scaling measures. The advantages of combining all of these features into one algorithm for improving the diagnostic value of axiomatic conjoint measurement in evaluating additivity are discussed.     

An upper bound for sstress

In this note we derive an upper bound for the minimum for the multidimensional scaling loss function sstress. We conjecture that minimum sstress solution will be biased towards regular positioning of clumps of points over the surface of a sphere.This study has been supported by the Nederlandse Organisatie voor Zuiver Wetenschappelijk Onderzoek (Netherlands Organization for the Advancement of Pure Research) under grant 56–97.     

A stochastic multidimensional scaling vector threshold model for the spatial representation of “pick any/n” data

This paper presents a new stochastic multidimensional scaling vector threshold model designed to analyze pick any/n choice data (e.g., consumers rendering buy/no buy decisions concerning a number of actual products). A maximum likelihood procedure is formulated to estimate a joint space of both individuals (represented as vectors) and stimuli (represented as points). The relevant psychometric literature concerning the spatial treatment of such binary choice data is reviewed. The nonlinear probit type model is described, as well as the conjugate gradient procedure used to estimate parameters. Results of Monte Carlo analyses investigating the performance of this methodology with synthetic choice data sets are presented. An application concerning consumer choices for eleven competitive brands of soft drinks is discussed. Finally, directions for future research are presented in terms of further applications and generalizing the model to accommodate three-way choice data.     

独体汉字的字形相似性研究

本文以速示呈现方式获得了一系列独体汉字和字符的混淆矩阵。用Luce（1963）的选择模型特混淆矩阵分解为对称的相似矩阵和反应倾向矢量。基于相似矩阵,以聚类分析和多维量表法探索了汉字和字符的视觉特征及其表征形式,为揭示汉字视觉特征的几何特性和潜在结构,在研究方法上作了有意义的偿试、此外,本研究的结果支持了作者（1995）关于在含“十”或“口”的独体汉字中,“十”与“口”是该类汉字的突出视觉特征的结论。     

A stochastic multidimensional unfolding approach for representing phased decision outcomes

This paper presents a stochastic multidimensional unfolding (MDU) procedure to spatially represent individual differences in phased or sequential decision processes. The specific application or scenario to be discussed involves the area of consumer psychology where consumers form judgments sequentially in their awareness, consideration, and choice set compositions in a phased or sequential manner as more information about the alternative brands in a designated product/service class are collected. A brief review of the consumer psychology literature on these nested congnitive sets as stages in phased decision making is provided. The technical details of the proposed model, maximum likelihood estimation framework, and algorithm are then discussed. A small scale Monte Carlo analysis is presented to demonstrate estimation proficiency and the appropriateness of the proposed model selection heuristic. An application of the methodology to capture awareness, consideration, and choice sets in graduate school applicants is presented. Finally, directions for future research and other potential applications are given.     

Spatial,non-spatial and hybrid models for scaling

In this paper, hierarchical and non-hierarchical tree structures are proposed as models of similarity data. Trees are viewed as intermediate between multidimensional scaling and simple clustering. Procedures are discussed for fitting both types of trees to data. The concept of multiple tree structures shows great promise for analyzing more complex data. Hybrid models in which multiple trees and other discrete structures are combined with continuous dimensions are discussed. Examples of the use of multiple tree structures and hybrid models are given. Extensions to the analysis of individual differences are suggested.1976 Psychometric Society Presidential Address.While people too numerous to list here have contributed ideas, inspiration, and other help, I particularly wish to acknowledge the contributions of Sandra Pruzansky, without whom this paper could not have been written. I would also like to acknowledge the past contributions of my long-time colleague Jih-Jie Chang, without whose help I probably would not have beenasked to write it.     

External analysis with three-mode principal component models

Through external analysis of two-mode data one attempts to map the elements of one mode (e.g., attributes) as vectors in a fixed space of the elements of the other mode (e.g., stimuli). This type of analysis is extended to three-mode data, for instance, when the ratings are made by more individuals. It is described how alternating least squares algorithms for three-mode principal component analysis (PCA) are adapted to enable external analysis, and it is demonstrated that these techniques are useful for exploring differences in the individuals' mappings of the attribute vectors in the fixed stimulus space. Conditions are described under which individual differences may be ignored. External three-mode PCA is illustrated with data from a person perception experiment, designed after two studies by Rosenberg and his associates whose results were used as external information.We gratefully acknowledge the assistance of Piet Brouwer in implementing the external analysis options in the TUCKALS programs.     

A note on the determination of configuration and weights for a class of individual scaling models

Consider the typical problem in individual scaling, namely finding a common configuration and weights for each individual from the given interpoint distances or scalar products. Within the STRAIN framework it is shown that the problem of determining weights for a given configuration can be posed as a standard quadratic programming problem. A set of necessary conditions for an optimal configuration to satisfy are given. A closed form expression for the configuration is obtained for the one dimensional case and an approach is given for the two dimensional case.