Presents an improved inverted region quadtree variation called Dynamic Inverted Quadtree that is able to support and index a pictorial database. Pattern-searching algorithms are described, and the space needs of Fully Inverted and Dynamic Inverted Quadtrees are analytically compared based on a model of image randomness expressed as a branching…

Describes an investigation of the use of document components, such as terms, sentences, and whole documents, for indexing and retrieval. A number of probabilistic similarity measures based on document components are studied, as well as a new method of handling probability estimations involving small sample sizes. (24 references) (Author/CLB)

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…

Describes three models for probabilistic indexing, all based on the Darmstadt automatic indexing approach, and presents experimental evaluation results for each. The discussion covers the improved retrieval effectiveness of probabilistic indexing over binary indexing, and suggestions for using this automatic indexing method with free text terms.…

Describes the Belief Function Model for automatic indexing and ranking of documents which is based on a controlled vocabulary and on term frequencies in each document. Belief Function Theory is explained, and the Belief Function Model is compared to the Standard Vector Space Model. (17 references) (LRW)