Presents a technique for developing a knowledge-base of information to use in an expert system. Proposed approach employs a popular machine-learning algorithm along with a method for forming a finite number of features or conjuncts of at most n primitive attributes. Illustrates this procedure by examining qualitative information represented in a…

Discusses the development of an algorithm for an equitable distribution of state prevention funds to its substate jurisdiction based on the need for prevention services. Suggests that the final decision on the level of funding must be based on the selection of the schedule for resource allocation rather than the suggested amount or level of…

Presents a relevance-feedback strategy that improves the effectiveness of information-retrieval systems based on back-propagation of the relevance of retrieved documents using an algorithm developed in a neural approach. Describes a neural information-retrieval model and reports results obtained with the algorithm in three different environments.…

Investigates methods for the correct and efficient handling of annotations in a full-text information-retrieval system in a hypertext environment. Goals were to increase relevant items retrieved, reduce non-relevant items, permit selective retrieval, and to explore the notion of distance between words as given in the distance-evaluation algorithm.…

Discussion of electronic news available on the World Wide Web focuses on a methodology of associating news documents using similarity measures and a name-phrase algorithm to create news representations that can be compared and ranked to find related news items. Considers precision over recall and interactivity with the users. (Author/LRW)

Many important human activities involve accomplishing goals without a script. There is no formula for true problem-solving. Heuristic, cognitive "rules of thumb" are the problem-solver's best guide. Learners should understand heuristic tools such as means-end analysis, working backwards, successive approximation, and external representation. Since…

Describes a bottom-up procedure for discovering multivalued dependencies in observed data without knowing a priori the relationships among the attributes. The proposed algorithm is an application of technique designed for learning conditional independencies in probabilistic reasoning; a prototype system for automated database schema design has…

Suggests that issues surrounding the teaching of algorithms focus not on whether to teach them but rather on balancing and connecting the development of algorithmic thinking. Presents an approach to help students develop their algorithmic thinking. Contains 18 references. (ASK)

Presents research on students' use and understanding of algorithms in Poland. Concludes that there are detrimental side effects that stem from the teaching and learning of standard written algorithms. (ASK)

Describes the design of a stemming algorithm for searching Latin text databases. The algorithm uses a longest-match approach with some recoding but differs from most stemmers in its use of two separate suffix dictionaries for processing query and database words that enables users to pursue specific searches for single grammatical forms of words.…

Reviews the historical development of subtraction algorithms used in the United States. Discusses different algorithms used and developed throughout history that had a major impact on the way subtraction is taught today. (Contains 22 references.) (ASK)

Debates the place of standard methods, the calculator, and mental mathematics in elementary education. Proposes a framework for computation that emphasizes a sequence for introducing computational procedures. (ASK)

Presents a new stemming algorithm based on tree structures that improves relevance in information retrieval by conflation, grouping similar words into a single term. Highlights include the normalization process used in automatic thesaurus construction; theoretical aspects; the normalization algorithm; and experiments with English and Spanish. (LRW)

Describes a Rasch rating scale analysis of a multi-occasion evaluation that produces confusing results when subjected to separate calibrations. Applies a correction algorithm developed by B. Wright (1996) to show how the Wright algorithm can reduce misfit to the Rasch rating scale model as well as changing the interpretation of change. (SLD)

Presents an approach for illustrating, on an intuitive level, the significance of loop invariants for algorithm design and analysis. The illustration is based on mathematical games that require the exploration of regularities via problem-solving heuristics. (Author/MM)