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…

Suggests a new ranking scheme especially adapted for hypertext environments in order to produce more effective retrieval results and still use Boolean search strategies. Topics include Boolean ranking schemes; single-term indexing and term weighting; fuzzy set theory extension; and citation indexing. (64 references) (Author/LRW)

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…