File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Comparison of three vertical search spiders

TitleComparison of three vertical search spiders
Authors
Issue Date2003
PublisherIEEE, Computer Society. The Journal's web site is located at http://www.computer.org/computer
Citation
Computer, 2003, v. 36 n. 5, p. 56-62+4 How to Cite?
AbstractThe 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.
Persistent Identifierhttp://hdl.handle.net/10722/177916
ISSN
2015 Impact Factor: 1.115
2015 SCImago Journal Rankings: 0.599
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChau, Men_US
dc.contributor.authorChen, Hen_US
dc.date.accessioned2012-12-19T09:40:49Z-
dc.date.available2012-12-19T09:40:49Z-
dc.date.issued2003en_US
dc.identifier.citationComputer, 2003, v. 36 n. 5, p. 56-62+4en_US
dc.identifier.issn0018-9162en_US
dc.identifier.urihttp://hdl.handle.net/10722/177916-
dc.description.abstractThe 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.en_US
dc.languageengen_US
dc.publisherIEEE, Computer Society. The Journal's web site is located at http://www.computer.org/computeren_US
dc.relation.ispartofComputeren_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.titleComparison of three vertical search spidersen_US
dc.typeArticleen_US
dc.identifier.emailChau, M: mchau@hkucc.hku.hken_US
dc.identifier.authorityChau, M=rp01051en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/MC.2003.1198237en_US
dc.identifier.scopuseid_2-s2.0-0038738052en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0038738052&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume36en_US
dc.identifier.issue5en_US
dc.identifier.spage56en_US
dc.identifier.epage62+4en_US
dc.identifier.isiWOS:000182518300020-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChau, M=7006073763en_US
dc.identifier.scopusauthoridChen, H=8871373800en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats