The representation of three-way proximity data by single and multiple tree structure models

Models for the representation of proximity data (similarities/dissimilarities) can be categorized into one of three groups of models: continuous spatial models, discrete nonspatial models, and hybrid models (which combine aspects of both spatial and discrete models). Multidimensional scaling models and associated methods, used for thespatial representation of such proximity data, have been devised to accommodate two, three, and higher-way arrays. At least one model/method for overlapping (but generally non-hierarchical) clustering called INDCLUS (Carroll and Arabie 1983) has been devised for the case of three-way arrays of proximity data. Tree-fitting methods, used for thediscrete network representation of such proximity data, have only thus far been devised to handle two-way arrays. This paper develops a new methodology called INDTREES (for INdividual Differences in TREE Structures) for fitting various(discrete) tree structures to three-way proximity data. This individual differences generalization is one in which different individuals, for example, are assumed to base their judgments on the same family of trees, but are allowed to have different node heights and/or branch lengths.We initially present an introductory overview focussing on existing two-way models. The INDTREES model and algorithm are then described in detail. Monte Carlo results for the INDTREES fitting of four different three-way data sets are presented. In the application, a single ultrametric tree is fitted to three-way proximity data derived from intention-to-buy-data for various brands of over-the-counter pain relievers for relieving three common types of maladies. Finally, we briefly describe how the INDTREES procedure can be extended to accommodate hybrid modelling, as well as to handle other types of applications.

[1]  J. Carroll,et al.  Spatial, non-spatial and hybrid models for scaling , 1976 .

[2]  Singiresu S. Rao,et al.  Optimization Theory and Applications , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  A. Tversky,et al.  Additive similarity trees , 1977 .

[4]  Suzanne Winsberg,et al.  Monotone spline transformations for dimension reduction , 1983 .

[5]  J. Farris.  Estimating Phylogenetic Trees from Distance Matrices , 1972, The American Naturalist.

[6]  L. Tucker.  Relations between multidimensional scaling and three-mode factor analysis , 1972 .

[7]  J. Chang,et al.  Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition , 1970 .

[8]  W. DeSarbo.  Gennclus: New models for general nonhierarchical clustering analysis , 1982 .

[9]  J. Hartigan.  REPRESENTATION OF SIMILARITY MATRICES BY TREES , 1967 .

[10]  J. Cunningham,et al.  Free trees and bidirectional trees as representations of psychological distance , 1978 .

[11]  A. Tversky,et al.  Spatial versus tree representations of proximity data , 1982 .

[12]  P. Arabie,et al.  Indclus: An individual differences generalization of the adclus model and the mapclus algorithm , 1983 .

[13]  G. Soete.  A least squares algorithm for fitting additive trees to proximity data , 1983 .

[14]  P. Arabie,et al.  Mapclus: A mathematical programming approach to fitting the adclus model , 1980 .

[15]  Forrest W. Young,et al.  Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features , 1977 .

[16]  Philip E. Gill,et al.  Practical optimization , 1981 .

[17]  George W. Furnas,et al.  The estimation of ultrametric and path length trees from rectangular proximity data , 1984 .

[18]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[19]  P. Buneman.  A Note on the Metric Properties of Trees , 1974 .

[20]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[21]  Roger N. Shepard,et al.  Additive clustering: Representation of similarities as combinations of discrete overlapping properties. , 1979 .

[22]  C. M. Reeves,et al.  Function minimization by conjugate gradients , 1964, Comput. J..

[23]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .