Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20030220913 A1
Publication typeApplication
Application numberUS 10/155,697
Publication dateNov 27, 2003
Filing dateMay 24, 2002
Priority dateMay 24, 2002
Also published asUS8224857, US8626735, US8626743, US20080270393, US20120185485, US20120185497
Publication number10155697, 155697, US 2003/0220913 A1, US 2003/220913 A1, US 20030220913 A1, US 20030220913A1, US 2003220913 A1, US 2003220913A1, US-A1-20030220913, US-A1-2003220913, US2003/0220913A1, US2003/220913A1, US20030220913 A1, US20030220913A1, US2003220913 A1, US2003220913A1
InventorsYurdaer Doganata, Youssef Drissi, Lev Kozakov
Original AssigneeInternational Business Machines Corporation
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Techniques for personalized and adaptive search services
US 20030220913 A1
Abstract
Techniques are presented for automatically selecting information sources that are most relevant to user queries. Results of searches returned by information sources for queries are analyzed and the information sources are ranked based on this analysis. The information sources that have high rankings for a query are subsequently used to search for relevant results. This process can be adaptive, as the returned results of old queries can be analyzed at a later date to update the ranking of the information sources, automatic searches can be performed to update the ranking of the information sources, new queries can be used for analysis and stored, new information sources added, and old information sources deleted. A linguistic library is used to store personal categories for one or more users. and general categories. Each category is associated with keywords and ranked lists of information sources. The library also contains general categories, taxonomies, and dictionaries.
Images(8)
Previous page
Next page
Claims(19)
What is claimed is:
1. A method, comprising:
sending a query to a plurality of information sources; and
ranking the information sources based on scores for results returned by the plurality of information sources.
2. The method of claim 1, wherein the step of ranking further comprises the steps of:
receiving the results from each of the plurality of information sources; and
determining the scores for the results.
3. The method of claim 2, wherein the query comprises at least one keyword.
4. The method of claim 3, wherein the step of determining the scores farther comprises the steps of:
determining a quality measure for each keyword;
determining a quantity measure for each keyword; and
determining a score for each keyword based on the quality measure and the quantity measure.
5. The method of claim 4, wherein the step of determining a quality measure further comprises the steps of:
determining how many times each keyword appears in each document accessible through the results from one of the information sources;
determining how many documents are accessible through the results from one of the information sources; and
dividing the number of times each keyword appears by the number of documents to determine the quality measure.
6. The method of claim 5, wherein the step of the step of determining the scores for the results further comprises the steps of:
repeating the steps of determining a quality measure, determining a quantity measure, and determining a score for each keyword for each keyword and each information source; and
determining source scores for each source by adding the scores for each keyword.
7. The method of claim 6, wherein the step of ranking the information sources further comprises the step of using the source scores to rank the information sources.
8. The method of claim 1, further comprising the steps of:
storing the rankings for the information sources;
storing the query; and
performing the steps of sending a query and ranking the information sources for the stored query.
9. The method of claim 8, wherein a user enters the query.
10. The method of claim 8, wherein:
the step of storing the query further comprises the step of storing a plurality of queries;
the step of storing the rankings for the information sources further comprises the step of storing a set of rankings for each of the queries;
the method further comprises the step of selecting a query; and
the step of performing the steps of sending a query and ranking the information sources for the stored query further comprises the step of performing the steps of sending a query and ranking the information sources for the selected query.
11. The method of claim 1, further comprising the steps of:
receiving a user request;
associating the user request with at least one keyword; and
creating the query from the at least one keyword.
12. The method of claim 11, wherein the step of associating the user request further comprises the step of determining whether a word or words in the user request matches one or more descriptions, each description corresponding to a category.
13. The method of claim 12, wherein the word or words in the user request do match with one or more descriptions and wherein the step of associating the user request further comprises the step of associating one or more keywords, corresponding to the category or categories having descriptions matching the one or more words, with the user request.
14. The method of claim 12, wherein the word or words in the user request do not match with one or more descriptions and wherein the step of associating the user request further comprises the steps of:
using a dictionary to determine an additional word or additional words associated with the word or words; and
associating one or more keywords, corresponding to the category or categories having descriptions matching the one or more words, with the user request.
15. The method of claim 11, further comprising the steps of:
providing the at least one keyword to the user.
16. The method of claim 11, wherein the step of associating the user request further comprises the step of using a user specific taxonomy to associate the user request with the at least one keyword.
17. The method of claim 11, wherein the user request comprises one or more of the followings: a description of a category and one or more words of a user query.
18. An apparatus comprising:
one ore more memories that store computer-readable code; and
one or more processors operatively coupled to the one or more memories, the one or more processors configured to implement the computer-readable code, the computer-readable code configured to:
send a query to a plurality of information sources; and
rank the information sources based on scores for results returned by the plurality of information sources.
19. An article of manufacture comprising:
a computer-readable medium having computer-readable code means embodied thereon, said computer-readable program code means comprising:
a step to send a query to a plurality of information sources; and
a step to rank the information sources based on scores for results returned by the plurality of information sources.
Description
FIELD OF THE INVENTION

[0001] This invention relates to searching for information over a computer network, and, more specifically, the invention relates to techniques for personalized and adaptive search services.

BACKGROUND OF THE INVENTION

[0002] Computer networks used for knowledge searching and retrieval are well known. For example, see U.S. Pat. No. 5,873,080 to Coden et al., issued on Feb. 16, 1999; U.S. Pat. No. 5,875,446 to Brown et al., issued on Feb. 23, 1999; U.S. Pat. No. 5,913,208 to Brown et al., issued Jun. 15, 1999; and U.S. Pat. No. 5,819,265 to Ravin et al., issued on Oct. 6, 1998, the disclosures of which are hereby incorporated by reference. In all of these patents, a primary purpose is to provide better methods to retrieve relevant documents in response to user queries.

