The polyserial and point polyserial correlations are discussed as generalizations of the biserial and point biserial correlations. The relationship between the polyserial and point polyserial correlation is derived. Some practical applications of the polyserial correlation are described. (Author/JKS)

Miller and Farr's algorithm for the index of redundancy is shown to be incorrect by means of a counterexample. The consequences of this error for other conclusions drawn by the authors are discussed. (Author/JKS)

Johnson has shown that the single linkage and complete linkage hierarchical clustering algorithms induce a metric on the data known as the ultrametric. Johnson's proof is extended to four other common clustering algorithms. Two additional methods also produce hierarchical structures which can violate the ultrametric inequality. (Author/CTM)

Six different algorithms to generate widely different non-normal distributions are reviewed. These algorithms are compared in terms of speed, simplicity, and generality of the technique. The advantages and disadvantages of using these algorithms are briefly discussed. (Author)

Discusses the use of inverted files in information retrieval systems and proposes a document identifier reassignment method to reduce the average gap values in an inverted file. Highlights include the d-gap technique; document similarity; heuristic algorithms; file compression; and performance evaluation from a simulation environment. (LRW)

Discusses sequential patterns, data mining, knowledge acquisition, and fuzzy sequential patterns described by natural language. Proposes a fuzzy data mining technique to discover fuzzy sequential patterns by using the simple partition method which allows the linguistic interpretation of each fuzzy set to be easily obtained. (Author/LRW)

Concepts of ordinal network representation are discussed. Notation (the type of data that can be represented) and the type of representation given are reviewed. The idea of reduced ordinal networks is explored; and the algorithm, uniqueness results, and error handling problems are presented. Examples of data analysis are included. (SLD)

An algorithm is described for fitting the DEDICOM model (proposed by R. A. Harshman in 1978) for the analysis of asymmetric data matrices. The method modifies a procedure proposed by Y. Takane (1985) to provide guaranteed monotonic convergence. The algorithm is based on a technique known as majorization. (SLD)

Gulliksen's matched random subtests method is a graphical method to split a test into parallel test halves, allowing maximization of coefficient alpha as a lower bound to the classical test reliability coefficient. This problem is formulated as a zero-one programing problem solvable by algorithms that already exist. (TJH)

This study develops an integrated conceptual representation scheme for multimedia documents that are viewed to comprise an object-oriented database; the necessary abstractions for the conceptual model and extensions to the relational model used as the search structure; a retrieval model that includes associative, semantic and media-specific…

Monotonically convergent algorithms are described for maximizing sums of quotients of quadratic forms. Six (constrained) functions are investigated. The general formulation of the functions and the algorithms allow for application of the algorithms in various situations in multivariate analysis. (SLD)

Presents a class of distortion controlled vector quantizers that are capable of compressing images so they comply with certain distortion requirements. Highlights include tree-structured vector quantizers; multiresolution vector quantization; error coding vector quantizer; error coding multiresolution algorithm; and Huffman coding of the quad-tree…

The TETRAD for constraint-based aids to causal model specification project and related work in computer science aims to apply standards of rigor and precision to the problem of using data and background knowledge to make inferences about a model's specifications. Several algorithms that are implemented in the TETRAD II program are presented. (SLD)

An iterative majorization algorithm is proposed for orthogonal congruence rotation that is guaranteed to converge from every starting point. In addition, the algorithm is easier to program than the algorithm proposed by F. B. Brokken, which is not guaranteed to converge. The derivation of the algorithm is traced in detail. (SLD)