This paper discusses optimal test construction, which deals with the selection of items from a pool to construct a test that performs optimally with respect to the objective of the test and simultaneously meets all test specifications. Optimal test construction problems can be formulated as mathematical decision models. Algorithms and heuristics…

Scores on different items of a test are often combined linearly (sometimes with equal weights) to form the test score, mainly for the sake of computational convenience. In this paper, the author studies the consequences of doing this, and also studies the problems involved in finding a suitable linear combination. (Author/RK)

Different methods of subtracting are described; the equal additions and the decomposition methods are discussed in detail. (DT)

A system of automatic indexing based on Baye's theorem is described briefly. (18 references) (Author)

The index entries generated by the Selective Listing in Combinations (SLIC) technique constitute a lattice which is a subset of the power set of the set of descriptors assigned to a document and this fact leads to an improved algorithm for generating SLIC entries. (Author/MF)

Tested an algorithm for directing novice counselors in making empathic responses. The independent variable was assessed using a computer simulation program. The second experiment employed a completely randomized design. In another, the algorithm was modified and a randomized block design employed. Experimental groups performed significantly…

Confirmatory factor analysis is considered from a Bayesian viewpoint, in which prior information concerning parameters is incorporated in the analysis. An interactive algorithm is developed to obtain the Bayesian estimates. A numerical example is presented. (Author/JKS)

Genetic algorithms, a class of nondeterministic algorithms in which the role of chance makes the precise nature of a solution impossible to guarantee, seem to be well suited to combinatorial-optimization problems in information retrieval. Provides an introduction to techniques and characteristics of genetic algorithms and illustrates their…

An iterative process is proposed for obtaining an orthogonal simple structure solution. At each iteration, a target matrix is constructed such that the relative contributions of the target majorize the original ones, factor by factor. The convergence of the procedure is proven, and the algorithm is illustrated. (SLD)

Discusses the inclusion of contextual information in indexing and retrieval systems to improve results and the ability to carry out text analysis by means of linguistic knowledge. Presents research that investigated whether discourse variables have an impact on information and retrieval and classification algorithms. (Author/LRW)

Discusses latent semantic indexing (LSI) that would allow search engines to reduce the dimension of the document space by mapping it into a space spanned by conceptual indices. Topics include vector space models; singular value decomposition (SVD); unitary operators; the Haar transform; and new algorithms. (Author/LRW)