[0003] In order to improve relevancy, information is categorized into groups of subjects. The categorization of the text documents is one of the most effective methods to help users organize information. In general, the content of the text document is analyzed to determine the words and phrases that contribute to the context of the document. The document is then associated, based on the context and content, to one or more categories of a given taxonomy. Once the document is associated with a category of a taxonomy, the users can easily navigate within the taxonomy of their interest to find relevant information. The “Yahoo!” search Web site is designed based on this concept of categorization. Each document is listed under one category or subcategory.

[0004] Once the information is categorized based on a taxonomy, the users can narrow their search scope within a category or subcategory. This way they can increase the relevance of the documents that they retrieved. Today, most search Web sites are based on this principle.

[0005] The context of the query in general is very important to be able to return the relevant results. As an example, if the word Java is used with the context of a coffee type, then this information must be communicated to the search engine. Otherwise, the search engine would return results out of context such as references to a computer language or a germ or a lyric. One way to associate a context to a query is to look at a user profile. A user profile contains a set of categories or a taxonomy that identifies user interests. When the user forms a query, it can be associated to one or more categories, which helps to determine and possibly expand the context of the query.

[0006] The amount of information published over the Internet grew so rapidly that it became very difficult to find the information. In order to make the searching of Internet content more practical, categorization of the Web content was proposed. The unstructured Web content was categorized by using specific taxonomies. Today, for many search engines, users are expected to know and select the category for the information that they look for. In general, the categories are organized in a tree structure. There are seven to 15 main categories, such as Art, Business, Computers, Education, Entertainment, and the other subcategories are organized under these main categories. In order to cover the information space properly, seven to 15,000 subcategories were proposed.

[0007] For a user who has a very specific area of interest, these categories are less than useful at times. For instance, a category that is useful to a particular user may be either too specific to belong to a general taxonomy or will make navigation difficult for the user, as the user might have to navigate through much of a taxonomy tree. As an example, the category “Think Pad Model 600” is a very specific category which is not part of a general taxonomy. One other problem of generalized taxonomy trees is the fact that these trees are ever growing and constantly need pruning. Consequently, new categories are added in time, and old categories are deleted. Users are expected to keep up with the changing taxonomy trees as they perform their searches. Yet another problem is that not all users are familiar with the categorization scheme. It takes an effort on behalf of the users to navigate through the taxonomy tree and find the information searched for within that category. This can cause, among other problems, a lack of returned information.

[0008] Metasearch systems help to alleviate the problem of insufficient returned information. A metasearch system is not a search engine but a system that merges results from a multitude of search engines. Thus, in the case of metasearch systems, a query is sent to a multitude of information sources and the results are grouped and merged. While a metasearch system retrieves more information, at the same time, the amount of returned information can be overwhelming.

[0009] Therefore, a need still exists for allowing users to search through a massive amount of information, yet provide users with more meaningful results than currently presented to the user when searching for information.

SUMMARY OF THE INVENTION

[0010] Aspects of the present invention improve upon conventional information search techniques by automatically selecting information sources that are most relevant to user queries. This is done by analyzing results of searches returned by information sources for queries and by ranking the information sources based on this analysis. The information sources that have high rankings for a query are subsequently used to search for relevant results for that query. In other words, information sources can be selected based on their rankings for a particular query. This process can be adaptive, as the returned results of old queries can be analyzed at a later date to update the ranking of the information sources, automatic searches can be performed to update the ranking of the information sources, new queries can be used for analysis and stored, new information sources added, and old information sources deleted.

[0011] Additionally, aspects of the present invention use an electronic library, referred to as a “linguistic library” herein, that is useful for storing personal categories for one or more users. Each personal category is associated with corresponding keywords and ranked lists of information sources. The personal categories help to expand a user query and to relate a user query to the ranked information sources. The library can also contain general categories, taxonomies, and dictionaries used to help broaden and interpret user queries. A user can interact with the linguistic library to select an appropriate modified query that is based on his or her original query and includes information determined from the linguistic library. Alternatively, the user can submit his or her original query.

[0012] A more complete understanding of the present invention, as well as further features and advantages of the present invention, will be obtained by reference to the following detailed description and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0013]FIG. 1 is a block diagram of an exemplary personalized and adaptive search service, in accordance with one embodiment of the present invention;

[0014]FIG. 2 is a block diagram of an exemplary personal query manager interacting with a linguistic library and a user, in accordance with one embodiment of the present invention;

[0015]FIG. 3 is a block diagram of an exemplary table of personal categories, in accordance with one embodiment of the present invention;

[0016]FIG. 4 is an exemplary method performed by an information source analyzer for determining keyword scores that are then used to rank information sources, in accordance with one embodiment of the present invention;

[0017]FIG. 5 is a representation of how information sources are scored and ranked by the information source analyzer, in accordance with one embodiment of the present invention;

[0018]FIG. 6 is an exemplary chart used to illustrate the source ranking shown in FIG. 5; and

[0019]FIG. 7 is an exemplary computer system suitable for implementing a personalized and adaptive search service, in accordance with one embodiment of the present invention.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

[0020] The present invention allows a user query to be categorized into a number of categories, where each category is associated with a ranked list of information sources. The categories effectively allow a user query to be “expanded” into a number of keywords that can be used as query terms. The categories also allow a user to navigate information instead of or in addition to writing his or her own user query. The categories, in one aspect of the invention, also contain a ranked list of information sources. To rank the information sources, a query that comprises a number of keywords is sent to each information source. The set of returned results from an information source is used to determine a ranking. The ranking is then used to search specific information sources with a user query that corresponds to the category. Generally, a specific user query is sent to only the highest ranking information sources. However, the user has the ability to override this. The results presented to the user generally come from a subset of all the information sources.

[0021] In one embodiment, there are personal and general categories. The personal categories are entered through interaction by the user with a linguistic library, and generally when the user is performing his or her searches. The general categories are categories that are pre-loaded. The general categories thus provide a user with an already available source of query terms for many queries.

