This paper describes the conjunctive counterpart of the hierarchical classes model of P. De Boeck and S. Rosenberg. The new model represents the row-column association as a conjunctive function of a set of hypothetical binary variables. The substantive significance of the conjunctive model is illustrated. (Author/SLD)

Iterative Intercolumnar Correlation Classification (IICC) computes the correlation coefficients for the entries of every column of a matrix with those of every other column of the matrix. Iteration increases the size and validity of the object indices, reduces error in the indices, and increases homogeneity amongst them. (Author/BW)

A strategy for reordering the hierarchical tree structure is presented. While the order of terminal nodes of Johnson's procedure is arbitrary, this procedure will rearrange every triad of nodes under a common least upper node so that the middle node is nonarbitrarily closest to the anchored node. (Author/CTM)

Peay presented a class of grouping methods based on the concept of the r-clique for symmetric data relationships. The concepts of the r-clique can be generalized readily to directed (or asymmetric) relationships, and groupings based on this generalization may be found conveniently using an adoption of Peay's methodology. (Author/BJG)

Three dissimilarity measures for the unconstrained sorting task are investigated. All three are metrics, but differ in the kind of compensation which they make for differences in the sizes of cells within sortings. Empirical tests of the measures are done with sorting data for occupations names and the names of behaviors, using multidimensional…

Discussion of models for information retrieval focuses on an application of linear algebra to text clustering, namely, a metric for measuring cluster quality based on the theory that cluster quality is proportional to the number of terms that are disjoint across the clusters. Explains term-document matrices and clustering algorithms. (Author/LRW)

A rapid method for hierarchically clustering the n objects of a matrix which portrays the interrelation of every object to every other object, where n equals any number up to 1,000 and even larger, is developed and discussed. Results compare favorably with those from other excellent methods. (Author/BJG)

Presents system for automatic handling of ordered sets, states based on these sets, and differing points of view regarding Universe of Discourse. Aspects are represented by new logical "overlap" function with examples taken from Ranganathan's horse and carriage parable and several books involving four main concepts (history, geography,…

The common marketing research practice of standardizing the columns of a persons-by-variables data matrix prior to clustering the entities corresponding to the rows was evaluated with 10 large-scale data sets. Results indicate that the column standardization practice may be problematic for some kinds of data that marketing researchers used for…

A flexible data analysis approach is proposed that combines the psychometric procedures seriation and multidimensional scaling. The method, which is particularly appropriate for analysis of proximities containing temporal information, is illustrated using a matrix of cocitations in publications by 18 presidents of the Psychometric Society.…

An empirical assesssment of the space distortion properties of two prototypic hierarchical clustering procedures is given in terms of an occupancy model developed from combinatorics. Using one simple example, the single-link and complete-link clustering strategies now in common use in the behavioral sciences are empirically shown to be space…

A relatively reliable and valid hierarchy of clusters of objects is plotted from the highest column entries, exclusively, of a matrix of interassociations between the objects. Having developed out of a loose definition of types, the method isolates both loose and highly definitive types, and all those in between. (Author/RC)