Method and apparatus for focused crawling

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C715S252000

Reexamination Certificate

active

07080073

ABSTRACT:
The present invention pertains to the field of computer software. More specifically, the present invention relates to dynamic discovery of documents or information through a focused crawler or search engine.

REFERENCES:
patent: 5717914 (1998-02-01), Husick et al.
patent: 6119124 (2000-09-01), Broder et al.
patent: 6125361 (2000-09-01), Chakrabarti et al.
patent: 6219833 (2001-04-01), Solomon et al.
patent: 6260042 (2001-07-01), Curbera et al.
patent: 6314565 (2001-11-01), Kenner et al.
patent: 6363377 (2002-03-01), Kravets et al.
patent: 6377945 (2002-04-01), Risvik
patent: 6463430 (2002-10-01), Brady et al.
patent: 6493702 (2002-12-01), Adar et al.
patent: 6523036 (2003-02-01), Hickman et al.
patent: 6556984 (2003-04-01), Zien
patent: 6560620 (2003-05-01), Ching
patent: 6601075 (2003-07-01), Huang et al.
patent: 6643650 (2003-11-01), Slaughter et al.
patent: 6643652 (2003-11-01), Helgeson et al.
patent: 6658423 (2003-12-01), Pugh et al.
patent: 6701318 (2004-03-01), Fox et al.
patent: 6760902 (2004-07-01), Ott
patent: 6785673 (2004-08-01), Fernandez et al.
patent: 2001/0018693 (2001-08-01), Jain et al.
patent: 2001/0043234 (2001-11-01), Kotamarti
patent: 2001/0049675 (2001-12-01), Mandler et al.
patent: 2001/0054009 (2001-12-01), Miller et al.
patent: 2002/0135800 (2002-09-01), Dutta
patent: 2002/0165717 (2002-11-01), Solmer et al.
patent: 2002/0166081 (2002-11-01), Richardson et al.
patent: 2002/0174147 (2002-11-01), Wang et al.
patent: 2003/0130998 (2003-07-01), Fox et al.
Babowal, D. et al., “From Information to Knowledge: Introducing WebStract's Knowledge Engineering Approach,” Proceedings of the 1999 IEEE Canadian Conference, pp. 1525-1530.
Chakrabarti, S. et al.,Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery, Mar. 29, 1999.
Davulcu, H. et al., (1999), “A Layered Architecture for Querying Dynamic Web Content,” pp. 491-502.
Parberry, I., “Problems on Algorithms,” Dept. of Computer Science, University of North Texas, Denton TX, Aug. 1994.
Schatz, B. et al. (1996), “Federating Diverse Collections of Scientific Literature,” pp. 28-36.
Shasha, D. et al., “Approximate Tree Pattern Matching,” Chapter 14, pp. 1-28.
Tsuda, H. et al. (1998), “WorkWare: WWW-based Chronological Document Organizer,” pp. 1-6.
Zhang, K., et al., “On the editing distance between unordered labeled trees,”Information Processing Letters, May 25, 1992, vol. 42, pp. 133-139.
Kaizhong Zhang et al., “On the Editing Distance Beween Unordered Labeled Trees”, May 25, 1992, Elsevier Science Publishers, pp. 133-139.
Eugene W. Meyers, “An 0(ND) Difference Algorithm and Its Variations” Algorithica (1986) ppagesd. 251-266.
Fred Douglis et al., “The AT&T Internet Difference Engine: Tracking and Viewing Changes on the Web”, World Wide We, Jan. 1998, pp. 27-44.
Soumen Chakrabarti et al., Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery, www.almaden.ibm.com/almaden/feat/www/8/, printed Aug. 2, 2001, pp. 1-19.
Junghoo Cho et al., “Efficient Crawling Through URL Ordering” www-db.stanford.edu/-cho/crawler-paper/ printed Aug. 2, 2001, pp. 1-18.
Jon M. Kleinberg, “Authoritative Sources In a Hyperlinked Environment,” www.cs.cornell.edu/home/kleinber/, printed Aug. 2, 2001, pp. 1-34.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for focused crawling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for focused crawling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for focused crawling will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3543051

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.