[0022] In one embodiment of the invention, new user queries are generated, information sources are queried, and information sources are ranked based results returned against new user queries. The ranking in this embodiment is performed “offline,” so that the user experiences no slow down in functionality. The new user query may be based on a previously entered user query, which is given its own personal category or is related to a general category. If the user enters a user query that has no corresponding category, then it is beneficial to associate a category to the query. Once a category is associated with the query, then the corresponding keywords and the ranked list of information sources are also associated with the query. A linguistic library is used to find associated categories for queries that are not already categorized. Users may choose to interact with the linguistic library to determine the personal or general category of a query. The linguistic library may return one or more personal or general categories in order for the query to be categorized. This is done by using dictionaries specific to the domain of interest. The user may decide which category is the most appropriate. Optionally, the user may decide to send his or her original query, without any data from the linguistic library. In this situation, in one embodiment of the present invention, the query is treated as a metasearch and results are returned from all information sources.

[0023] Ranking the information sources generally takes place offline, as retrieving and ranking documents can take a measurable amount of time and may interfere with the speed experienced by the user. Additionally, if a user has added keywords to a category or modified a category in some other way, it is beneficial to again query the information sources and again determine rankings for the information sources. Furthermore, queries may be generated automatically from the keywords that represent a category to determine the rank of an information source. The keywords are sent to information sources and the returned results are analyzed for rankings. Each category is associated with a number of keywords, and the query is determined from the keywords corresponding to the category. Categories may be added, deleted, or modified, and information sources may be added, deleted, or modified.

[0024] The present invention overcomes a problem with metasearch systems. As explained previously, a metasearch system sends a query to a multitude of information sources and the results are grouped and merged. The results are either arranged based on the original scores of the documents or are grouped based on the search engine. If the relevance of these information sources and their categories to the query is not known, the returned results are usually not satisfactory. By ranking the information sources, the present invention has the ability to return a higher percentage of relevant documents to the user in a faster fashion. In other words, embodiments of the present invention can determine that several information sources return more relevant documents. If these information sources are searched first, then the results placed highest in a list of returned documents will generally be more pertinent than the results obtained by the metasearch system.

[0025] Additionally, the arrangement by original scores, where an “original score” is a score an information source gives to a document, is not effective as it could be. In particular, original scores are based on scoring systems from each of the information sources. As many information sources use different document ranking schemes, then uniformity of scoring is not guaranteed. For instance, a document given a score of “90” by one information source may be only given a score of “50” by another document source. Moreover, as the information sources themselves are not ranked by a metasearch system, there is generally wasted effort. In particular, if it is known, using the techniques of the present invention, that three information sources give excellent results for a particular query, then sending a query to information sources other than the three information sources could be considered wasted effort, as the results from the other sources are likely to be less relevant.

[0026] The user generally will be given the ability to control how results are viewed. The results could be viewed on one window by ranked information sources or by using rankings, provided by each information source, for pages within the returned results from the sources, or could be viewed so that each ranked source is in a separate window. There are additional options known to those skilled in the art.

[0027] Turning now to FIG. 1, a personalized and adaptive search service 100 is shown interacting with a variety of information sources 180-1 through 180-N (collectively, information sources 180) and interacting with a user 103 through user interface 105. Personalized and adaptive search service 100 comprises a personal query manager 110, a query generator 120, adapter interface 130, document retriever 140, document analyzer 150, information source analyzer 160, linguistic library 170, and personal query manager 110. Adapter interface 130 comprises a number of adapters 135-1 through 135-K (collectively, adapters 135). It should be noted that the blocks that are shown in FIG. 1 are demarcated as such merely for exposition. The blocks themselves may be combined or even further divided, through techniques known to those skilled in the art. For instance, the blocks information source analyzer 160 and document analyzer 150 may be combined into a single functional equivalent of the two blocks.

[0028] Information sources 180 are any type of information sources available, such as Internet databases, Internet search engines, or public or private databases. Any electronic repository of information that can be searched by sending a query and receiving a response can be an information source 180.

[0029] User 103 interacts with personalized and adaptive search service 100 through user interface 105. User interface 105 can comprise a monitor, keyboard, mouse, and other devices suitable for interacting with a computer system. In this embodiment, the personalized and adaptive search service 100 is a computer system or perhaps a server that the user interface 105 interacts with through a networked computer or a dumb terminal. Additionally, the user interface 105 may comprise a hand-held computer, Personal Digital Assistant (PDA), or cellular phone that access the personalized and adaptive search service 100 through a radio frequency network interface or hardwired network interface. Additionally, personalized and adaptive search service 100 may reside in a PDA or the like. User interface 105 can comprise any device suitable for communicating information from a user to a computer system.

[0030] In one embodiment of the present invention, there are two basic modes of operation for personalized and adaptive search service 100: an “online” mode and an “offline” mode. In the online mode, a user 103 creates requests 106 and receives results 143 through the user interface 105. In this mode, the requests 106 can be expanded by the linguistic library 170 to include additional keywords and search terms (not shown) and include a ranked list (not shown) of information sources 180 to use. The ranked list can include rankings of all of the information sources 180 or optionally only a number of the highest ranking information sources 180. The number of highest ranking information sources 180 can be user selectable. Additionally, the ranked list can be passed to personal query manager 110, which can then determine, through user preferences or other criteria, how many of the information sources 180 are selected. Generally, this selection will be done on ranking, so that a number of highest ranking information sources 180 are used, but other criteria, such as Internet download speeds, could be used. Moreover, the user 103 can enter in a request 106 and the personal query manager 110 can, by accessing linguistic library 170, determine an expanded query 171 based on information in the linguistic library 170. This expanded query is shown to the user through feedback 107. The user can accept this expanded query, modify it, or use the original query. Thus, feedback 107 provides an opportunity for the user to interact with the personal query manager 110 and linguistic library 170.

[0031] In the offline mode, the personalized and adaptive search service 100 will communicate a number of queries to the information sources 180 and will then rank the information sources 180. The queries sent to the information sources 180 are the keywords associated with different categories stored in linguistic library 170. This way, a ranked list of relevant information sources 180 are obtained for each category. This offline mode can be adaptive, as the linguistic library 170 can automatically send keywords corresponding to categories to the personal query manager 110, which then provides queries, through personalized and adaptive search service 100, to information sources 180. The returned results from searches on the information sources 180 can then be ranked and the rankings stored in linguistic library 170.

