Discussion of hypertext browsing proposes a filtering algorithm which restricts the amount of information made available to the user by calculating the set of most relevant hypertext nodes for the user, utilizing the user profile and data clustering technique. An example is provided of an optimal cluster of relevant data items. (Author/LRW)

Proposes a model for digital library and hypermedia organizations that is adaptive, providing different conceptual orderings to support browsing for different individuals' or groups' needs. Highlights include types of links, document ordering and the Gray code (a binary programming code), adaptive classification, and an economic model for document…

Proposes a new learning algorithm to improve the retrieval effectiveness of the search system used in the hypertext environment using an extended Boolean model with links to improve the ranking of retrieved items. Highlights include the basic retrieval scheme, the learning scheme, and a review of basic probabilistic retrieval models. (Contains 32…

Examines the deductive approach to error diagnosis for intelligent tutoring systems. Topics covered include the principles of the deductive approach to diagnosis; domain-specific heuristics to solve the problem of generalizing error patterns; and deductive diagnosis and the hypertext-based learning environment. (Contains 26 references.) (JLB)

Describes research that was conducted to determine the search state patterns through which users retrieve information in hypertext systems. Use of the Markov model to describe users' search behavior is discussed, and search patterns of different user groups were studied by comparing transition probability matrices. (Contains 25 references.) (LRW)