Comparison of three vertical search spiders

Michael Chau, Hsinchun Chen

Research output: Contribution to journalArticle

72 Citations (Scopus)

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)
Pages (from-to)56-62+4
JournalComputer
Volume36
Issue number5
DOIs
StatePublished - May 2003

Fingerprint

Search engines
Chemical activation
Neural networks

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Software

Cite this

Comparison of three vertical search spiders. / Chau, Michael; Chen, Hsinchun.

In: Computer, Vol. 36, No. 5, 05.2003, p. 56-62+4.

Research output: Contribution to journalArticle

Chau, Michael ; Chen, Hsinchun. / Comparison of three vertical search spiders. In: Computer. 2003 ; Vol. 36, No. 5. pp. 56-62+4.
@article{a03818beb4614d5ca021be95b8ca65da,
title = "Comparison of three vertical search spiders",
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.",
author = "Michael Chau and Hsinchun Chen",
year = "2003",
month = "5",
doi = "10.1109/MC.2003.1198237",
language = "English (US)",
volume = "36",
pages = "56--62+4",
journal = "ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering",
issn = "0018-9162",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - Comparison of three vertical search spiders

AU - Chau, Michael

AU - Chen, Hsinchun

PY - 2003/5

Y1 - 2003/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0038738052&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038738052&partnerID=8YFLogxK

U2 - 10.1109/MC.2003.1198237

DO - 10.1109/MC.2003.1198237

M3 - Article

VL - 36

SP - 56-62+4

JO - ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

JF - ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

SN - 0018-9162

IS - 5

ER -