Discussion of information retrieval focuses on an Interaction Information Retrieval model in which documents are interconnected; queries and documents are treated in the same way; and retrieval is the result of the interconnection between query and documents. A theoretical mathematical formulation of this type of retrieval is given. (Contains 31…

Extends Iachan's congruence index (1984) to cover situations when ties occur in three-letter codes (as used in Holland's vocational theory) and when only two top letters are recorded and/or used. Suggests methodologies for breaking ties and for measuring agreement between two-letter codes and includes computer algorithm for computing the index.…

Presents a faster method for determining hierarchical relationships in information retrieval by using trie structures instead of a linear storage of a concept code. Highlights include case structures, a knowledge representation for natural-language understanding with semantic constraints; a compression algorithm of tries; and evaluation.…

Presents a variation of a "greedy" algorithm that can be used in test-assembly problems. The algorithm, the normalized weighted absolute-deviation heuristic, selects items to have a locally optimal fit to a moving set of average criterion values. Demonstrates application of the model. (SLD)

Presents an approach to a Genetic Information Retrieval Agent Filter (GIRAF) that filters and ranks documents retrieved from the Internet according to users' preferences by using a Genetic Algorithm and fuzzy set theory to handle the imprecision of users' preferences and users' evaluation of the retrieved documents. (Author/LRW)

Introduces a conceptual integration approach to heterogeneous databases or information systems that exploits the similarity in metalevel information and performs metadata mining on database objects to discover a set of concepts that serve as a domain abstraction and provide a conceptual layer above existing legacy systems. Presents results of…

Nonlinear latent variable models are specified that include quadratic forms and interactions of latent regressor variable as special cases. To estimate the parameters, the models are put in a Bayesian framework with conjugate priors for the parameters. The proposed estimation methods are illustrated by two simulation studies. (SLD)

Describes an interactive procedure for multiobjective asymmetric unidimensional seriation problems that uses a dynamic-programming algorithm to generate partially the efficient set of sequences for small to medium-sized problems and a multioperational heuristic to estimate the efficient set for larger problems. Applies the procedure to an…

Joint correspondence analysis is a technique for constructing reduced-dimensional representations of pairwise relationships among categorical variables. An alternating least-squares algorithm for conducting joint correspondence analysis is presented that requires fewer iterations than the algorithm previously proposed by M. J. Greenacre. (SLD)

Discussion of automatic recognition of hand and machine-written cursive text using the Arabic alphabet focuses on an algorithm for word recognition. Describes results of testing words for recognition without segmentation and considers the algorithms' use for words of different fonts and for processing whole sentences. (Author/LRW)

Proposes a new approach for classifying text documents into two disjoint classes. Highlights include a brief overview of document clustering; a data mining approach called the One Clause at a Time (OCAT) algorithm which is based on mathematical logic; vector space model (VSM); and comparing the OCAT to the VSM. (Author/LRW)

Offers a simple classification of problems and seeks to explore the many factors that may be important in the successful solving of problems. Considers the place of procedures and algorithms. Solving open-ended problems is extremely important in education and offering learners experience with this in a group work context is a helpful way forward.…

Some of the test questions for the National Council of Architectural Registration Boards deal with the site, including drainage, regrading, and the like. Some questions are most easily scored by examining contours, but others, such as water flow questions, are best scored from a grid in which each element is assigned its average elevation. This…

P. Rousseeuw and A. Leroy (1987) proposed a very robust alternative to classical estimates of mean vectors and covariance matrices, the Minimum Volume Ellipsoid (MVE). This paper describes the MVE technique and presents a BASIC program to implement it. The MVE is a "high breakdown" estimator, one that can cope with samples in which as…

This discussion of new methods for calibrating item response theory (IRT) models looks into new optimization procedures, such as the Genetic Algorithm (GA) to improve on the use of the Newton-Raphson procedure. The advantages of using a global optimization procedure like GA is that this kind of procedure is not easily affected by local optima and…