US 6,816,850 B2Grant
Personalized search methods including combining index entries for catagories of personal data
Issue Date:2004-11-09
•4 Claims
•1 Drawing Sheets
Abstract
A method of 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. The personal data is used in the development of an index, the index including entries for specific categories of personal data. The similarity or difference in the prior results for a query term determine if separate index entries are needed for the categories and terms being considered.
Metadata
Assignee
- Ask Jeeves, Inc.
Inventor
- Gary A. Culliss
Application Information
Application Number:US 10/392,510
Filing Date:2003-03-20
Priority Date:1997-08-01
Art Unit:7
Classifications
IPC:
G06F 1730
Field of Search:
707 1707 2707 3707 5707 10
Patent Drawings (1 sheets)
Description
Related Disclosures
[0002] This patent application relates to subject matter disclosed in Disclosure Document Numbers 411,887; 417,369; 417,458 and 442,322.
Related Applications
[0003] This patent application is a continuation of Ser. No. 09/684,209 filed Oct. 6, 2000 now U.S. Pat. No. 6,539,377, which is a continuation of Ser. No. 09/259,600 filed Mar. 1, 1999 now U.S. Pat. No. 6,182,068, which is a continuation in part of three co-pending patent applications, Ser. No. 08/904,795 now U.S. Pat. No. 6,006,222, Ser. No. 08/960,140 now U.S. Pat. No. 6,014,665 and Ser. No. 09/041,411 now U.S. Pat. No. 6,078,916, filed Aug. 1, 1997, Oct. 29, 1997 and Mar. 12, 1998, respectively, all entitled “Method For Organizing Information.”
Field of the Invention
[0004] 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
[0005] 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
[0006] Accordingly, it is an object of the invention to organize articles available over the Internet or within any other collection of information.
[0007] 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.
[0008] 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.
[0009] 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.
[0010] 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.
[0011] 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.
[0012] 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.
Description of the Preferred Embodiments
[0013] 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 referred to as articles and designated herein by the generic labels A1, A2, A3, etc.
[0014] As described in my previous applications, the present invention maintains an index of key words, terms, data or identifiers in English or other languages, computer code, or encryption which are collectively referred to as key terms and represented herein by the generic labels “Alpha, ” “Beta,” “Gamma,” “Delta,” “Epsilon,” etc.
[0015] The articles can each be associated with one or more of these key terms by any conceivable method of association now known or later developed. A key term score is associated with each article for each of the key terms. Optionally, a key term total score can also be associated with the article.
[0016] As described in my previous applications, the invention can accept a search query from a user and a search engine will identify matched articles and display squibs of the matched articles in accordance with their comparison scores. Articles can have their key term scores or key term total scores altered according to whether they were displayed to a user, whether they were selected by a user, how much time the user spent with the article, etc. In this application, the phrase previous-user relevancy score, designated by the generic label “PRS,” will be used to refer to any of the key term score, key term total score, key term probability score, comparison score, or other ranking score determined by the previous search activity of users.
[0017] For example, with the key term scores and key term total scores shown in parentheses, the index may look like this:
| Index |
|---|
[0018] By storing key term groupings of two or more key terms, the index may look like this:
| Index |
|---|
[0019] Personal Data
[0020] The present embodiment of the invention utilizes personal data to further refine search results. Personal data includes, but is not limited to, demographic data, psychographic data, personal interest data, personal activity data or other data about users. Personal data can be represented by the generic label “PS.” Individual elements of personal data can be represented by the generic labels “PS1,” “PS2,” “PS3,” etc.
[0021] Demographic data includes, but is not limited to, items such as age, gender, geographic location, country, city, state, zip code, income level, height, weight, race, creed, religion, sexual orientation, political orientation, country of origin, education level, criminal history, or health. Psychographic data is any data about attitudes, values, lifestyles, and opinions derived from demographic or other data about users.
[0022] Personal interest data includes items such as interests, hobbies, sports, profession or employment, areas of skill, areas of expert opinion, areas of deficiency, political orientation, or habits. Personal activity data includes data about past actions of the user, such as reading habits, viewing habits, searching habits, previous articles displayed or selected, previous search requests entered, previous or current site visits, previous key terms utilized within previous search requests, and time or date of any previous activity.
[0023] A searcher who does not possess certain personal data characteristics, such as being a doctor, for example, could also choose to see articles ranked according to the searching activity of previous searchers who were doctors, as described below. In this respect, then, it is possible for a search request to specify the type of personal data previous searchers should have had, even if the current (or second) searcher does not actually have that personal data characteristic.
[0024] Inferring Personal Data
[0025] Users can explicitly specify their own personal data, or it can be inferred from a history of their search requests or article viewing habits. In this respect, certain key words or terms, such as those relating to sports (i.e. “football” and “soccer”), can be detected within search requests and used to classify the user as someone interested in sports. Also, certain known articles or URLs can be detected in a users searching or browsing habits, such as those relating to CNNfn (www.cnnfn.com) or Quote.com (www.quote.com), and also used to classify the user as someone interested in finance.
[0026] A cumulative score can be kept with regard to these occurrences of certain classified key terms, queries or visited URLs to quantify how strongly someone is associated with a particular item of personal data. The score can be normalized over time, frequency or other activity such as the number of searches performed, the amount of time spent online, the amount of time spent browsing on a particular subject, the number of URLs or articles selected for a particular subject, or otherwise.
[0027] For example, assume a user has entered the following ten search requests and visited the following articles or URLs:
| Index for Search Requests or Browsing Topics |
|---|
| Index for Articles or URLs |
|---|
[0028] Given a correlation chart between certain key terms and certain items or personal data such as the following:
| Index for Search Requests or Browsing Topics |
| Index for Articles or URLs |
[0029] Then, the user can be identified as having the personal data characteristic of being a sports fan and having an interest in finance because there are three queries relating to sports (“sports scores,” “football,” and “nba”) and five queries containing key words relating to finance (“stock quotes,” “cnnfn,” “junk bonds,” “stock quotes,” and “dow jones”) This can be done by keeping a cumulative score for a user for search requests or URLs. For example, whenever there is a match (whole or partial) between a search request or URL and an item of personal data, a record for the user can be updated to give a +1 for that item of personal data. A cumulative score can be developed for the user for each item of personal data, called a personal data item score. When the personal data item score of the user reaches a certain threshold, then the item of personal data can be said to be associated with the user. Additionally or alternatively, the strength of the association can be determined by the cumulative personal data item score. The personal data item score for each item of personal data can be normalized by any normalizing factor, such as the number of requests entered, the number of URLs visited, the average personal data item score for other users in that item of personal data, the median personal data item score for other users in that item of personal data or otherwise.
[0030] Similarly, the same analysis can be done with URLs or articles that are deemed to relate to certain items or personal data as well that the user has visited. Particular queries can include terms from more than one personal data classification and thus indicate more than one item of personal data for the user.
[0031] Tracking Personal Data
[0032] When a first user enters a search query, the personal data can be considered part of the request and stored within or added to the index, individually or in groupings with other items of data such as key terms, categories, or ratings. For example, after receiving a number of queries, the index may look like this:
| Index |
|---|
[0033] The personal data can be used to recall different lists of articles in response to new queries from new users. In this respect, it is possible to simply store all elements of personal data, individually or in key term groupings, within the index separately, with components of the query or otherwise. When the next user enters a search request, the search request and the user's personal data are combined to form groupings containing key term groupings, key terms and personal data groupings, category and personal data groupings, rating and personal data groupings, etc. Articles associated with these groupings are then retrieved from the index, and their relevancy scores are used or combined to determine their rankings.
[0034] For example, if a first user enters a search request of Alpha and has personal data characteristics of PS1 and PS5, then the request can be combined with the personal data to form the following groupings: Alpha-PS1 and Alpha-PS5. In addition, other groupings or permutations such as PS1-PS5 and Alpha-PS1-PS5 are also possible and can be stored within the index. These groupings are stored within the index and the relevancy scores of selected articles are updated according to methods described in my previous applications To initially retrieve articles for presentation to the first user using a conventional search engine, just the key term “Alpha” can be used as a key term to pull articles from within an index.
[0035] When a second searcher actually having, or who has selected to see results from other searchers having, personal data characteristics of at least PS5 searches for Alpha, for example, then the relevancy scores of articles under at least the grouping Alpha-PS5 can be used to rank the articles according to methods described in my previous applications. Similarly, a searcher having or selecting personal data characteristic of PS1 searching for Alpha can see articles ranked according to methods described in my previous applications by the relevancy scores of articles under at least the grouping Alpha-PS1. A searcher having or selecting personal data characteristics of PS1 and PS5 searching for Alpha can see articles ranked according to methods described in my previous applications by the relevancy scores of articles under any of groupings Alpha-PS1, Alpha-PS5, and Alpha-PS1-PS5, as desired.
[0036] In this manner, the relevancy of articles is determined by the searching activity of previous searchers which share, or are indicated as having, certain personal data characteristics.
[0037] As mentioned above, a searcher who does not possess certain personal data characteristics, could also choose to see articles ranked according to the searching activity of previous searchers who have a certain characteristic, in which case the user should simply specify the personal data characteristic the user desires.
[0038] Identifying Relevant Personal Data
[0039] It is possible that not all elements of personal data will result in different rankings of articles under certain key terms or key term groupings. To save storage space and processing time, it is desirable to determine which personal data characteristics result in different rankings.
[0040] One way to determine which personal data characteristics result in different rankings is to compare the previous-user relevancy scores, or ranking determined at least in part by the previous user relevancy scores, of articles under certain key terms or key term groupings in which a particular personal data characteristic is different. For example, articles under a search query or key term such as “shoes” may have different relevancy scores depending on whether the previous searchers were women or men, whereas the rankings may not be different for a personal data characteristic such as political orientation.
[0041] For example, the index for the following key term groupings for the key term “shoes,” with the previous-user relevancy scores in parentheses, may look like this:
| Index |
|---|
[0042] Here, the previous-user relevancy scores of the articles under Shoes-Men and Shoes-Women are different. The magnitude of difference deemed appropriate to identify relevant personal data for a particular key term, grouping of key terms, or query is adjustable. For example, one standard might be if the rankings of five or more of the top 10 articles when ranked in any manner according to their previous-user relevancy scores are significantly different, then the particular element of personal data can be deemed relevant. Of course, some articles may not even be listed under some groupings, indicating that their previous-user relevancy scores are quite different. By “significantly different” is meant different enough so that a user might prefer to see a different ranking based on his or her personal data.
[0043] When comparing different combinations of personal data, the aforementioned analysis is preferably performed on groupings in which one item of a similar type of personal data is varied. For example, the analysis may look at men compared to women, republicans compared to democrats, or certain professions compared to other professions, etc. Personal data which is not relevant to creating differently ranked articles can be tagged, removed from the index or not stored in the index at all.
[0044] When a new search request is submitted by a new or second user, the groupings containing parts of the search request and personal data of the second user (or selected by the second user) which are in the index, or are otherwise tagged as being relevant, can then be used to rank or alter the ranking of the articles according to the previous-user relevancy scores under the groupings.
[0045] Personalized Queries
[0046] Another embodiment of the present invention keeps track of the full queries, or portions thereof such as key terms groupings, which are entered by users having certain personal data characteristics. In this embodiment, queries or portions thereof such as key term groupings, are stored within an index, preferably along with the personal data and a previous-user relevancy score for each query.
[0047] The previous-user relevancy score for a particular query or portion thereof can be: the number of times the query was entered by all users; the number of times a query was entered by unique users; the number of times a query was entered by a particular group of unique users sharing a particular personal data characteristic; the product, sum or average of the previous-user relevancy scores of all or some of the articles under the query or portion(s) thereof for all users, unique users or a particular group of users; the product, sum or average of the previous-user relevancy scores of all or some of the articles under the query or portion(s) thereof for all users, unique users or a particular group of users and the number of times a query was entered by all users all users, unique users or a particular group of users: or any combination of these or other indicators of relevancy of the particular query, or portions thereof, to a particular person or group having certain personal data characteristics. These previous-user relevancy scores for the queries, or portions thereof, can be normalized by factors such as time, number of previous users sharing a particular personal data characteristic, or otherwise by dividing or otherwise altering the raw scores by the normalizing factor or factors.
[0048] For example, queries, such as those containing the word “shoes,” may be stored within the index, with a previous-user relevancy score in parentheses next to the query as follows:
| Index |
|---|
[0049] It may be desirable to maintain a separate index of just the narrower related key term groupings or queries and the previous-user relevancy scores such as:
| Index |
|---|
[0050] In addition, any amount of personal data can be included in the index. For example, an index including both gender and age may look like this:
| Index |
|---|
[0051] It is possible that not all queries, or portions thereof, will have different previous-user relevancy scores depending on the element of personal data considered. To save storage space and processing time, it is desirable to determine which personal data characteristics result in different rankings (as determined all, or at least in part, by the previous-user relevancy score) of the queries or portions thereof.
[0052] One way to determine which personal data characteristics result in different query rankings is to compare the previous-user relevancy scores, or ranking determined at least in part by the previous user relevancy scores, of queries, key terms or key term groupings in which a particular personal data characteristic is different. For example, the query or key term grouping such as “pump shoes” may have different relevancy scores depending on whether the previous searchers were women or men, whereas the rankings may not be different for a personal data characteristic such as profession.
[0053] For example, the index for the following key term groupings for the key term “shoes,” with the previous-user relevancy scores in parentheses, may look like this:
| Index |
|---|
[0054] Here, the previous-user relevancy scores of the queries or groupings Pump-Shoes-Men and Pump-Shoes-Women are different, whereas the previous-user relevancy scores of the queries or groupings Pump-Shoes-Doctor and Pump-Shoes-Lawyer are somewhat similar. The personal data of gender (i.e. male or female) is then considered relevant. The magnitude of difference in previous-user relevancy scores deemed appropriate to identify relevant personal data for a particular key term, grouping of key terms, or query is a variable that can be adjusted to make the system more or less sensitive to these differences.
[0055] For example, one standard might be if the rankings of five or more of the top 10 queries when ranked in any manner according to their previous-user relevancy scores are different, then the particular element of personal data can be deemed relevant.
[0056] When comparing different combinations of personal data, the aforementioned analysis is preferably performed on groupings in which one item of a similar type of personal data is varied. For example, the analysis may look at men compared to women (gender), republicans compared to democrats (political orientation), or certain professions compared to other professions (employment), etc. Personal data that is not relevant to creating differently ranked articles can be tagged, removed from the index or never stored in the index at all
[0057] If two different items of personal data (such as gender and geographic region) are determined to create different lists of queries (or URLs) for a particular search request, then it can be assumed that the combination of these two items of personal data will result in a split as well. For example, if Shoes-Women results in a different list of queries (or URLs) than Shoes-Men (gender) when other items of personal data are held constant and/or varied in a known manner (such as varied within a certain predetermined range), and Shoes-Southeast results in a different list of queries (or URLs) than Shoes-Northwest (geographic region), then we can assume that Shoes-Women-Southeast, Shoes-Women-Northwest, Shoes-Men-Southeast, and Shoes-Men-Northwest are different and should be tagged as such or maintained within the index. Then, when someone having these two items of personal data enters a search request, the relevancy scores for articles under these key term groupings can be used to rank the articles for presentation to the second user.
[0058] Presenting Personalized Queries Related to a Search Request
[0059] As described in my earlier applications, when a new or second user enters a search query containing one or more words, the system can look for related key term groupings or queries that contain the original query or portions thereof and suggest those additional words, groupings, or queries or portions thereof, of the narrower related key term groupings or queries to refine the search. Preferably, the related key term groupings or queries will be narrower related key term groupings or queries, which are more narrow in scope.
[0060] In addition, the system can also identify narrower related queries or narrower related key term groupings which do not necessarily contain a word or term from the original search request, but which are nonetheless related to the request, such as by being synonyms r subsets or species of a broader category. For example, the query “High-Heels” can be identified as related to the subject “shoes” as a particular narrower query of the broader request “shoes.” Accordingly, the query “High-Heels” should be considered along with other queries that actually contain the word “shoes.” One way these queries related to the subject of the original search query, but which do not actually contain portions of the original search query can be identified is by first utilizing a thesaurus database of equivalent terms for terms in the original search query. Narrower queries or narrower key term groupings that contain one or more of these equivalent terms can then be identified as narrower related key term groupings.
[0061] To present personalized narrower related key term groupings to a user, the system can present the narrower related key term groupings that include not only at least a portion of the original search request, but also at least a portion of the user's personal data. These narrower related key term groupings can be presented in order of superiority according to their previous-user relevancy scores.
[0062] For example, when a woman enters the search request “shoes,” the system can look for narrower related queries or key term groupings which contain or are related to the term “shoes” and which have been entered by previous users having similar personal data, such as that of being a “woman.”
[0063] As seen from the following index, the top three narrower related key term groupings or queries related to the original query “shoes” for women, when ranked by their previous-user relevancy score, are “Nine West Shoes,” “Pump-Shoes,” “Enzo-Shoes.”
| Index |
|---|
[0064] Similarly, the top three narrower related key term groupings or queries related to the original query “shoes” for men, when ranked by their previous-user relevancy score, are “Nike Shoes,” “Reebok Shoes,” and “Converse Shoes.”
[0065] Accordingly, the invention could present these narrower related key term groupings or queries to women or men entering the search request “shoes,” respectively. Narrower related key term groupings or queries can be presented for other queries and for other people having certain personal data as well.
[0066] Personalized Search Results from Personalized Queries
[0067] To present personalized search results to a particular person searching with a particular term or query, the present invention may display a number of articles from a number of the narrower related key term groupings or queries which are ranked by their respective previous-user relevancy scores.
[0068] For example, a user having the personal data of being a woman who is searching for “shoes” can be shown the first few of the top ranked (by previous-user relevancy scores) articles from each of the first few of the top ranked (by previous-user relevancy scores) narrower related key term groupings or queries. In this example, the top ranked narrower related key term groupings or queries for women are “Pump Shoes,” “Enzo Shoes,” and “Nine West Shoes.” Displaying the top few (i.e. 3, more or less) articles from these narrower related key term groupings or queries, ranked according to their respective previous-user relevancy score, in response to the search request of “shoes” from a woman results in the following list of articles (when considering only the previous-user relevancy scores for the articles under these narrower related key term groupings or queries): A13(5), A16(5), A19(5), A14(4), A17(4), A20(4), A15(3), A18(3), A21(3).
| Index |
|---|
[0069] It is also possible to consider both the previous-user relevancy score of the top narrower related key term groupings or queries, as well as the previous-user relevancy score of the articles under these narrower related key term groupings or queries. In this respect, the previous-user relevancy score of the top narrower related key term groupings or queries and the previous-user relevancy score of the articles under these narrower related key term groupings or queries can be combined in any possible manner, such as by adding, multiplying, or averaging together
[0070] When the previous-user relevancy score of the top narrower related key term groupings or queries is multiplied with the previous-user relevancy score of the articles under these narrower related key term groupings or queries for the search request of “shoes” from a woman, for example, the following list of articles results: A19(80), A13(70), A20(64), A16(60), A14(56), A17(48), A21(48), A15(42), A18(36).
[0071] These articles can then be presented to the woman user entering the search request “shoes.” Also, these computations described above can be completed offline or otherwise to populate, replace the articles, or update the previous-user relevancy scores under the queries or key term groupings, such as Shoes-Women, for example.
[0072] Implementation
[0073] The implementation notes of my previous applications are hereby incorporated by reference.
[0074] The personal data, scores for determining the personal data based on personal activity, etc can be stored in the form of what are commonly known in the computer industry as “cookies.”
[0075] The method can allow the index to further associate a key term total score with each key term score; alter the index such that the key term score for the selected article under at least one of the first matched key terms is altered relative to other key term scores; and alter the index such that key term total scores of at least one of the articles related to the first search query under at least one of the first matched key terms a e altered relative to other key term total scores, but only for articles that have had their squibs displayed to the first user.
[0076] The method can also alter the index such that the key term score for the selected article under at least one of the first personal data elements is altered relative to other key term scores; and alter the index such that key term total scores of at least one of the articles related to the first search query under at least one of the first matched personal data elements are altered relative to other key term total scores, but only for articles that have had their squibs displayed to the first user.
[0077] The method can also add a positive score to the key term scores for the selected article under at least one of the first matched key terms; and add a positive score to the key term scores for the selected article under at least one of the first matched personal data elements.
[0078] The method can also add a positive score to the key term scores for the selected article under all the first matched key terms; and add a positive score to the key term scores for the selected article under all the first matched personal data elements.
[0079] The method can also allow the first user to select at least one of the articles related to the first search query through any action allowing the first user to sense more than just the squib of the at least one of the articles related to the first search query, the article selected by the first user being a selected article.
[0080] The method can also allows the user to select at least one of the articles related to the first search query by clicking on a hypertext link portion of the squib of the at least one of the articles related to the first search query, the article selected by the user being a selected article.
[0081] The method can also allow the user to select at least one of the articles related to the first search query by opening the at least one of the articles related to the first search query, the article selected by the first user being a selected article.
[0082] The method can also allow the user to select at least one of the articles by retrieving the at least one of the articles related to the first search query from a remote server, the article selected by the first user being a selected article.
[0083] As to a further discussion of the manner of usage and operation of the present invention, the same should be apparent from the above description. Accordingly, no further discussion relating to the manner of usage and operation will be provided.
[0084] With respect to the above description then, it is to be realized that the optimum dimensional relationships for the parts of the invention, to include variations in form, function and manner of operation, implementation and use, are deemed readily apparent and obvious to one skilled in the art, and all equivalent relationships to those described in the specification are intended to be encompassed by the present invention.
[0085] Therefore, the foregoing is considered as illustrative only of the principles of the invention. Further, since numerous modifications and changes will readily occur to those skilled in the art, it is not desired to limit the invention to the exact construction and operation shown and described, and accordingly, all suitable modifications and equivalents may be resorted to, falling within the scope of the invention.
Claims
What is claimed is:
1. A process of modifying an index that includes categories of personal data comprising:
a) tracking user activity for articles contained in said index for query terms;
b) combining index entries for categories of personal data when said user activity is not significantly different for a said query term for two or more categories of personal data.
2. The process of claim 1 wherein the measure of whether said user activity is significantly different comprises determining whether more than five of the top ten of said articles ranked in said index are different between said query term with one of said personal data categories and said query term with a second personal data category.
3. A process of displaying results in response to a query utilizing an index wherein articles are indexed based on query terms and personal data related to past users, wherein the index contains entries that have been combined based on similarity of past user activity with respect to results from searches, wherein the past users had different personal data associated with said users, but selected the same articles provided in response to similar query terms.
4. A database wherein the index to said database is modified by combining query term results for different personal data categories when prior results for the query term results are not significantly different for at least two different personal data categories.
Patent Citations (11)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5278980(A) | 1994-01-01 | Pedersen et al. | Applicant |
| US5321833(A) | 1994-06-01 | Chang et al. | Applicant |
| US5535382(A) | 1996-07-01 | Ogawa | Applicant |
| US5754939(A) | 1998-05-01 | Herz et al. | Applicant |
| US5758257(A) | 1998-05-01 | Herz et al. | Applicant |
| US5835087(A) | 1998-11-01 | Herz et al. | Applicant |
| US5907836(A) | 1999-05-01 | Sumita et al. | Applicant |
| US6029195(A) | 2000-02-01 | Herz | Applicant |
| US6138562(A) | 2000-10-01 | Hertz | Applicant |
| US6195657(B1) | 2001-02-01 | Rucker et al. | Applicant |
| US6285999(B1) | 2001-09-01 | Page | Applicant |
Non-Patent Literature (14)
- Chakrabarti, “Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.” http://www7.scu.edu.au/programme/fullpapers/1898/com1898.html. pp. 1-14.Applicant
- 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.Applicant
- 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.Applicant
- Kimoto et al. “A Dynamic Thesaurus and Its Application to Associated Information Retrival” IJCNN-91-Seattle, vol. 1, pp. 19-29, Jul. 1991.Applicant
- Bidmead, C. “Windows Personal Librarian” Which Computer?, vol. 16, No. 10, pp. 23, Oct. 1993.Applicant
- 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.Applicant
- Fuhr et al. Probabilistic Learning Approaches for Indexing and Retrieval with the TREC-2 Collection, TREC Text Retrieval Conference, pp. 67-74, 1993.Applicant
- Bharat, “The Connectivity Server: Fast Access to Linkage Information on the Web” http://decweb.ethz.ch/WWW7/1938.htm pp. 1-13, Apr., 1998.Applicant
- 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.Applicant
- Chakrabarti, “Experiments in Topic Distillation.” http://almaden.ibm.com/cs/k53/abstract.html. pp. 1-6. No Date.Applicant
- 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.Applicant
- Davison, Brian D., “DiscoWeb: Applying Link Analysis to WebSearch.” http://www.cs.rutgers.edu/˜davison/pubs/www99.html. pp. 1-4, 1999.Applicant
- Gibson, David, “Inferring Web Communities from Link Topology.” http://www.c-s.cornell.edu/home/kleinber/ht98.ps. pp. 1-17, 1998.Applicant
- Kleinberg, Jon M. “Authoritative Sources in a Hyperlinked Environment.” http://www.cs.corneil.edu/home/kleinber/auth.pdf. pp. 1-34, 1998.Applicant