A comprehensive account of a probabilistic model of retrieval with new systematic experiments on TREC (Text Retrieval Conferences) Program material. Part 2 covers the further development of the model, with testing, and briefly considers other environment conditions and tasks, model training, concluding with comparisons with other approaches and an…

Discusses hierarchic document clustering in information retrieval and its potential improved effectiveness over inverted file search (IFS). Describes experiments conducted to determine whether hierarchic clustering can increase the retrieval effectiveness compared to both static clustering and of conventional IFS when it is applied to search…

Proposes a new method of text classification using stochastic decision lists, ordered sequences of IF-THEN-ELSE rules. The method can be viewed as a rule-based method for text classification having advantages of readability and refinability of acquired knowledge. Advantages of rule-based methods over non-rule-based ones are empirically verified.…

Discussion of image database systems focuses on semantic queries and shows how an image is abstracted into a hierarchy of entity names and features; how relations are established between entities visible in the image; and how a "fuzzy" matching technique is used to compare semantic queries to image abstractions. (Author/LRW)

Describes a study that examined the effectiveness of eight search engines for the World Wide Web. Calculated traditional information-retrieval measures of recall and precision at varying numbers of retrieved documents to use as the bases for statistical comparisons of retrieval effectiveness. Also examined the overlap between search engines.…

Describes a study that computed the low performance standards for queries in 17 test collections. Predicted by the hypergeometric distribution, the standards represent the highest level of retrieval effectiveness attributable to chance. Operational levels of performance for vector-space and other retrieval models were compared to the standards.…

Presents two new algorithms for performing arithmetic coding without employing multiplication and discusses their implementation requirements. The first algorithm, suitable for an alphabet of arbitrary size, reduces the worst case excess length to under 0.8%. The second algorithm, suitable only for alphabets of less than 12 symbols, allows even…

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.…

Discussion of disparities between developed and developing nations and the influence of information technology focuses on the newly industrializing countries of South Korea, Singapore, and Taiwan and their development of the information sectors as strategic industries to gain international competitiveness. Topics include information activities,…

Analyzes the properties of genetic sequences that cause the failure of classical algorithms used for data compression. A lossless algorithm, which compresses the information contained in DNA and RNA sequences by detecting regularities such as palindromes, is presented. This algorithm combines substitutional and statistical methods and appears to…

Discusses similarities and differences between knowledge acquisition in expert systems and requirement acquisition in others kinds of information systems (particularly decision support systems). Examines role-limiting methods for automated knowledge acquisition and their integration from the problem-solving perspective. Suggests a feasibility…