Analysis of the differential treatment effects across targeted subgroups and contexts is a critical objective in many evaluations because it delineates for whom and under what conditions particular programs, therapies or treatments are effective. Unfortunately, it is unclear how to plan efficient and effective evaluations that include these…

The teaching and learning of mathematics cannot be understood without considering the resolution of word problems. These kinds of problems not only connect mathematical concepts with language (and therefore with reality) but also promote the learning related to other scientific areas. In primary school, problems are solved by using basic…

This study uses simulation techniques to examine the statistical power of the group- randomized design and the matched-pair (MP) randomized block design under various parameter combinations. Both nearest neighbor matching and random matching are used for the MP design. The power of each design for any parameter combination was calculated from…

A common mistake in analysis of cluster randomized trials is to ignore the effect of clustering and analyze the data as if each treatment group were a simple random sample. This typically leads to an overstatement of the precision of results and anticonservative conclusions about precision and statistical significance of treatment effects. This…

Measuring object similarity using the method of free clustering is gaining in popularity. Instructions are usually simple and since no structure is imposed on the subject's selection, response bias is reduced. More importantly, measures of object similarity derived from the judges' clustering can be adequately analyzed by the methods of…

Discusses models for the distribution of words in text and proposes a new model based on clustering that can be used to estimate the probability that a document contains a particular word as well as the number of distinct words in a document. Zipf's law and the Poisson approximation are also discussed. (18 references) (LRW)

Describes the use of relevance feedback to select additional search terms and discusses the extraction of these terms from a maximum spanning tree connecting all terms in the index term vocabulary; retrieval effectiveness for different spanning trees is shown to be similar. Eight references are included. (Author/BK)

Proposes a means for determining the similarity between search request formulations in online information retrieval systems, and discusses the use of similarity measures for clustering search formulations and document files in such systems. Experimental results using the proposed methods are presented in three tables. A reference list is provided.…

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…

Discusses precision and recall in information science and proposes a new model based on fractal geometry for clusters of relevant documents. Search strategies for retrieving a group of relevant documents are reviewed; fractal sets and chaotic processes are described; and the new model is explained. (Contains 43 references.) (LRW)

This paper focuses on clustering a World Wide Web site (i.e., the 1998 World Cup Soccer site) into groups of documents that are predictive of future user accesses. Two approaches were developed and tested. The first approach uses semantic information inherent in the documents to facilitate the clustering process. User access history is then used…

Discussion of relevancy in information retrieval systems focuses on an analysis of the efficiency of various cluster-based retrieval (CBR) strategies. A method for combining CBR and inverted index search is proposed that is cost effective in terms of time efficiency; and results of experiments are reported. (Contains 32 references.) (LRW)

Reports research results into a methodology for determining similarity between queries characterized by Boolean search request formulations and discusses similarity measures for Boolean combinations of index terms. Rationale behind these measures is outlined, and conditions ensuring their equivalence are identified. Results of an experiment…

Presents the results of research into the automatic selection of Library of Congress Classification numbers based on the titles and subject headings in MARC records from a test database at the University of California at Berkeley Library School library. Classification clustering and matching techniques are described. (44 references) (LRW)