[0032] In the present specification, it will be assumed that personalized and adaptive search service 100 has both offline and online modes, although it should be understood that these modes can be combined into a single mode where information sources are ranked with each query of one or more information sources 180.

[0033] In the online mode, the user 103 sends a user request 106, through user interface 105, to the personal query manager 110. The user request 106 contains a description of a category or topic that the user is interested in, a user query, or both. Descriptions of categories and the categories themselves are stored in linguistic library 170, which is described below in more detail in reference to FIGS. 2 and 3. Generally, the user 103 will be using a Graphical User Interface (GUI) in the user interface 105, which will allow the user 103 to type in a user query or a description of a category, or select a category. Categories are used to determine the context of a query. For instance, if a user query, in request 106, is “Java,” it is sent to the linguistic library 170 for further analysis. The linguistic library 170 may have multiple categories associated with the query “java,” such as “computer language,” “islands of Indonesia,” “types of coffee.” If the user has previously used this query within the context of “computer language,” then only “computer languages” is returned as the category. Otherwise, the user is asked to select from multiple categories and his selection is stored in his personal profile in 170.

[0034] The personal query manager 110 takes the request 106 and generates a modified query 111 from input from the linguistic library 170. The linguistic library 170 uses the request 106 and, through techniques described in more detail in reference to FIG. 2, expands the request 106 into an expanded query 171. Modified and expanded queries are discussed in more detail below.

[0035] If the request 106 is already associated with one of the personal or general categories that are stored in the linguistic library 170, then the query generator 120 sends a query to a certain number of information sources 180. Generally, only a number of the highest ranking information sources 180 are used to perform the search. However, it is possible to send the query to all of the information sources 180 and then use the ranking for each of the information sources 180 to determine which results are displayed or the order in which results are displayed. The document retriever 140 retrieves the results, performs any formatting or other modifications, and sends the formatted results 143 back to the user 103 through user interface 105.

[0036] In order to retrieve relevant results, a user query is associated with a category. If there is a match between a user query and a category, then the keywords associated with the category are used to search. If there is no match, then the user interacts with the linguistic library 170 to determine an appropriate category. The details of generating query terms specific to a user category are discussed in reference to FIG. 2. If an appropriate category, either a user category or a general category, does not exist, then the personalized and adaptive search service 100 acts like a metasearch device, in that personalized and adaptive search service 100 sends the user query to each of the information sources 180 and returns the results to the user 103 through returned results 143. Additionally, the user may choose to not interact with information sources 180 or may choose to have the personalized and adaptive search service 100 act as a metasearch device, regardless of whether or not an appropriate category can be found.

[0037] In offline mode, personalized and adaptive search service 100 operates as follows. The personal query manager 110 will send a number of queries to the information sources 180. Each query generally comprises, as shown more particularly in FIG. 3, one or more keywords. A query is sent to the query generator 120, which performs formatting specific to each of the information sources 180. Some information sources 180 may allow character strings to be sent to them as queries; other may require a specific format. The query generator 120 performs any needed formatting. Thus, the query generator 120 might create several different final queries 121, which are then directed to the appropriate information sources 180.

[0038] Adapters 130 is a central location used to store a number of adapters 135. Each adapter 135 is adapted to interact with one or more information sources 180. Each adapter 135 performs low level communication with an information source 180. For example, the adapter 135-1 could be an adapter for use with a database on the Internet, and the adapter 135-1 would open and close communications with the information source 180 using protocols specific to the information source 180. Usually, there will be fewer adapters 135 than information sources 180, as many information sources 180 will use the same protocols. In the example of FIG. 1, there are K adapters 130 and N information sources 180, where K<N. Additionally, there could be an adapter 135 that exists but no information source 180 that corresponds to it.

[0039] Each final query 121 is transmitted, through adapters 135 to the N information sources 180. Each information source 180 returns results 136. The document retriever 140 keeps track of the results. In particular, the document retriever 140 catalogs results from each of the information sources 180. The cataloging by the document retriever 140 includes, in one embodiment, for each document, a title and a Uniform Resource Locator (URL). Any technique for allowing a system to access the document may be used by the document retriever 140. Additionally, the number of documents returned by each information sources 180 is retained. This information is sent to the document analyzer 150 as returned results 141. These returned results may be stored for later analysis, which is used to update the rankings of the information sources. In online mode, this information is also sent to the user as returned results 143.

[0040] Generally, the returned results 141, 143 will be a list of HyperText Transfer Protocol (HTTP) addresses, possibly along with titles, brief descriptions, and other information. For instance, an exemplary list of three entries in a returned results 141, 143 for the query “java and program and language” could be the following:

[0041] 1. “Language Basics,” http://java.sun.com/docs/books/tutorial/java/nutsandbolts/

[0042] 2. “Essentials of the Java (TM) Programming Language, Part 1,” http://developer.java.sun.com/developer/onlineTraining/Programming/BasicJaval/

[0043] 3. “Java-Webopedia.com,” http://www.webopedia.com/TERM/J/Java.htm In the above returned results, the titles are “Language Basics,” “Essentials of the Java (TM) Programming Language, Part 1,” and “Java-Webopedia.com.” The HTTP addresses corresponding to these titles follow the titles. Document retriever 140 will generally send complete entries in the returned results 143 to the user 103. In other words, the entire entry, including title, HTTP address, and any other information, will be sent.

[0044] It is also possible for the returned results 141, 143 to include the documents themselves, instead of HTTP addresses. It should also be noted that the returned results 141, 143 can include scores created by the information sources 180.

