Back to Search
Start Over
Locating information with uncertainty in fully interconnected networks with applications to World Wide Web information retrieval
- Source :
- Computer Journal vol. 44 no. 4, pp. 221-229
- Publication Year :
- 2001
-
Abstract
- In this paper we examine the problem of searching for some information item in the nodes of a fully interconnected computer network, where each node contains information relevant to some topic as well as links to other network nodes that also contain information, not necessarily related to locally kept information. These links are used to facilitate the Internet users and mobile software agents that try to locate specific pieces of information. However, the links do not necessarily point to nodes containing information of interest to the user or relevant to the aims of the mobile agent. Thus an element of uncertainty is introduced. For example, when an Internet user or some search agent lands on a particular network node, they see a set of links that point to information that is, supposedly, relevant to the current search. Therefore, we can assume that a link points to relevant information with some unknown probability p that, in general, is related to the number of nodes in the network (intuitively, as the network grows, this probability tends to zero since adding more nodes to the network renders some extant l
Details
- Database :
- OAIster
- Journal :
- Computer Journal vol. 44 no. 4, pp. 221-229
- Notes :
- English
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.on1077781672
- Document Type :
- Electronic Resource
- Full Text :
- https://doi.org/10.1093.comjnl.44.4.221