This article is concerned with a subset of numerically stable and scalable algorithms useful to support computationally complex psychometric models in the era of machine learning and massive data. The subset selected here is a core set of numerical methods that should be familiar to computational psychometricians and considers whitening transforms…

This paper presents an application of the Kalman filter in signal processing in instrumentation systems when the conditions of the environment generate a large amount of interference for the acquisition of signals from measurement systems. The unwanted interferences make important use of the instrumentation system resources and do not represent…

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)

This description of the technical details required for using the HIER-GRP computer program, which was developed to group or cluster regression equations in an iterative manner so as to minimize the overall loss of predictive efficiency at each iteration, contains a discussion of the basic algorithm, an outline of the essential steps,…

Discusses problems that occur in information retrieval when foreign words appear in Korean texts. Describes an algorithm that identifies a phrase containing a foreign word and then extracts that word based on statistical information, and explains a method for back-transliteration of a foreign word to its English origin. (Author/LRW)

This paper provides a description of an online Rorschach interpretation algorithm for the Exner comprehensive system, as well as a study conducted to evaluate the validity of the online interpretive algorithm. The user, systems, and equipment specifications for the algorithm are explained, and the potential advantages of its use to enhance…

Summarizes a simple design algorithm which identifies nested loops of equations which must be solved by trial-and-error methods. The algorithm is designed to minimize such loops, provides guidance to the selection of variables, and delineates the order in which systems of equations are to be solved. Examples are included. (TW)