[0045] The document analyzer 150 analyzes the documents by determining a score for each document. The query is used to determine the score for a document. The score is determined through techniques known to those skilled in the art. Such techniques are described in Selberg, “Towards Comprehensive Web Search,” Ph.D. Dissertation, University of Washington (1999); Howe and Dreilinger, “Savvy-Search: A Meta-Search Engine that Learns which Search Engine to Query,” AI Magazine, 18(2) (1997); Lawrence and Giles, “Inquirus, the NECI meta search engine,” Seventh Int'l World Wide Web Conference, Australia, 95-105 (1998), the disclosures of which are hereby incorporated by reference. By using a single technique to score documents for each of the information sources 180, there is uniformity of scoring for each of the information sources 180. For instance, it is possible to use scores from the information sources 180 themselves to perform the scoring. However, the techniques used to score documents for each information source 180 will likely differ, and some information sources 180 may not use any scoring mechanisms. Thus, using the same technique to score each document provides uniform scoring. It should be noted that two or more techniques may be used to score documents, and scores from each technique can be combined, such as through an average. However, each technique can take a measurable and sometimes substantial amount of time. Consequently, using only one technique is suitable for most applications.

[0046] The document analyzer 150 sends data 151 about an information source to information source analyzer 160. The data 151 comprises a list of document scores and a total number of returned documents for each information source 180. Information source analyzer 160 analyzes the scores and total number of returned documents and ranks sources. Exemplary analysis techniques are described below in more detail in reference to FIGS. 4 through 6. The information source analyzer 160 sends the ranked list 161 of information sources 180 to the linguistic library 170, along with the associated query and category. When the linguistic library 170 receives the ranked list of information sources 180 through link 161, the linguistic library 170 updates the category with the ranked list 161 of information sources 180, as described below in reference to FIG. 3.

[0047] Thus, in offline mode, the personalized and adaptive search service 100 ranks A information sources 180 so that future requests 106 by a user will be transmitted, in online mode, to more appropriate information sources 180. The personalized and adaptive search service 100 identifies the most relevant information sources 180 for most, if not all, requests 106 by a user.

[0048] Although reference numerals 106, 107, 111, 112, 121, 136, 141, 151, 161, and 171 have been primarily described by the data passing through these “links,” it is not necessary to have any type of hardware implementation for these links. For instance, link 161 simply indicates that data is passed between modules. The actual link 161 could simply be a reference to an object or memory location, as is known in the art. Any mechanism suitable for passing data may be used as a link. Moreover, multiple types of data can pass through any link.

[0049] It should be noted that personalized and adaptive search service 100 could be implemented as a “plug in” to a browser or similar software. In this configuration, the personalized and adaptive search service 100 would operate largely at a remote site out of sight for most users.

[0050] Before turning to FIG. 2, it is worthwhile to provide an example. If a user enters the request 106 of “java,” then, as discussed above, the personal query manager 110 will access the linguistic library 170 to determine if there are any suitable categories for this request 106. The user 103 can then be presented with categories such as “computer language,” “islands of Indonesia,” and “types of coffee.” If the user 103 select “computer language,” the fact that the user selected this category and not another category may be stored in linguistic library 170, particularly in the user profile/preferences (described below). Once the user selects a category, the linguistic library 170 will provide keywords associated with that category. Alteratively, the keywords could be provided at the same time as the categories are provided. The keywords could include, for example, “java,” “program” “language,” and “computer.”

[0051] These keywords are sent to personal query manager 110, which allows the user 103 to modify or add to these keywords, if desired. It will be assumed, for sake of simplicity, that the user 103 does not modify the keywords. The keywords are sent to the query generator 120, which then formats one final query 121 as “java program language computer,” where the boolean operation “and” or “or” is assumed to occur between words. Another final query 121 may be formatted by query generator 120 as “java and program and language and computer.” Each of these final queries 121 is directed to an appropriate adapter 135, which then directs the final query to one or more information sources 180. Results 136 are returned to document retriever 140, which collects the results 136, organizes them by source (if desired), and sends them to user 143.

[0052] If the user decides to not select a category and just sends the request 106 as “java,” then this query is passed through the personal query manager 110, to the query generator 120, which performs any needed formatting, through the adapters 135 and to the information sources 180. Results 136 are passed through document retriever 140, which collects and organizes the results per information sources 180 and then sends the organized result list on link 143.

[0053] During offline mode, the linguistic library 170 will pass keywords for each of the categories “computer language,” “islands of indonesia,” and “types of coffee” to the personal query manager 110, which will forward each set of keywords to query generator 120, which then formats each query appropriately for the adapters 135. The adapters 135 send the queries to the appropriate information sources 180, which return results 136. The document retriever 140 determines how many results are returned for each information sources 180 and catalogs the results. This data is sent through link 141 to document analyzer 150, which analyzes the documents and scores the relevancy of the documents. The total number of returned documents for each information sources 180 and scores are sent to information source analyzer 160, which determines rankings of the information sources 180 for each of the queries.

[0054] Referring now to FIG. 2, a portion of FIG. 1 is shown in greater detail. Personal query manager 110 comprises a request handler 210, a search utility 220, and a query interface generator 215. The linguistic library 170 comprises one or more tables of general categories 235, user specific taxonomies 240, table of personal categories 245, and dictionaries 250.

[0055] A user request 106, which could be a user category description, category, or query, is sent to request handler 210. The request 106 is received by the request handler 210, which parses the user description and sends the parsed terms to the linguistic resources library 170 via search utility 220 and link 112. The search utility 220 finds the related terms and categories associated with the description or query in the request 106 as well as the most relevant information sources 180 that should be searched against the request 106. Additionally, the search utility 220 can find personal preferences stored in user profile/preferences 255. A search of the general categories 235 yields categories that have the same keywords or description as the user request 106. User specific taxonomies 240 are classifications specific to the user. A search of these will yield classifications used to broaden the request 106. A dictionary 250 provides definitions that may be used to broaden the request 106 or used to associate categories with the user request 106. It should be noted that a dictionary can contain thesaurus information. A table suitable for general categories 235 and personal categories 245 is shown in FIG. 3.

[0056] If the search by the search utility 220 returns at least one category and associated information sources 180, then this information is used to retrieve relevant documents. The linguistic library 170 generates terms related to the request 106 and returns the terms back to the personal query manager 110 through link 171. An expanded query is created by search utility 220 and linguistic library 170 and terms for the expanded query, or the expanded query itself, are passed through link 171 and shown to the user through link 107. At this point, user 105 may choose to modify these terms before they are submitted to the query generator 120. The final version of the keywords and query terms 115 are then submitted to the query generator 120, through query generator interface 215, where the adapters 170 are invoked to submit multiple search requests to various information sources 180 simultaneously. The query generator interface 215 sends keywords, or other terms determined from linguistic library 170, to the query generator 120.

