This Article 
 Bibliographic References 
 Add to: 
Comparison of Three Vertical Search Spiders
May 2003 (vol. 36 no. 5)
pp. 56-62
Michael Chau, University of Arizona
Hsinchun Chen, University of Arizona

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.

Michael Chau, Hsinchun Chen, "Comparison of Three Vertical Search Spiders," Computer, vol. 36, no. 5, pp. 56-62, May 2003, doi:10.1109/MC.2003.1198237
Usage of this product signifies your acceptance of the Terms of Use.