Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2003-03-20
2004-11-09
Choules, Jack (Department: 2177)
Data processing: database and file management or data structures
Database design
Data structure types
Reexamination Certificate
active
06816850
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to search engines, and more particularly pertains to a method for organizing information by monitoring the search activity and personal data of searchers.
BACKGROUND OF THE INVENTION
The Internet is an extensive network of computer systems containing hundreds of millions of documents, files, databases, text collections, audio clips, video clips and samples of any other type of information (collectively “articles”). As explained in my earlier referenced patent applications, search engines are used to locate articles over the Internet. Given the large amount of information available over the Internet, it is desirable to reduce this information down to a manageable number of articles which fit the needs of a particular user.
OBJECTS AND SUMMARY OF THE INVENTION
Accordingly, it is an object of the invention to organize articles available over the Internet or within any other collection of information.
It is another object of the present invention to monitor searching activity to organize articles in accordance with the searching activity of one or more users.
It is another object of the present invention to utilize personal data about a searcher to organize articles in accordance with the searching activity of one or more users.
To accomplish these and other objects, the present invention generally comprises a method for organizing information in which the search activity of previous users is monitored and such activity is used to organize articles for future users. Personal data about future users can be used to provide different article rankings depending on the search activity and personal data of the previous users.
This brief description sets forth rather broadly the more important features of the present invention in order that the detailed description thereof that follows may be better understood, and in order that the present contributions to the art may be better appreciated. There are, of course, additional features of the invention that will be described hereinafter and which will be for the subject matter of the claims appended hereto.
In this respect, before explaining a preferred embodiment of the invention in detail, it is understood that the invention is not limited in its application to the details of the method set forth in the following description. The invention is capable of other embodiments and of being practiced and carried out in various ways. Also, it is to be understood, that the phraseology and terminology employed herein are for the purpose of description and should not be regarded as limiting.
As such, those skilled in the art will appreciate that the conception, upon which disclosure is based, may readily be utilized as a basis for designing other methods and systems for carrying out the objects and purposes of the present invention. It is important, therefore, that the claims be regarded as including such equivalent constructions insofar as they do not depart from the spirit and scope of the present invention.
REFERENCES:
patent: 5278980 (1994-01-01), Pedersen et al.
patent: 5321833 (1994-06-01), Chang et al.
patent: 5535382 (1996-07-01), Ogawa
patent: 5754939 (1998-05-01), Herz et al.
patent: 5758257 (1998-05-01), Herz et al.
patent: 5835087 (1998-11-01), Herz et al.
patent: 5907836 (1999-05-01), Sumita et al.
patent: 6029195 (2000-02-01), Herz
patent: 6138562 (2000-10-01), Hertz
patent: 6195657 (2001-02-01), Rucker et al.
patent: 6285999 (2001-09-01), Page
Chakrabarti, “Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.” http://www7.scu.edu.au/programme/fullpapers/1898/com1898.html. pp. 1-14.
Dongarra, Jack J., “An Extended Set of FORTRAN Baslc Linear Algebra Subprograms.” ACM Transactions on Mathematical Software, vol. 14, No. 1, Mar. 1988. pp. 1-17.
Mizruchi, Mark S., “Techniques for Disaggregating Centrality Scores in Social Networks.” In N.B. Tuma, Editor, Sociological Methodology, pp. 26-48. Jossey-Bass, San Francisco, 1986.
Kimoto et al. “A Dynamic Thesaurus and Its Application to Associated Information Retrival” IJCNN-91-Seattle, vol. 1, pp. 19-29, Jul. 1991.
Bidmead, C. “Windows Personal Librarian” Which Computer?, vol. 16, No. 10, pp. 23, Oct. 1993.
Savoy, “A New Probabilistic Scheme for Information Retrieval in Hypertext”, New Review of Hypermedia and Multimedia, Applications and Research, vol. 1, pp. 107-134, 1995.
Fuhr et al. Probabilistic Learning Approaches for Indexing and Retrieval with the TREC-2 Collection, TREC Text Retrieval Conference, pp. 67-74, 1993.
Bharat, “The Connectivity Server: Fast Access to Linkage Information on the Web” http://decweb.ethz.ch/WWW7/1938.htm pp. 1-13, Apr., 1998.
Brin, “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” http://www7.scu.edu.au/programme/fullpapers/1921/com1921.htm. pp. 1-20, Apr. 1998.
Chakrabarti, “Experiments in Topic Distillation.” http://almaden.ibm.com/cs/k53/abstract.html. pp. 1-6. No Date.
Chakrabarti, “Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.” http://www7.scu.edu.au/programme/fullpapers/1898/com1898.html. pp. 1-14, Apr. 1998.
Davison, Brian D., “DiscoWeb: Applying Link Analysis to WebSearch.” http://www.cs.rutgers.edu/~davison/pubs/www99.html. pp. 1-4, 1999.
Gibson, David, “Inferring Web Communities from Link Topology.” http://www.c-s.cornell.edu/home/kleinber/ht98.ps. pp. 1-17, 1998.
Kleinberg, Jon M. “Authoritative Sources in a Hyperlinked Environment.” http://www.cs.corneil.edu/home/kleinber/auth.pdf. pp. 1-34, 1998.
Ask Jeeves, Inc.
Choules Jack
Wong, Cabello, Lutsch, Rutherford & Brucculeri P.C.
LandOfFree
Personalized search methods including combining index... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Personalized search methods including combining index..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Personalized search methods including combining index... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3299222