[0057] Referring now to FIG. 3, an exemplary table of categories 300 is shown. The table of categories 300 may be the table of general categories 235 or the table of personal categories 245. As noted above, the personalized and adaptive search service 100 generally will come with a number of categories in the table of general categories 235, and the user (or users) can add his or her own additional categories in the table of personal categories 245. FIG. 3 shows the structure of a table to be used to store and retrieve categories and associated keywords and information sources. In table of categories 300, the first column 305 is for the textual description of the user category, the second column 310 is for the array of keywords that are associated with the category description, and the last column 315 is for the list of information sources that are sorted based on their rank and related to the category described in the first column. Category 320 corresponds to L keywords 325 and ranked list 330; category 335 corresponds to M keywords 340 and ranked list 345; and category 350 corresponds to P keywords 355 and ranked list 360. In the example of FIG. 3, there are Z categories.

[0058] The user queries and descriptions are first checked against the table of personal categories 245 and the table of general categories 235. If there exists a category, in either of these tables, that is found when compared to a user query or description, then associated information sources in a corresponding ranked list 315 are used to retrieve information. Otherwise, a new category is created in the table of personal categories 245 by querying the user as to the textual description of the category and populating another row in the table. The keywords 310 for the new row in the table of personal categories 245 come from the table of general categories 235 and dictionary 250. The dictionary is used to determine words related to the newly added textual description of the category. These words are then used to determine similar categories in the table of general categories 235, and the keywords for the similar categories from table of general categories 235 are added to the table of personal categories 245 as keywords. The newly added keywords are generally shown to the user, who can then determine to add, delete, or modify the keywords.

[0059] In the example of FIG. 3, each ranked list 315 of information sources 180 is in order of information source and not ranking. However, the list may be placed in order of ranking if desired. One benefit to having the ranked lists 315 ordered in order of information source is that it is easier to remove or add sources.

[0060] There are multiple ways of ranking information sources 180. One possible way of ranking the information sources 180 is based on the number of documents returned from each information source 180. The information source 180 that returns more documents is ranked higher than other information sources 180 that return less number of documents. As an example, source A that returns 100 documents on one subject is ranked higher than source B that returns 50.

[0061] However, the relevance of the returned documents is important. Another ranking policy that takes relevancy into consideration works as is shown in FIG. 4. Broadly, each document is assigned a relevance score by the source. During the ranking process of method 400, a keyword score for a particular keyword can be calculated based on a formula which defines the keyword score as the linear combination of the number of documents and their mean relevancy. Method 400 determines a keyword score for each keyword and should be run once for each keyword and information source 180.

[0062] Method 400 begins in step 405, when an index and a total score are set to zero. In step 410, the index is incremented. In step 415, a score of the current document is determined. This score is determined for a particular keyword or query. Generally, the information source analyzer 160 performs method 400 and will simply retrieve the score for the document. In other words, the score has already been determined by the document analyzer 150 for the keyword and the information source analyzer 160 just retrieves the score. Alternatively, it is possible to have the document analyzer 150 determine the score in step 415 and have the document analyzer 150 provide the score to information source analyzer 160. It is also possible to have the information source analyzer 160 determine the score, if desired.

[0063] In step 420, the current score for the keyword is added to the total document score. In step 425, it is determined if there are more documents. If there are more documents, the method 400 continues in step 410, otherwise step 430 is performed. The loop of steps 410 through 425 will create a total document score that is a linear addition of all of the scores for documents that contain a keyword and that are from a single source.

[0064] In step 430, an average document score is created for the information source by dividing the total score by the number of documents returned. A measure of quality is determined in step 435 using the following formula:

[0065] a*average document score,

[0066] where “a” is a constant. A measure of quantity is determined in step 440 by using the following formula:

[0067] b*number of documents returned,

[0068] where “b” is another constant. The constants a and b are to be determined depending on the importance of quality or the quantity. If the quality (i.e., relevance) is not important, then b=0; on the other hand, if the quantity (i.e., number of documents) is not important, then a=0. The values of a and b can be determined by users as part of their profile. Here, it is assumed that the document scores retrieved from different sources are normalized. In step 445, a keyword score is determined by the following equation: Keyword Score = ( Measure of Quality ) + ( Measure of Quantity ) , or = a * average document score + b * number of documents returned

[0069]FIG. 5 shows a representation of how information sources are scored and ranked. The information source A is scored based on all the keywords that represent the category of choice. In this example, there are four keywords, keyword, through keyword4, for the category being examined. The scores of source A are 50, 76, 55 and 20, for the four keywords, respectively. Each score is determined through method 400. Hence, the total score of source A is 201, which is a simple addition of each of the keyword scores, that ranks this source as the 3rd after source B and D. The rank is determined from the source scores; the higher the score, the lower the rank in this example (i.e., lower scores are better).

[0070] More complex analyses may be used in the techniques described in FIG. 5. For instance, weighting may be applied to the scores of each keyword, such that one keyword could be weighted higher than another. Any technique for determining an overall score for a query having keywords may be used.

[0071]FIG. 6 shows a representation of scoring of the sources. It should be noted that the scores themselves may be used as the ranking of the information sources.

[0072] Turning now to FIG. 7, a block diagram is shown of a computer system 700 for performing the methods and techniques of a personalized and adaptive search service 100 in accordance with one embodiment of the present invention. Computer system 700 is shown interacting with a Digital Versatile Disk (DVD) 760 and a computer network. Computer system 700 comprises a processor 710, a memory 720, a network interface 730, a media interface 740 and a peripheral interface 750. Network interface 730 allows computer system 700 to connect to a network, while media interface 740 allows computer system 700 to interact with media such as a hard drive or DVD 760. Peripheral interface 750 is an interface that interacts with monitors, mice, keyboards, and other devices to enable human interaction with computer system 700.

