Comparison of three vertical search spiders

Michael Chau, Hsinchun Chen

Research output: Contribution to specialist publicationArticle

81 Scopus citations

Abstract

The Web's dynamic,.unstructured nature makes locating resources difficult. Vertical search engines solve part of the problem by keeping indexes only in specific domains. They also offer more opportunity to apply domain knowledge in the spider applications that collect content for their databases. The authors used three approaches to investigate algorithms for improving the performance of vertical search engine spiders: a breadth-first graph-traversal algorithm with no heuristics to refine the search process, a best-first traversal algorithm that uses a hyperlink-analysis heuristic, and a spreading-activation algorithm based on modeling the Web as a neural network.

Original languageEnglish (US)
Pages56-62+4
Volume36
No5
Specialist publicationComputer
DOIs
StatePublished - May 2003

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Comparison of three vertical search spiders'. Together they form a unique fingerprint.

Cite this