Linked space search by arranging to Euclid space

Abstract

The objective of this paper is to investigate a search method in a linked space such as Web pages. Most of search methods in a linked space are a brute force one essentially, because we cannot apply an effective heuristic search method in the reason that most of heuristic algorithms are designed to works in Euclid space (or a metric space). For applying effective algorithms, in this paper, the following method is investigated: a linked space is arranged into Euclid space by multi-dimensional scaling (MDS), and a heuristic algorithm such as particle swarm optimization (PSO) is applied to in the Euclid space.