Show simple item record

dc.contributor.authorChau, Michael
dc.contributor.authorChen, Hsinchun
dc.date.accessioned2004-08-16T00:00:01Z
dc.date.available2010-06-18T23:36:04Z
dc.date.issued2003-05en_US
dc.date.submitted2004-08-16en_US
dc.identifier.citationComparison of Three Vertical Search Spiders 2003-05, 36(5):56-62 Computeren_US
dc.identifier.urihttp://hdl.handle.net/10150/105876
dc.descriptionArtificial Intelligence Lab, Department of MIS, University of Arizonaen_US
dc.description.abstractSpiders are the software agents that search engines use to collect content for their databases. We investigated algorithms to improve the performance of vertical search engine spiders. The investigation addressed three approaches: a breadth-first graph-traversal algorithm with no heuristics to refine the search process, a best-first traversal algorithm that used a hyperlink-analysis heuristic, and a spreading-activation algorithm based on modeling the Web as a neural network.
dc.format.mimetypeapplication/pdfen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectWeb Miningen_US
dc.subjectInterneten_US
dc.subjectData Miningen_US
dc.subject.otherNational Science Digital Libraryen_US
dc.subject.otherNSDLen_US
dc.subject.otherArtificial Intelligence laben_US
dc.subject.otherAI laben_US
dc.subject.otherWeb spideren_US
dc.titleComparison of Three Vertical Search Spidersen_US
dc.typeJournal Article (Paginated)en_US
dc.identifier.journalComputeren_US
refterms.dateFOA2018-06-18T13:02:01Z
html.description.abstractSpiders are the software agents that search engines use to collect content for their databases. We investigated algorithms to improve the performance of vertical search engine spiders. The investigation addressed three approaches: a breadth-first graph-traversal algorithm with no heuristics to refine the search process, a best-first traversal algorithm that used a hyperlink-analysis heuristic, and a spreading-activation algorithm based on modeling the Web as a neural network.


Files in this item

Thumbnail
Name:
chau.pdf
Size:
120.5Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record