We report on the design of a system that enables the user to perform retrieval of items of interest both by browsing an automatically constructed very large hypertext and by spreading activation on the hypertext network itself. It is this second option that is particularly interesting since it enables the user to retrieve items that have not been visited, but that are similar to items flagged as relevant during the browsing. The spreading of activation from relevant items to similar items is achieved using a form of “constrained spreading activation”. This is a kind of spreading activation controlled by heuristic rules that limit and direct the activation towards the most promising links and node of the hypertext.
Abstract.Spreading activation search is an approach to determine sim-ilarity of graph vertices based...
We address the problem of improving, automatically, the usability of a large online document. We pro...
To facilitate users' ability to make sense of large collections of hypertext we present two new tech...
Syntactic search relies on keywords contained in a query to find suitable documents. So, documents t...
Intelligent information retrieval is concerned with the application of intelligent techniques, like ...
Abstract. In this paper, we propose a mining algorithm to utilize the user clickthrough data to impr...
The emerging Web of Data as part of the Semantic Web initiative and the sheer mass of information no...
The unprecedented growth of the World Wide Web illustrates the importance of hypertext as a method f...
In this paper we apply a spreading activation algorithm to the problem of mapping senses between ma...
The paper discusses the approach to dynamic hypertext technology used for query expansion and develo...
667-679Searching the World Wide Web is an activity whose importance cannot be emphasized any furthe...
that is, the automated retrieval of information relevant to users ’ needs. In particular, he is inte...
Information browsing in hypertext systems is provided by links with source and destination anchors w...
The paper describes the design and implementation of TACHIR, a tool for the automatic construction o...
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong ty...
Abstract.Spreading activation search is an approach to determine sim-ilarity of graph vertices based...
We address the problem of improving, automatically, the usability of a large online document. We pro...
To facilitate users' ability to make sense of large collections of hypertext we present two new tech...
Syntactic search relies on keywords contained in a query to find suitable documents. So, documents t...
Intelligent information retrieval is concerned with the application of intelligent techniques, like ...
Abstract. In this paper, we propose a mining algorithm to utilize the user clickthrough data to impr...
The emerging Web of Data as part of the Semantic Web initiative and the sheer mass of information no...
The unprecedented growth of the World Wide Web illustrates the importance of hypertext as a method f...
In this paper we apply a spreading activation algorithm to the problem of mapping senses between ma...
The paper discusses the approach to dynamic hypertext technology used for query expansion and develo...
667-679Searching the World Wide Web is an activity whose importance cannot be emphasized any furthe...
that is, the automated retrieval of information relevant to users ’ needs. In particular, he is inte...
Information browsing in hypertext systems is provided by links with source and destination anchors w...
The paper describes the design and implementation of TACHIR, a tool for the automatic construction o...
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong ty...
Abstract.Spreading activation search is an approach to determine sim-ilarity of graph vertices based...
We address the problem of improving, automatically, the usability of a large online document. We pro...
To facilitate users' ability to make sense of large collections of hypertext we present two new tech...