[0073] As is known in the art, the methods and apparatus discussed herein may be distributed as an article of manufacture that itself comprises a computer-readable medium having computer-readable code means embodied thereon. The computer-readable program code means is operable, in conjunction with a computer system such as computer system 700, to carry out all or some of the steps to perform the methods or create the apparatuses discussed herein. The computer-readable medium may be a recordable medium (e.g., floppy disks, hard drives, optical disks such as DVD 760, or memory cards) or may be a transmission medium (e.g., a network comprising fiber-optics, the world-wide web, cables, or a wireless channel using time-division multiple access, code-division multiple access, or other radio-frequency channel). Any medium known or developed that can store information suitable for use with a computer system may be used. The computer-readable code means is any mechanism for allowing a computer to read instructions and data, such as magnetic variations on a magnetic medium or height variations on the surface of a compact disk, such as DVD 760.

[0074] Memory 720 configures the processor 710 to implement the methods, steps, and functions disclosed herein. The memory 720 could be distributed or local and the processor 710 could be distributed or singular. The memory 720 could be implemented as an electrical, magnetic or optical memory, or any combination of these or other types of storage devices. Moreover, the term “memory” should be construed broadly enough to encompass any information able to be read from or written to an address in the addressable space accessed by processor 710. With this definition, information on a network, accessible through network interface 730, is still within memory 720 because the processor 710 can retrieve the information from the network. It should be noted that each distributed processor that makes up processor 710 generally contains its own addressable memory space. It should also be noted that some or all of computer system 700 can be incorporated into an application-specific or general-use integrated circuit.

