Discusses problems of matching personal names in information systems and factors influencing design of personal name matching algorithms. Several examples of name matching systems in the fields of art history, bibliography, commerce, genealogy, and law enforcement used for the purposes of authority control, information retrieval, and duplicate…

A general approach is described for the analysis of categorical data when there are missing values on one or more observed variables. The method is based on generalized linear models with composite links. Situations in which the model can be used are described. (SLD)

Enriching factor rotation algorithms with the capacity to conduct repeated searches from random starting points can make the tendency to converge to optima that are merely local a way to catch rotations of the input factors that might otherwise elude discovery. Use of the HYBALL computer program is discussed. (SLD)

A method for hierarchical agglomerative polythetic (multivariate) clustering, based on unweighted pair group using arithmetic averages (UPGMA) is compared with the original beta-flexible technique, a weighted average method. Reasons the flexible UPGMA strategy is recommended are discussed, focusing on the ability to recover cluster structure over…

Presents two methods for including weights in distance-based nonlinear multivariate data analysis. One method assigns weights to the objects, while the other is concerned with differential weighing of groups of variables. Discusses applications of these weighting schemes and proposed an algorithm to minimize the corresponding loss function. (SLD)

Presents minimization and maximization models for parallel test construction under constraints. The minimization model constructs weakly and strongly parallel tests of minimum length, while the maximization model constructs weakly and strongly parallel tests with maximum test reliability. (Author/SLD)

Proposes an algorithm for the assembly of multiple test forms in which the multiple-form problem is reduced to a series of computationally less intensive two-form problems. Illustrates how the method can be implemented using 0-1 linear programming and gives two examples. (SLD)

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)

Presents a multilevel model of the information filtering process that permits document classification. Evaluates a document classification approach based on a supervised learning algorithm, measures the accuracy of the algorithm in a neural network that was trained to classify medical documents on cell biology, and discusses filtering…

Discusses the role of search engines in Web usability and analyzes and evaluates the retrieval effectiveness of various indexing and searching strategies on a new Web text collection. Highlights include preprocessing techniques that might improve retrieval effectiveness; and hyperlinks as useful sources of evidence in improving retrieval…

Discusses information retrieval systems and extracting appropriate keywords from documents and proposes an effective substring search method by extending a pattern matching machine for multi-keywords called delayed keyword extraction (DKE). Also proposes a construction algorithm of the retrieval structure for speeding up the substring search.…

Discusses natural language processing and proposes a novel approach to automatic text segmentation using heterogeneous linguistic knowledge and cluster algorithms. Represents the diversity of textual relations in a discourse network in order to analyze the linguistic bonds and determine the degree of coherence that a text may exhibit. (Author/LRW)

Describes a lesson on long division using chip trading which follows that algorithm for long division. (MKR)

Examines the relation between the sequence of approximations to the square root of a number and the harmonic, geometric, and arithmetic means using the TI-85 graphing calculator. (MKR)

Reviewed methods of estimating theta suitable for computerized adaptive testing (CAT) and discussed the differences between Fisher and Kullback-Leibler information criteria for selecting items. Examined the accuracy of different CAT algorithms using samples from the National Assessment of Educational Progress. Results show when correcting for…