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)

Examines the ways in which level-1 outliers can impact the estimation of fixed effects and random effects in hierarchical models (HMs). Also outlines and illustrates the use of Markov Chain Monte Carlo algorithms for conducting sensitivity analyses under "t" level-1 assumptions, including algorithms for settings in which the degrees of…

Two alternating least squares algorithms are presented for the simultaneous components analysis method of R. E. Millsap and W. Meredith (1988). These methods, one for small data sets and one for large data sets, can indicate whether or not a global optimum for the problem has been attained. (SLD)

A class of oblique rotation procedures is proposed to rotate a pattern matrix so that it optimally resembles a matrix that has an exact simple pattern. It is demonstrated that the method can recover relatively complex simple structures where other simple structure rotation techniques fail. (SLD)