It is known that the Maxbet algorithm, which is an alternative to the method of generalized canonical correlation analysis and Procrustes analysis, may converge to local maxima. Discusses an eigenvalue criterion that is sufficient, but not necessary, for global optimality of the successive Maxbet algorithm. (SLD)

Developed a branch-and-bound algorithm that can be used to seriate a symmetric dissimilarity matrix by identifying a reordering of rows and columns of the matrix optimizing an anti-Robinson criterion. Computational results suggest that with respect to computational efficiency, the approach is generally competitive with dynamic programming. (SLD)

This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…

Presents an algorithm for the production of a graphical diagram from a matrix formula in such a way that its components are logically and hierarchically arranged. The algorithm, which relies on the matrix equations of J. McArdle and R. McDonald (1984), calculates the individual path components of expected covariance between variables and…

Discussion of access methods and information retrieval algorithms focuses on the vertical counting approach. Determines the speedup gained from using the Hamming Distance Bit Vertical counter, evaluates the parameters that influence the speedup, and discusses the point that makes the vertical approach faster than the horizontal approach.…

Discusses XML and information retrieval and describes a query language, ELIXIR (expressive and efficient language for XML information retrieval), with a textual similarity operator that can be used for similarity joins. Explains the algorithm for answering ELIXIR queries to generate intermediate relational data. (Author/LRW)

Discussion of information retrieval focuses on the use of binary trees and how to compact it to use less memory and take less time. Explains retrieval algorithms and describes data structure and hierarchical structure. (LRW)

Presents an algorithm for computation of discrimination values in automatic construction of dictionaries for information retrieval. (Author/PF)

Comments on P. Arabie's article, "Concerning Monte Carlo Evaluations of Nonmetric Multidimensional Scaling Algorithms.", Psychometrika, 1973, 38, 607-8. (RC)

The indirect retrieval method proposed by Goffman is outlined and some similarities to other retrieval methods are indicated. The method is then evaluated and the results are compared with those obtained on the same document collection with cluster-based retrieval using single-link clustering. (Author)

Presented is an empirical confirmation of clustering behavior that has been proposed as a conjecture in the literature; namely, that document ordering is more significant in an algorithm using a full document space search, rather than a search of just unclustered documents, each time a density test is performed. (4 references) (Author)

A formula for the determinant of a partitioned matrix, possibly with singular submatrices, is derived and applied to some psychometric and numerical problems. (Author)

Discusses the problem of enhancing the speed of Huffman decoding of compressed data. Topics addressed include the Huffman decoding tree; multibit decoding; binary string mapping problems; and algorithms for solving mapping problems. (22 references) (LRW)

Describes a new combinatorial algorithm for fitting additive trees to proximity data. This generalized triples method examines all triples of objects of interest in relation to the remaining set of objects to be clustered. The procedure is illustrated, and a simulation study shows its advantages. (SLD)

Provides a comprehensive, nontechnical overview of the three maximum likelihood algorithms available for use with missing data and discusses multiple imputation, frequently used in conjunction with the EM algorithm. (SLD)