File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/MC.2003.1198237
- Scopus: eid_2-s2.0-0038738052
- WOS: WOS:000182518300020
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Comparison of three vertical search spiders
Title | Comparison of three vertical search spiders |
---|---|
Authors | |
Issue Date | 2003 |
Publisher | IEEE, 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? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/177916 |
ISSN | 2023 Impact Factor: 2.0 2023 SCImago Journal Rankings: 0.803 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chau, M | en_US |
dc.contributor.author | Chen, H | en_US |
dc.date.accessioned | 2012-12-19T09:40:49Z | - |
dc.date.available | 2012-12-19T09:40:49Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.citation | Computer, 2003, v. 36 n. 5, p. 56-62+4 | en_US |
dc.identifier.issn | 0018-9162 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/177916 | - |
dc.description.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. | en_US |
dc.language | eng | en_US |
dc.publisher | IEEE, Computer Society. The Journal's web site is located at http://www.computer.org/computer | en_US |
dc.relation.ispartof | Computer | en_US |
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.title | Comparison of three vertical search spiders | en_US |
dc.type | Article | en_US |
dc.identifier.email | Chau, M: mchau@hkucc.hku.hk | en_US |
dc.identifier.authority | Chau, M=rp01051 | en_US |
dc.description.nature | published_or_final_version | en_US |
dc.identifier.doi | 10.1109/MC.2003.1198237 | en_US |
dc.identifier.scopus | eid_2-s2.0-0038738052 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0038738052&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 36 | en_US |
dc.identifier.issue | 5 | en_US |
dc.identifier.spage | 56 | en_US |
dc.identifier.epage | 62+4 | en_US |
dc.identifier.isi | WOS:000182518300020 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Chau, M=7006073763 | en_US |
dc.identifier.scopusauthorid | Chen, H=8871373800 | en_US |
dc.identifier.issnl | 0018-9162 | - |