By Topic

Search in linked document space by social topology agents

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Naruse, K. ; Univ. of Aizu, Aizu-Wakamatsu ; Oka, Ryuichi

When we use a search engine in Internet, we often cannot retrieve a document we look for, due to the difficulty of finding adequate keywords. One of the ways to solve the problem is to search adequate keywords interacting with a user: a metasearch engine displays keywords and pages, a user evaluate them. Iterating the process, the metasearch engine narrows the keywords, getting closer to what a user looks for. For realizing it, we construct a graph called a linked document space, in which nodes and links represent the pages and the similarities, respectively. Then, the metasearch engine searches every promising page considering relations between pages, following the evaluation from a user. This paper presents a search method in the linked document space, called the socially topology agents (STA), which are inspired by human social relation and swarm intelligence. STA is applied to a multi-peak large-scale search problem, and it is shown that STA can find most of peaks quickly, as well as the aggregation and distribution of the agents in the space are controlled by a user command. They mean STA is feasible as the metasearch engine

Published in:

Evolutionary Computation, 2005. The 2005 IEEE Congress on  (Volume:1 )

Date of Conference:

5-5 Sept. 2005