[0075] It is to be understood that the embodiments and variations shown and described herein are merely illustrative of the principles of this invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7209915 *Jun 28, 2002Apr 24, 2007Microsoft CorporationMethod, system and apparatus for routing a query to one or more providers
US7272597Dec 29, 2004Sep 18, 2007Aol LlcDomain expert search
US7349896Dec 29, 2004Mar 25, 2008Aol LlcQuery routing
US7379949Jul 1, 2005May 27, 2008Aol LlcAnalyzing a query log for use in managing category-specific electronic content
US7562069Dec 29, 2004Jul 14, 2009Aol LlcQuery disambiguation
US7568148 *Jun 30, 2003Jul 28, 2009Google Inc.Methods and apparatus for clustering news content
US7571157Dec 29, 2004Aug 4, 2009Aol LlcFiltering search results
US7577655 *Sep 16, 2003Aug 18, 2009Google Inc.Systems and methods for improving the ranking of news articles
US7584177Jun 29, 2005Sep 1, 2009Google Inc.Determination of a desired repository
US7617193 *Oct 26, 2006Nov 10, 2009Elan BitanInteractive user-controlled relevance ranking retrieved information in an information search system
US7620628 *Dec 6, 2004Nov 17, 2009Yahoo! Inc.Search processing with automatic categorization of queries
US7693825 *Mar 31, 2004Apr 6, 2010Google Inc.Systems and methods for ranking implicit search results
US7707142 *Mar 31, 2004Apr 27, 2010Google Inc.Methods and systems for performing an offline search
US7725463 *Jun 30, 2004May 25, 2010Microsoft CorporationSystem and method for generating normalized relevance measure for analysis of search results
US7788274Jun 30, 2004Aug 31, 2010Google Inc.Systems and methods for category-based search
US7801911 *Jun 11, 2004Sep 21, 2010Seisint, Inc.System and method for using activity identifications in a database system
US7809740Mar 29, 2006Oct 5, 2010Yahoo! Inc.Model for generating user profiles in a behavioral targeting system
US7814109 *Mar 29, 2006Oct 12, 2010Yahoo! Inc.Automatic categorization of network events
US7818314Dec 29, 2004Oct 19, 2010Aol Inc.Search fusion
US7818323 *Feb 21, 2008Oct 19, 2010International Business Machines CorporationDiscovering topical structures of databases
US7822734 *Dec 12, 2006Oct 26, 2010Yahoo! Inc.Selecting and presenting user search results based on an environment taxonomy
US7831581 *Feb 28, 2005Nov 9, 2010Radix Holdings, LlcEnhanced search
US7836044 *Jun 22, 2004Nov 16, 2010Google Inc.Anticipated query generation and processing in a search engine
US7860861 *Aug 10, 2005Dec 28, 2010Sony CorporationInformation processing apparatus, information processing method, and program for the same
US7873650Jun 11, 2004Jan 18, 2011Seisint, Inc.System and method for distributing data in a parallel processing system
US7904448Mar 29, 2006Mar 8, 2011Yahoo! Inc.Incremental update of long-term and short-term user profile scores in a behavioral targeting system
US7917519 *Oct 25, 2006Mar 29, 2011Sizatola, LlcCategorized document bases
US7953725Nov 19, 2004May 31, 2011International Business Machines CorporationMethod, system, and storage medium for providing web information processing services
US8005813 *Sep 12, 2007Aug 23, 2011Aol Inc.Domain expert search
US8010523Dec 30, 2005Aug 30, 2011Google Inc.Dynamic search box for web browser
US8069485 *Oct 25, 2005Nov 29, 2011Novell, Inc.Techniques to pollute electronic profiling
US8073835 *Jan 4, 2010Dec 6, 2011Research In Motion LimitedSystems and methods of building and using custom word lists
US8073867May 21, 2008Dec 6, 2011Aol Inc.Analyzing a query log for use in managing category-specific electronic content
US8073868 *Dec 15, 2006Dec 6, 2011SortFix, Ltd.System for facilitating search over a network
US8090717Jun 30, 2003Jan 3, 2012Google Inc.Methods and apparatus for ranking documents
US8108410 *Aug 6, 2008Jan 31, 2012International Business Machines CorporationDetermining veracity of data in a repository using a semantic network
US8126876Jul 10, 2009Feb 28, 2012Google Inc.Systems and methods for improving the ranking of news articles
US8135737Mar 24, 2008Mar 13, 2012Aol Inc.Query routing
US8156109Oct 29, 2010Apr 10, 2012Google Inc.Anticipated query generation and processing in a search engine
US8161044 *Oct 26, 2005Apr 17, 2012International Business Machines CorporationFaceted web searches of user preferred categories throughout one or more taxonomies
US8205265Oct 21, 2011Jun 19, 2012Apple Inc.Techniques to pollute electronic profiling
US8225190Dec 24, 2008Jul 17, 2012Google Inc.Methods and apparatus for clustering news content
US8266133Jul 28, 2009Sep 11, 2012Google Inc.Determination of a desired repository
US8266234Jun 11, 2004Sep 11, 2012Seisint, Inc.System and method for enhancing system reliability using multiple channels and multicast
US8271471Sep 26, 2011Sep 18, 2012Google Inc.Anticipated query generation and processing in a search engine
US8271546Sep 23, 2011Sep 18, 2012Google Inc.Method and system for URL autocompletion using ranked results
US8332382Feb 24, 2012Dec 11, 2012Google Inc.Systems and methods for improving the ranking of news articles
US8341144Oct 13, 2010Dec 25, 2012Yahoo! Inc.Selecting and presenting user search results based on user information
US8346780Apr 16, 2010Jan 1, 2013Hitachi, Ltd.Integrated search server and integrated search method
US8380712Oct 31, 2011Feb 19, 2013Research In Motion LimitedSystems and methods of building and using custom word lists
US8386469 *Feb 7, 2007Feb 26, 2013Mobile Content Networks, Inc.Method and system for determining relevant sources, querying and merging results from multiple content sources
US8417710 *Sep 20, 2010Apr 9, 2013International Business Machines CorporationPublic relations and reputation mining via semantic analytics
US8438170Mar 29, 2006May 7, 2013Yahoo! Inc.Behavioral targeting system that generates user profiles for target objectives
US8484098May 4, 2011Jul 9, 2013Michael BilottaSystem for information delivery facilitating partner rating of users and user ratings of partners
US8504575Mar 29, 2006Aug 6, 2013Yahoo! Inc.Behavioral targeting system
US8515954Aug 25, 2011Aug 20, 2013Google Inc.Displaying autocompletion of partial search query with predicted search results
US8521713Jul 11, 2011Aug 27, 2013Microsoft CorporationDomain expert search
US8527509Mar 23, 2011Sep 3, 2013Huawei Technologies Co., Ltd.Search method, system and device
US8548995 *Sep 10, 2003Oct 1, 2013Google Inc.Ranking of documents based on analysis of related documents
US8612418 *Oct 20, 2011Dec 17, 2013Google Inc.Mobile web browser for pre-loading web pages
US8615707 *Jan 16, 2009Dec 24, 2013Google Inc.Adding new attributes to a structured presentation
US8639684Aug 15, 2011Jan 28, 2014Google Inc.Dynamic search box for web browser
US8645368 *Sep 14, 2012Feb 4, 2014Google Inc.Systems and methods for improving the ranking of news articles
US8676793 *Jan 11, 2013Mar 18, 2014Blackberry LimitedSystems and methods of building and using custom word lists
US8694494 *Mar 25, 2005Apr 8, 2014Vistaprint Schweiz GmbhSelecting images using associated keywords
US8694511 *Aug 20, 2007Apr 8, 2014Google Inc.Modifying search result ranking based on populations
US8768908Apr 17, 2009Jul 1, 2014Facebook, Inc.Query disambiguation
US20060218522 *Mar 25, 2005Sep 28, 2006Vistaprint Technologies LimitedSelecting images using associated keywords
US20070192300 *Feb 7, 2007Aug 16, 2007Mobile Content Networks, Inc.Method and system for determining relevant sources, querying and merging results from multiple content sources
US20080065632 *Sep 4, 2007Mar 13, 2008Chutnoon Inc.Server, method and system for providing information search service by using web page segmented into several inforamtion blocks
US20100185934 *Jan 16, 2009Jul 22, 2010Google Inc.Adding new attributes to a structured presentation
US20100235362 *Mar 16, 2009Sep 16, 2010Graham CormodeMethods and apparatus for ranking uncertain data in a probabilistic database
US20110314059 *Aug 26, 2011Dec 22, 2011Huawei Technologies Co., Ltd.Mobile search method and apparatus
US20120072429 *Sep 20, 2010Mar 22, 2012International Business Machines CorporationPublic relations and reputation mining via semantic analytics
US20130019159 *Oct 20, 2011Jan 17, 2013Google Inc.Mobile web browser for pre-loading web pages
US20130110830 *Oct 31, 2011May 2, 2013Microsoft CorporationRanking of entity properties and relationships
US20130159294 *Sep 14, 2012Jun 20, 2013Google Inc.Systems and methods for improving the ranking of news articles
CN101248435BJun 27, 2006Aug 28, 2013谷歌公司Determination of a desired repository
EP2352102A1 *Sep 16, 2009Aug 3, 2011Huawei Technologies Co., Ltd.A method for searching and the device and system thereof
EP2385473A1 *Jun 27, 2006Nov 9, 2011Google Inc.Determination of a desired repository
WO2007005431A1 *Jun 27, 2006Jan 11, 2007Google IncDetermination of a desired repository
WO2011128945A1 *Apr 16, 2010Oct 20, 2011Hitachi, Ltd.Integrated search server and integrated search method
WO2012174639A1 *Nov 10, 2011Dec 27, 2012Rogers Communications Inc.Systems and methods for ranking document clusters
Classifications
U.S. Classification1/1, 707/E17.109, 707/999.003
International ClassificationG06F17/30
Cooperative ClassificationG06F17/30867
European ClassificationG06F17/30W1F
Legal Events
DateCodeEventDescription
May 24, 2002ASAssignment
Owner name: INTERNATIOAL BUSINESS MACHINES CORPORATION, NEW YO
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DOGANATA, YURDAER NEZIHI;DRISSI, YOUSSEF;KOZAKOV, LEV;REEL/FRAME:012953/0174
Effective date: 20020522