Presents an inference algorithm that produces a weighted finite automata (WFA), in particular, the grayness functions of graytone images. Image-data compression results based on the new inference algorithm produces a WFA with a relatively small number of edges. Image-data compression results alone and in combination with wavelets are discussed.…

The ability of the NORMIX algorithm to recover overlapping population structures was compared to the OVERCLUS procedure and another clustering procedure in a Monte Carlo study. NORMIX is found to be more accurate than other procedures in recovering overlapping population structure when appropriate implementation options are specified. (SLD)

In information retrieval (IR), the aim of genetic algorithms (GA) is to help a system to find, in a huge documents collection, a good reply to a query expressed by the user. Analysis of phenomena seen during the implementation of a GA for IR has led to a new crossover operation, which is introduced and compared to other learning methods.…

This personal reaction to Cummings'"Comparison of Three Algorithms for Analyzing Questionnaire-Type Needs Assessment Data to Establish Need Priorities" specifically questions Cummings' use of the Mean Difference Analysis for comparison with Weighted Needs Index, and his focus on characteristics of the statistic that are of secondary…

Demonstrates efficiency of preparation of query description using semantic analyser method based on analysis of semantic structure of documents in field of automatic indexing. Results obtained are compared with automatic indexing results performed by traditional methods and results of indexing done by human indexers. Sample terms and codes are…

A method of two-stage clustering of literature based on citation frequency is applied to 5,065 articles from 57 journals in environmental and civil engineering. Results of related methods of citation analysis (hierarchical graph, clustering of journals, multidimensional scaling) applied to same set of articles are compared. Ten references are…

Discussion of hypermedia systems focuses on a comparison of two types of adaptive algorithm (genetic algorithm and neural network) in clustering hypermedia documents. These clusters allow the user to index into the nodes to find needed information more quickly, since clustering is "personalized" based on the user's paths rather than…

Investigates the value of applying principles derived from simulated annealing to clustering tuples in database design, and compares this technique with a graph-collapsing clustering method. It is concluded that, while the new method does give superior results, the expense involved in algorithm run time is prohibitive. (24 references) (CLB)

The algorithm developed by B. A. Schneider (1980) for analysis of paired comparisons of psychological intervals is replaced by one proposed by R. M. Johnson. Monte Carlo simulations of pairwise dissimilarities and pairwise conjoint effects show that Johnson's algorithm can provide good metric recovery. (SLD)

Two algorithms that automatically select subsets of variables (PACE algorithm) and reference variables (Fabin estimators), respectively, used for the noniterative estimators are presented. The PACE algorithm is based on a nonsymmetric matrix sweep operator. A Monte Carlo experiment compares the relative performance of these estimators and others.…

Seven data sets (namely, clinical data on children) were subjected to clustering by seven algorithms--the B-coefficient, Linear Typal Analysis; elementary linkage analysis, Numerical Taxonomy System, Statistical Analysis System hierarchical clustering method, Taxonomy, and Bolz's Type Analysis. The little-known B-coefficient method compared…

Describes and discusses the findings of an experiment that tested the precision of full-text retrieval enhanced by 29 document term weighting algorithms at the lowest, middle, and highest levels of recall, and compared with the precision of full-text retrieval without algorithms and with paragraph retrieval. (29 references) (Author/CLB)

Presented three algorithms to university students in an introductory laboratory chemistry course and found that differences in the effects of representation modes--flow charts, lists, and standard prose--were complex and changed over 10 lab sessions. There was no evidence that representation mode affected critical thinking ability or final grade.…

Describes a project at the University of Sheffield that is investigating the use of nearest-neighbor retrieval algorithms for full-text searching. Nearest-neighbor searching is compared with Boolean retrieval and hypertext, and an experimental text retrieval system called INSTRUCT (Interactive System for Teaching Retrieval Using Computational…

Discussion of user queries in information retrieval highlights the experimental evaluation of an adaptive linear model that constructs improved query vectors from user preference judgments on a sample set of documents. The performance of this method is compared with that of standard relevance feedback techniques. (28 references) (LRW)