This invention relates in general to online search engines, and in particular to personalization of search results.
The current state of the art in online search engines is highly advanced in its ability to retrieve documents (e.g., web pages or portions thereof, images, etc.) that are responsive to the terms of a query. Search engines today can quickly retrieve specific documents that match the terms of the query. However, current search engines often return documents that while accurately correspond to the specific terms of the query, do not in any way reflect the user's underlying interests. Thus, two different users, one who is very interested in sports, and another who is interested in politics, will obtain exactly the same results to a given query, say “drug testing in baseball,” even though the first user may be more interested in learning about which teams have implemented drug testing, while the latter user is more interested in learning about legislation related to drug testing in sports. Thus, there is a need for providing a mechanism and methodology for personalizing search results in accordance with the interests of the users.
Further, while a user may have particular set of interests that may be useful in processing their search query, a user may not want to always have such interests influence the query results. Thus, it would be desirable to a provide a mechanism and a methodology by which the user can variably adjust the degree to which his interests influence the results of a given search query.
The present invention provides allows a user to variably adjust the degree to which his or her personal interests influence the presentation of results of a given search query. The present invention has multiple embodiments, including a system for providing a search engine, a methodology for processing a search query, and a user interface for the user to variably adjust the degree of influence.
For a user's perspective, the present invention provides a mechanism for personalizing search results. The user defines a set of interests, for example as a set of topics or categories of interest to the user, as an interests profile. The user then submits a search query to a search engine. The search engine retrieves documents that are relevant to the query and presents these as search results. At first (though not necessarily) the search results are ranked without regard to the user's interests. This enables the user to see the relevance of the documents without influence by his personal interests. The user can variably control ranking of the documents in the search result set. In a preferred embodiment, this is done by direct manipulation of graphical control element, a personalization control. This graphical element can have various graphical representations, and in one embodiment it is represented as a slider. Adjusting the control element adjusts the degree to which the results are ranked according to the user's interests, as expressed in his interest profile. In response to changes in the position of the control element, the search results are reranked, thereby allowing the user to see how his interests affect the ordering of the results.
In one embodiment, the ranking of search results operates to increase the relevance score of documents that are associated with the directory of topics. Each topic in the directory is associated with a group of documents (e.g., websites) which are deemed relevant to the topic. For each document (again, website), a boost value is provided which indicates the degree of relevance of the site to the topic. All pages within a given site get that site's boost value. The boost value may be understood as a scaling factor that represents the relevance of the site to the topic. During the query processing, the set of documents is returned, and scored without regard to their inclusion in the topic directory. In addition, a separate score for each document is determined in which the document's underlying relevance score is adjusted by its associated boost value if any, for example by multiplying the relevance score by the boost value, thereby scaling the relevance of the document to the query. Generally, only those documents which belong to sites listed in the directory will have a boosted relevance score, and other documents in the search results will not. The reranking of the documents in accordance with their boosted relevance scores is then a function of the position of the personalization control, either from no influence (where the boost value has no effect on the relevance score) to complete influence, wherein boost value for each document is applied 100% to the relevance score, and any number of intermediate levels of application. The user can thus immediately rerank the documents in the search results by adjusting the position of the control.
A system embodiment includes a topic directory for providing topics (categories) to a user, a search engine and index for searching indexed websites in response to a user's query, and a personalization component for determining for the search results at least one (and preferably a set) of rankings of the search results in accordance with the user's interests. A user interface embodiment includes a topical directory, with various topics, and graphical controls (e.g., checkboxes) in which the user can select topics of interests, and a graphical control that allows the user to adjust the search result ranking in accordance with his interest profile.
The present invention is next described with respect to various figures and diagrams and technical information. The figures depict various embodiments of the present invention for purposes of illustration only. One skilled in the art will readily recognize from the following discussion that alternative embodiments of the illustrated and described structures, methods, and functions may be employed without departing from the principles of the invention.
Referring now to
Clicking on the Edit Profile link 104 accesses the page 200 illustrated in
The subtopics themselves can have any number of additional levels of subtopics. For example,
Referring again to
The personalization control 608 allows the user to adjust the ranking of the individual documents/pages of the search results with respect to his interests, preferably as expressed in the personalization profile. The personalization control may be explained as controlling a degree of influence or contribution of the user's interest profile to the ranking of the search results.
In the example of
Referring now to
Referring now to
In the examples of
As shown on
In one embodiment of the invention, the personalization of search results is provided by the following methodology. Those of skill in the art of search engine design can readily understanding the basic structure of a search engine and its operation in which this methodology can be implemented.
1) When the user selects topics (categories), they are added to a cookie containing a list of his interests IN (where IN is short for “interests”). The interests can be expressed as either text tokens (e.g. “computers”), or as indices into a directory, where each topic/subtopic has an index number. When the user accesses the site, the system retrieves this interest list from the cookie. Alternatively, the site can provide a user registration page, in which the user registers with a user name and password, and the user's interests are stored at the search engine site in a database, and retrieved in response to the user login.
2) Each time the user issues a search query Q, the list IN is sent to a frontend web server.
3) Then the frontend web server issues two requests to a backend search engine (Q, null) and (Q, IN), which returns to the frontend web server two results sets, R_base (normal) and R_in (personalized), respectively.
4) The base query (Q, null) is the same as searching for Q on the search engine without any personalization, so R_base is the result set that the search engine would normally return in response to the query. As noted above, the search results accordingly are ranked on their relevance to the query and any other factors, such as PageRank, as disclosed in U.S. Pat. No. 6,285,999, “Method for node ranking in a linked database”, which is incorporated by reference herein in its entirety and for all of its teachings.
5) The personalized query (Q, IN) contains the user's interest list. The search engine follows a similar processing control flow as a normal query, but it activates a personalization component during the scoring function, which “boosts” documents that are relevant to the set of interests IN.
In one embodiment of the invention, these boosts are implemented using a set of maps (one map for each topic/subtopic in the directory), of the form:
So for example, the category “Health” has a map of the form
which contains entries such as:
where nih.gov, cdc.gov, and med.Stanford.edu are various sites that have been determined (either manually or automatically) to be related to the topic “Health”. In other words, for each topic in the directory, there is a set of sites that have been determined to be relevant to the topic, and for each of these sites, a boost value is defined.
The boost for the sites listed in the topical directory is generally determined as follows:
a) A “site graph” is generated where nodes of the graph are sites (basically, pages on the same host) and edges between nodes are weighted based on the number of pages from one site that link to pages on another. This same type of graph can be used to compute all topic boost maps.
b) For each topic in the directory, say “Health”, a number of sites are selected as “start sites” S0 whose home page is listed in the Open Directory. For example, for a university like Stanford, start sites may be selected as any site ending in .stanford.edu.
c) A computation is run in two passes:
d) The sites in S2 are boosted with their assigned weights.
When a personalized query comes in with an interest set (e.g., {Health, Music}), then the personalization component consults the respective maps, and then for query results (i.e. documents) that are in these maps, the personalization components boosts the IR score for them, so that they would get ranked higher. The IR score is the information retrieval score that the search engine provides for each document, and can be a function of document relevance and other factors, such as PageRank.
For example if http://www.med.stanford.edu/research/ were one of the results for query Q, and IN included “Health,” then that result would get a multiplicative boost of 3.5 to its IR score, because that page is on the site med.stanford.edu. For multiple interests, the values in the corresponding maps are multiplied together for a combined effect. Further details of one implementation for determining the boost for sites in the directory boost map are described in U.S. patent application Ser. No. 10/646,331 incorporated by reference herein.
6) The frontend web server receives R_base and R_in. R_base represents the results 602 the user sees when the personalization control 608 is set at 0 (or its minimum position 612). R_in represents the results 602 the user sees when the slider is at its maximum position 614, e.g. 10. In one embodiment, the control has 11 positions, but any number of positions may be used. The rankings that are shown to the user between 0 and 10 are interpolated; this means using R_base and R_in, the personalization component constructs intermediate rankings (R_1 . . . R_9) by moving each individual result along a virtual path from its position when the control 608 is at its minimum position to when the control 608 is at its maximum position.
7) How the slider effect is provided to the user:
The frontend web server appends the results in R_in that are not in R_base to R_base to get a list of all unique results (either in R_base or R_in) called R_all. The frontend web server then assigns consecutive identification numbers to the results in R_all that serve as identifiers. The frontend then sends to the user's browser two items:
a) the mapping {id→result} for each of the results in R_all, containing for each document in the results its identification number; and
b) N vectors that denote the rankings the user should see, in terms of result IDs, where N is the number of positions of the slider, and each vector represents the ordering of the results based on the degree of personalization. In this example, there would be 11 vectors corresponding to positions 0 through 10 of the control 608. In one embodiment Vector 0 is [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], reflecting the un-personalized ranking of the results, assigned with the local IDs starting with R—0. Vector 10 is the ordering in the fully personalized results R_in; for instance, it might be [15, 17, 5, 0, 1, 2, 3, 4, 8, 9, 10], where documents 15 and 17, for example, are documents in the relevant map of the topic directory whose IR score was boosted according to the boost values in the map, and the value associated with the control 608's position. Transmitting the N ranking vectors to the client allows the client browser to quickly recomputed the rankings, rather than imposing that calculation on the server.
8) Finally, Javascript code in the result page causes the user's browser to reorder the search results using the appropriate one of the 11 positional ranking vectors in response to the user changing the position of the control 608. Further details of one embodiment of steps 6-8, above, are described in U.S. application Ser. No. 10/641,489, incorporated by reference herein.
The present invention has been described in particular detail with respect to one possible embodiment. Those of skill in the art will appreciate that the invention may be practiced in other embodiments. First, the particular naming of the components, capitalization of terms, the attributes, data structures, or any other programming or structural aspect is not mandatory or significant, and the mechanisms that implement the invention or its features may have different names, formats, or protocols. Further, the system may be implemented via a combination of hardware and software, as described, or entirely in hardware elements. Also, the particular division of functionality between the various system components described herein is merely exemplary, and not mandatory; functions performed by a single system component may instead be performed by multiple components, and functions performed by multiple components may instead be performed by a single component.
Some portions of above description present the features of the present invention in terms of algorithms and symbolic representations of operations on information. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. These operations, while described functionally or logically, are understood to be implemented by computer programs. Furthermore, it has also proven convenient at times, to refer to these arrangements of operations as modules or by functional names, without loss of generality.
Unless specifically stated otherwise as apparent from the above discussion, it is appreciated that throughout the description, discussions utilizing terms such as “calculating” or “determining” or “identifying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system memories or registers or other such information storage, transmission or display devices.
Certain aspects of the present invention include process steps and instructions described herein in the form of an algorithm. It should be noted that the process steps and instructions of the present invention could be embodied in software, firmware or hardware, and when embodied in software, could be downloaded to reside on and be operated from different platforms used by real time network operating systems.
The present invention also relates to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer selectively activated or reconfigured by a computer program stored on a computer readable medium that can be accessed by the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. Those of skill in the art of integrated circuit design and video codecs appreciate that the invention can be readily fabricated in various types of integrated circuits based on the above functional and structural descriptions, including application specific integrated circuits (ASIC). In addition, the present invention may be incorporated into various types of video coding devices.
The algorithms and operations presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems may also be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will be apparent to those of skill in the art, along with equivalent variations. In addition, the present invention is not described with reference to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any references to specific languages are provided for disclosure of enablement and best mode of the present invention.
Finally, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention.
This application is a continuation application of and claims priority under 35 U.S.C. §120 to U.S. patent application Ser. No. 11/002,474, filed on Dec. 1, 2004 and issued as U.S. Pat. No. 7,716,223, which claims the benefit under 35 U.S.C. §119(e) of U.S. Patent Application No. 60/557,783 filed on Mar. 29, 2004, which are both incorporated by reference herein. This application also incorporates by reference U.S. patent application Ser. Nos. 10/646,331 (filed on Aug. 22, 2003 and issued as U.S. Pat. No. 7,216,123) and 10/641,489 (filed on Aug. 14, 2003); all of the above applications are commonly owned along with this application.
Number | Name | Date | Kind |
---|---|---|---|
5724521 | Dedrick | Mar 1998 | A |
5724567 | Rose et al. | Mar 1998 | A |
5754938 | Herz et al. | May 1998 | A |
5754939 | Herz et al. | May 1998 | A |
5778363 | Light | Jul 1998 | A |
5809242 | Shaw et al. | Sep 1998 | A |
5887133 | Brown et al. | Mar 1999 | A |
5946678 | Aalbersberg | Aug 1999 | A |
6012053 | Pant et al. | Jan 2000 | A |
6112202 | Kleinberg | Aug 2000 | A |
6134532 | Lazarus et al. | Oct 2000 | A |
6137911 | Zhilyaev | Oct 2000 | A |
6138113 | Dean et al. | Oct 2000 | A |
6285999 | Page | Sep 2001 | B1 |
6289342 | Lawrence et al. | Sep 2001 | B1 |
6308202 | Cohn et al. | Oct 2001 | B1 |
6327574 | Kramer et al. | Dec 2001 | B1 |
6327590 | Chidlovskii et al. | Dec 2001 | B1 |
6356898 | Cohen et al. | Mar 2002 | B2 |
6360221 | Gough et al. | Mar 2002 | B1 |
6366298 | Haitsuka et al. | Apr 2002 | B1 |
6370527 | Singhal | Apr 2002 | B1 |
6385592 | Angles et al. | May 2002 | B1 |
6385619 | Eichstaedt et al. | May 2002 | B1 |
6449657 | Stanback, Jr. et al. | Sep 2002 | B2 |
6560600 | Broder | May 2003 | B1 |
6584468 | Gabriel et al. | Jun 2003 | B1 |
6601061 | Holt et al. | Jul 2003 | B1 |
6665656 | Carter | Dec 2003 | B1 |
6665837 | Dean et al. | Dec 2003 | B1 |
6665838 | Brown et al. | Dec 2003 | B1 |
6681223 | Sundaresan | Jan 2004 | B1 |
6684205 | Modha et al. | Jan 2004 | B1 |
6757691 | Welsh et al. | Jun 2004 | B1 |
6772200 | Bakshi et al. | Aug 2004 | B1 |
6799176 | Page | Sep 2004 | B1 |
6871202 | Broder | Mar 2005 | B2 |
6912505 | Linden et al. | Jun 2005 | B2 |
6922685 | Greene et al. | Jul 2005 | B2 |
7017114 | Guo et al. | Mar 2006 | B2 |
7216123 | Kamvar et al. | May 2007 | B2 |
7380258 | Durden et al. | May 2008 | B2 |
7565630 | Kamvar et al. | Jul 2009 | B1 |
7716223 | Haveliwala et al. | May 2010 | B2 |
20020024532 | Fables et al. | Feb 2002 | A1 |
20020078045 | Dutta | Jun 2002 | A1 |
20020099685 | Takano et al. | Jul 2002 | A1 |
20020120619 | Marso et al. | Aug 2002 | A1 |
20020123912 | Subramanian et al. | Sep 2002 | A1 |
20020198882 | Linden et al. | Dec 2002 | A1 |
20030018659 | Fuks et al. | Jan 2003 | A1 |
20030037041 | Hertz | Feb 2003 | A1 |
20030088562 | Dillon et al. | May 2003 | A1 |
20030115318 | Wueste | Jun 2003 | A1 |
20030204502 | Tomlin et al. | Oct 2003 | A1 |
20030208478 | Harvey | Nov 2003 | A1 |
20030208482 | Kim et al. | Nov 2003 | A1 |
20030233345 | Perisic et al. | Dec 2003 | A1 |
20040024752 | Manber et al. | Feb 2004 | A1 |
20040044571 | Bronnimann | Mar 2004 | A1 |
20040073485 | Liu et al. | Apr 2004 | A1 |
20040249709 | Donovan et al. | Dec 2004 | A1 |
20050038775 | Haveliwala et al. | Feb 2005 | A1 |
Number | Date | Country |
---|---|---|
1050830 | Nov 2000 | EP |
WO 0144992 | Jun 2001 | WO |
WO 0163472 | Aug 2001 | WO |
WO 03107127 | Dec 2003 | WO |
WO 2005033979 | Apr 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20100169297 A1 | Jul 2010 | US |
Number | Date | Country | |
---|---|---|---|
60557783 | Mar 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11002474 | Dec 2004 | US |
Child | 12720479 | US |