Fitting longitudinal reduced-rank regression models by alternating least squares

An alternating least squares method for iteratively fitting the longitudinal reduced-rank regression model is proposed. The method uses ordinary least squares and majorization substeps to estimate the unknown parameters in the system and measurement equations of the model. In an example with cross-sectional data, it is shown how the results conform closely to results from eigenanalysis. Optimal scaling of nominal and ordinal variables is added in a third substep, and illustrated with two examples involving cross-sectional and longitudinal data.Financial support by the Institute for Traffic Safety Research (SWOV) in Leidschendam, The Netherlands is gratefully acknowledged.     

Spatial and conjoint models based on pairwise comparisons of dissimilarities and combined effects: Complete and incomplete designs

In pairwise multidimensional scaling, a spatial representation for a set of objects is determined from comparisons of the dissimilarity of any two objects drawn from the set to the dissimilarity of other pairs of objects drawn from that set. In pairwise conjoint scaling, comparisons among the joint effects produced by pairs of objects, where the objects in a pair are drawn from separate sets, are used to determine numerical representations for the objects in each set. Monte Carlo simulations of both pairwise dissimilarities and pairwise conjoint effects show that Johnson's algorithm can provide good metric recovery in the presence of high levels of error even when only a small percentage of the complete set of pairwise comparisons are tested.     

Restricted multidimensional scaling models for asymmetric proximities

Restricted multidimensional scaling models [Bentler & Weeks, 1978] allowing constraints on parameters, are extended to the case of asymmetric data. Separate functions are used to model the symmetric and antisymmetric parts of the data. The approach is also extended to the case in which data are presumed to be linearly related to squared distances. Examples of several models are provided, using journal citation data. Possible extensions of the models are considered. This research was supported in part by USPHS Grant 0A01070, P. M. Bentler, principal investigator, and NIMH Grant MH-24819, E. J. Anthony and J. Worland, principal investigators. The authors wish to thank E. W. Holman and several anonymous reviewers for their valuable suggestions concerning this research.     

A note on the investigation of local and global identifiability

In general, nonlinear models such as those commonly employed for the analysis of covariance structures, are not globally identifiable. Any investigation of local identifiability must either yield a mapping of identifiability onto the entire parameter space, which will rarely be feasible in any applications of interest, or confine itself to the neighbourhood of such points of special interest as the maximum likelihood point.The author would like to thank J. Jack McArdle and Colin Fraser for their comments on this paper.     

Generalized eigenvalue problems with positive semi-definite matrices

In a recent paper in this journal McDonald, Torii, and Nishisato show that generalized eigenvalue problems in which both matrices are singular can sometimes be solved by reducing them to similar problems of smaller order. In this paper a more extensive analysis of such problems is used to sharpen and clarify the results of McDonald, Torii, and Nishisato. Possible extensions are also indicated. The relevant mathematical literature is reviewed briefly.     

The use of latent class models for assessing prerequisite relations and transference among traits

This paper presents a strategy for pairwise assessment which may be used to evaluate the nature of both prerequisite and transference relations existing among a set of traits. This strategy is appropriate for use both within a confirmatory context, in which an attempt is made to establish the validity of some specified set of relations among traits, as well as within an exploratory context, in which a search is made for unconjectured prerequisite and transference relations existing between pairs of traits. Both uses of this strategy are based on a variety of latent class models which are representative of various possible relational states existing between pairs of traits. Thus, the nature of trait relations may be investigated through the use of statistical assessments of both absolute and relative fit attained by these models. An application is presented to exemplify how this strategy may be used within the exploratory context.The author is obliged to Clifford Clogg, C. Mitchell, Dayton, and William Schafer for helpful comments made regarding a previous draft of this paper as well as to Mary Papageorgiou who provided access to the data which was considered in this study.     

Temporal control of behavior and the power law

The performance of rats and pigeons under fixed-interval schedules was studied in two experiments. The duration of postreinforcement pause was a declining proportion of fixed-interval duration. For pigeons this was true both when the duration of the reinforcer was fixed and when it was increased in direct proportion to increases in fixed-interval duration; the longer reinforcer durations did, however, lengthen the postreinforcement pause at higher schedule values. A quantitative analysis of data from Experiments 1 and 2 and from other studies showed that fractional exponent power functions described the relationship between postreinforcement pause and fixed-interval value; similar functions have previously been observed in studies of temporal differentiation. It was concluded that power functions reflect a direct causal, rather than artifactual, relationship between performance and the temporal requirements of reinforcement schedules.     

Axiomatic and numerical conjoint measurement: An evaluation of diagnostic efficacy

Synthetic data are used to examine how well axiomatic and numerical conjoint measurement methods, individually and comparatively, recover simple polynomial generators in three dimensions. The study illustrates extensions of numerical conjoint measurement (NCM) to identify and model distributive and dual-distributive, in addition to the usual additive, data structures. It was found that while minimum STRESS was the criterion of fit, another statistic, predictive capability, provided a better diagnosis of the known generating model. That NCM methods were able to better identify generating models conflicts with Krantz and Tversky's assertion that, in general, the direct axiom tests provide a more powerful diagnostic test between alternative composition rules than does evaluation of numerical correspondence. For all methods, dual-distributive models are most difficult to recover, while consistent with past studies, the additive model is the most robust of the fitted models.Douglas Emery is now at the Krannert Graduate School of Management, Purdue University, West Lafayette, IN, on leave from the University of Calgary.     

On Herrnstein's equation and related forms

In 1970, Herrnstein proposed a simple equation to describe the relation between response and reinforcement rates on interval schedules. Its empirical basis is firm, but its theoretical foundation is still uncertain. Two approaches to the derivation of Herrnstein's equation are discussed. It can be derived as the equilibrium solution to a process model equivalent to familiar linear-operator learning models. Modifications of this approach yield competing power-function formulations. The equation can also be derived from the assumption that response strength is proportional to reinforcement rate, given that there is a ceiling on response rate. The proportional relation can, in turn, be derived from a threshold assumption equivalent to Shimp's “momentary maximizing”. This derivation implies that the two parameters of Herrnstein's equation should be correlated, and may explain its special utility in application to internal schedules.     

Correctness of Kruskal's algorithms for monotone regression with ties

Kruskal has proposed two modifications of monotone regression that can be applied if there are ties in nonmetric scaling data. In this note we prove Kruskal's conjecture that his algorithms give the optimal least squares solution of these modified monotone regression problems. We also propose another (third) approach for dealing with ties.Comments by Dr. J. B. Kruskal have been most helpful.