Focused crawling using context graphs

Proceedings of the 26th International Conference on Very Large Data Bases, VLDB'00

Volumn , Issue , 2000, Pages 527-534

  Diligentit, M ^a   Coetzee, F M ^b   Lawrence, S ^b   Giles, C L ^b   Gori, M ^a  

^a NEC LABORATORIES AMERICA   (United States)

^b UNIVERSITY OF SIENA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CREDIT ASSIGNMENT; FOCUSED CRAWLER; FOCUSED CRAWLING; LINK HIERARCHIES; PERFORMANCE IMPROVEMENTS; POTENTIAL SOLUTIONS; SEARCH ENGINE INDICES; SHORT-TERM GAINS;

SEARCH ENGINES;

ALGORITHMS;

EID: 70350672544     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. ;Web surpasses one billion documents: Inktomi/NEC press release.; available at http://www.inktomi.com.Jan 18200O
2. S.Chakrabarti, M.van der Berg.and B.Dom, ;Focused crawling: a new approach to topic-specific web resource discovery,; in Proc.of the 8th International World-Wide Web Conference (WWW8), 1999.
3. J.Cho, H.Garcia-Molina, and L.Page, ;Efficient crawling through URL ordering,; in Proceedings of ihe Seventh World-Wide Web Conference.1998.
4. [41 A.McCallum, K.Nigam.J.Rennie, and K.Seymore, ;Building domain-specie search engines with machine learning techniques,; in Proc.AAAI Spring Symposium on Intelligent Agents in C'yherrpace, 1999.
5. (51 A.K.McCallum, K.Nigam, J.Rennie, and K.Seymore, ;Automating the construction of internet por tals with machine learning.; To appear in Information Retrieval,
6. M.Gori.M.Maggini, and F.Scarselli, ;http://nautilus.dii.unisi.it.;
7. O Heinonen.K.Hatonen.and K.Klemettinen, ;WWW robots and search engines.; Seminar on Mobile Code.Report TKO-C79.Helsinki University of Technology.Department of Computer Science, 1996.
8. [81 S.Chakrabarti, B.Dom, P.Raghavan, S.Rajagopalan, D.Gibson.and J.Kleinberg.;Automatic resource compilation by analyzing hyperlink structure and associated text,; in Proc.7th World Wide Web Co,frrence, Brisbane.Australia. 1998.
9. K.Bharat and M.Henzinger, ;Improved algorithms for topic distillation in hyperlinked environments,; in Proceeding.s 21st Int'l ACM SIGIR conference., 1998.
10. [101 J.Kleinberg.;Authoritative sources in a hyperlinked environment.; Report Ri 10076, IBM, May 1997.1997.
11. [Ill S.Chakrabarti.M.van den Berg, and B.Dom, ;Distributed hypertext resource discovery through examples.; in VLDB '99, Proceedings of 25th International conference on Very Large Data Bases, September 7- 10, 1999.Edinburgh.Scotland, UK (M.P.Atkinson, M.E.Orlowska, P.Valduriez, S.B.Zdonik, and M.L.Brodie, eds.), pp.375 - 386, Morgan Kaufmann, 1999.
12. [121 J.Rennie and A.McCallum, ;Using reinforcement learning to spider the web efficiently,; in P,r,t' ititernational C'onference on Machine Learning (1CML), 1999.
13. K.Bharat, A.Broder, M.Henzinger P.Kumar, and S.Venkatasubramanian, ;The connectivity server: Fast access to linkage information on the web,; WWW7/Computer Networks 30(1-7), pp.469 - 477, 1998.
14. S.Chakrabarti, D.Gidson, and K.McCurley.;Surfing backwards on the web,; in Proc 8th World Wide Web Conference (WWW8), 1999.
15. G.Salton and M.J.McGill, An introduction to Modem information Retrieval.McGrawHjll, 1983.
16. M.Porter, ;An algorithm for suffix stripping,; program, vol.14, no.3, pp.130 - 137, 198O
17. T.M.Mitchell, Machine Learning.McGraw-Hill, 1997.
18. K.Nigam.A.McCallum.S.Thrun, and T.Mitchell.;Text classification from labeled and unlabelled documents using EM.; To appear in Machine Learning, 1999.
19. A.Dempster, N.Laird, and I).Rubin, ;Maximum likelihood from incomplete data via the EM algo rithm,; J.R.Statist.Soc.B, vol.39, pp.185 - 197.1977.