Some search engines that search a document corpus (e.g., a group of web pages) collect information pertaining to which documents users find relevant for a particular search query (e.g., the documents viewed as results for a specific query). The collected information can be used to improve the rank of relevant documents in search results. However, when new documents are introduced into a corpus, very little information on their relevance for particular searches exists. Therefore, new documents which may be highly pertinent as results for a given query can have low search result rankings that make them less likely to be noticed by users.
This specification describes technologies relating to search engine ranking. In general, one aspect of the subject matter described in this specification can be embodied in a method that includes providing a first query to a first search engine for searching a first corpus of documents. A plurality of first result documents are received from the first search engine responsive to the query, each first result document being associated with a respective ranking among the first result documents. For one or more first documents in the plurality of first result documents, the following is performed. First, a distinct second document in a second corpus of documents is identified where the second document contains content that identifies a physical object that has an identification number, where the first document contains content that identifies the physical object, and where the second document was included in a plurality of second result documents responsive to a second query of the second corpus of documents, and where the second query is identical to the first query or similar to the first query. Second, a new ranking is determined for the first document in the plurality of first search result documents based on the first document's respective ranking and second relevance data associated with the second document, where the second relevance data is indicative of the second document's popularity among a population of users as a result for the second query. Other embodiments of this aspect include corresponding systems and computer program products.
These and other embodiments can optionally include one or more of the following features. Determining the new ranking for the first document can be further based upon first relevance data associated with the first document, where the first relevance data is indicative of the first document's popularity among a population of users as a result for the first query. Determining the new ranking for the first document can further include a weighting of the first relevance data and the second relevance data. The weighting can favor the first relevance data as selections of the first document as a result for the first query increase. The weighting can favor the first relevance data as views of the first document pass a threshold number of views. The physical object can be a book and the identification number can be an ISBN number. The physical object can be a product and the identification number can be a product identification number. The second query can be provided to a second search engine for searching the second corpus of documents. The second search engine can be a general content search engine and the first search engine can be a book content search engine. The documents of the first corpus can include content of a shared category and the documents of the second corpus can include content of all categories. The second query can be provided to a second search engine for searching the second corpus of documents, where the second search engine is a general content search engine and the first search engine is a specific content search engine. The relevance data associated with the second document can be based on an aggregate amount of time that the second document is selected by the users in the population. The second query can be similar to the first query if the second query and first query each include an identical term. The plurality of first result documents, or a portion thereof, can be output to a user, the output first result documents arranged according to each first result document's new ranking.
Particular embodiments of the subject matter described in this specification can be implemented to realize one or more of the following advantages. A document newly introduced into a corpus of documents searched by a search engine may benefit from existing user search patterns involving documents of similar content. The documents of similar content may be included in the same corpus or a corpus searched by a different search engine. Similarly, a search engine receiving limited traffic may gain the benefit of statistically significant user search patterns from a search engine receiving greater traffic.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the invention will become apparent from the description, the drawings, and the claims.
Like reference symbols in the various drawings indicate like elements.
Systems and techniques for improving search results for searches of a first corpus of documents by utilizing relevance data collected as a result of searches performed on a second corpus of documents are described herein.
The search results 120 and 122 (also called result documents) correspond to documents in a corpus of book content documents 106 (e.g. a collection of web pages of the Internet relating to books or pages of books) searched by the book search engine server 140. The corpus 106 includes documents 124, 126, 128, and 130. For example, search result 122 contains a title, information, and an image corresponding to document 126 and permits a user to view the document 126 (e.g., a user may click on or otherwise select a link and visit document 126). Search results 120 and 122 are arranged according to a rank of each search result. For example, the search result 120 has a better rank than result 122 because it is closer to the top of the page 116.
When the query 118 is provided to the book search engine server 140, the book search engine server 140 generates an initial list of search results corresponding to relevant documents in the corpus 106 and provides an initial rank or score to each search result. For example, the initial rank may be based upon the prevalence of the query 118's search terms within the search result document or may be based upon how often other highly ranked documents link to the particular search result document. The initial ranking is discussed in greater detail later.
In some implementations, the initial rank of a search result is modified based upon relevance data. Relevance data indicates the relevance of a document as a search result for a given query for a population of users. For example, document 126 and corresponding search results are associated with relevance data 112 and 114 which may have been used to modify (e.g., increase or decrease) the initial rank of the search result 122. The relevance data 112 and 114 may indicate an aggregate amount of time that the document 126 is viewed by users in the population using the book search engine server 140 (e.g., whether each user views the document for a short, medium, or long amount of time). The relevance data may also indicate a number of times that the document 126 is selected by users in the population or a view (i.e., impression) to click ratio. The relevance data may further indicate a user-specified promotion or demotion of a search result. Other measures of relevance are possible.
By way of illustration, relevance data 114 may indicate the relevance of document 126 to the query “Dinosaurs” and relevance data 112 may indicate the relevance of document 126 to the query “Fish.” Because the document 126 contains content about a dinosaur book, the relevance data 114 is likely to indicate a greater relevance that the relevance data 112. In some implementations, the relevance data includes click/query pairs. For instance, relevance data 114 may indicate the relevance (e.g., the “click information”) of document 126 to a specific query. The click information indicates the amount of time a user viewed a document in response to the specific query. Longer dwell times on the document indicate a greater relevance. Any of the above discussed relevance data may be query specific. Other indicators of relevance are possible.
In some implementations, a separate general content search engine server (not shown) searches a corpus of general content documents 104 (i.e., a group of documents that include content of all types or categories). For example, document 132 may include content about a breed of dogs, document 134 may include content about a journal entry, and document 136 may include content about a dinosaur book. The corpus of general content documents 104 may include documents of similar content to the book content corpus of documents 106. For example, the documents of the book corpus 106 include scanned copies of books while the documents of the general corpus 106 include specific pages of a bookstore website about some of the same books.
In some implementations, the book search engine server 140 or another process identifies a document in the corpus of general content documents 104 as associated with a document in the corpus of book content documents 106. The two documents are identified as associated if they include similar content. In some implementations, the similar content is a physical object with an identification number (e.g. a book with an International Standard Book Number (ISBN) number or a product with a product number). For example, the document 136 is associated with document 126 because each document identifies a book “Mean Dinosaurs” by John Doe.
In various implementations, a primary content of each document in the corpus of general content documents 104 is identified. For example, the documents in corpus 104 that include content describing a single book are identified. In some implementations, the identification occurs by searching for a physical object's identification number. A server (e.g. server 140 or the general content search engine server) searches the corpus of general content documents 104 for ISBN numbers.
Should a searched document include a single ISBN number, the searched document is identified as containing as its primary content the book associated with the ISBN number. Should a searched document include more than one ISBN number, the primary content of the searched document is determined by performing search queries for each ISBN number using as search terms the author or title of the book corresponding to each ISBN number. A document rank for each search is received and the query corresponding to the highest document ranking identifies the searched document's primary content. The system 100 stores the primary content of documents of the corpus 104, if any, in a repository (e.g. a database connected to the book search engine server 140 or the general content search engine server). Not only is the searched document identified as containing a primary content, but a search result corresponding to the searched document and provided in response to a query is identified as associated with the primary content.
The primary content of documents in the general content corpus of documents 104 may be determined without using an ISBN number. In some implementations, a book is identified as the primary content of a document if the document satisfies a citation criterion for the book. A citation criterion can be satisfied, for example, if a citation score of a document for a book exceeds a citation threshold.
To calculate a citation score of a document for a book, a server (e.g., book search engine server 140 or the general content search engine) first determines if the document cites to a book. A document can cite to a book if the document, for example, includes a reference to the book, such as the book title and, optionally, the author of the book. In some implementations, the server has access to a library data store that stores book metadata for many published books, including book titles, author names, ISBN numbers, year published, and other such information. This information from the library data store can be compared to content of the document to identify any book citations in the document.
The server can generate a citation score for each book cited within a document by calculating a relevance metric of the book metadata in relation to the contents of the document. For example, upon finding a book citation, the server can access book metadata for the book and compare the book metadata to the content of the document to generate a citation score for the document and the book. The citation score, in some implementations, is a measure of the relevance of the book metadata to the content of the document. In some implementations, the server can submit the book metadata as a query to the general content search engine server and an relevance score for the document can be generated by the search engine. The citation score for the document for that book is then set to this relevance score.
After citations scores are determined, the general content search engine server determines whether the citation score for a document and a book satisfies a citation criterion. In some implementations, the citation score of a particular book referenced within a document satisfies the citation criterion when the citation score of the document for the particular book exceeds a citation threshold, and when citation scores of the document for any other books referenced in the document are each less than the citation score for the particular book. In some implementations, a citation score can satisfy the citation criterion if the citation score for a particular book is at least a predetermined percentage greater than the citation scores for the other books cited within the same document (e.g., at least two times greater). If a citation score for a particular book cited in a document is determined to satisfy the citation criteria, then the book is identified as the primary content of the document.
In some implementations, the primary content of documents in the book content corpus of documents 106 is identified by ISBN numbers or other unique identifiers entered when the documents (e.g., scanned books or pages of books) are entered into the corpus 106. In other implementations, procedures similar to those described above regarding the corpus of general content documents 104 is performed on the corpus of book content documents 106.
In some implementations, the search engine server 140 modifies the initial ranking of search result 122 corresponding to document 126 based upon relevance data of associated document 136 (i.e., relevance data 142 and 144). The relevance data 142 and 144 identifies information similar to relevance data 112 and 114, but the information indicates relevance of the document 136 to users of the general content search engine server (not the book search engine server 140). For example, relevance data 144 may indicate the relevance of document 136 to the query “Dinosaurs” (e.g. a number of views of the document 136 in result to the query “Dinosaurs”). The book search engine server 140 may not receive as much traffic as the general content search engine server, so it benefits by “borrowing” relevance data from associated documents.
The book search engine server 140 checks the repository to determine associations between documents in corpus 106 and corpus 104. The checking may occur, for example, with each query of the book search engine server 140 (in which case, pertinent relevance data would be used by server 140 in modifying initial search result rankings). The checking may also occur periodically, in which case relevance data of associated documents in corpus 104 is stored by the book search engine server 140 for immediate access upon processing of a query 118.
In some implementations, in determining the modified ranking of a search result 122, the book search engine server 140 weighs the relevance data of the corresponding document 126 and its associated document 136 from the corpus of general content documents 104 (e.g., relevance data 114 of document 126 and relevance data 144 of document 136 are weighted). In various implementations, the information or data of 114 and 144 is generated through user interaction or activity associated with each respective search engine server. If the activity corresponding to the relevance data 114 is below a low threshold, the system 140 only uses the relevance data 144. However, if activity corresponding to the relevance data 114 is above a high threshold, the system 140 only uses the relevance data 114. Still, if the activity corresponding to the relevance data 114 is between the low and high thresholds, the system 140 may average or otherwise combine relevance data 114 and 144.
In some implementations, the book search engine server 142 favors the relevance data 144 as the corresponding activity increases. In other implementations, the system 142 favors the relevance data 114 as the corresponding activity increases in proportion to the corresponding activity of the relevance data 144.
In some implementations, more than one document from the corpus of general content documents 104 is associated with document 126 of corpus 106. For example, document 134 may, like document 136 and document 126, contain content about a book “Mean Dinosaurs.” In such implementation, numerous methods of determining which relevance data from the corpus 104 to use are feasible. The relevance data of sister documents 134 and 136 in the corpus 104 may be averaged. The relevance data with the most favorable or least favorable values from the sister documents may be used. The relevance data of the sister documents may be aggregated. Also, system 100 may overwrite in the repository a document previously associated with a document of the corpus 106, effectively only allowing association with one document (and one set of relevance data).
It should be understood that the use of search engine servers and corpora of documents corresponding to books and general content matter is for illustrative purposes only. In various implementations, the described system can work with any collection of physical or electronic objects having unique identifiers. The corpus of book content documents 106 may instead include documents associated with any specific content, type, topic, category, or subject or may even include documents of general content. For example, the corpus 106 may include documents including content of a shared category (e.g., news articles, products, images, videos, blog entries, user group entries, etc.). A search engine searching such category is considered a specific content search engine. A search engine may search more than one or all categories is considered a general content search engine. The corpus of general content documents 104 similarly may include documents addressing any type, general or specific. Further, the book search engine server 140 may include several servers or computerized devices performing the operations described above. Example components of the server 140 are described in systems 200 and 300.
A user 202 (202a, 202b, 202c) interacts with the system 200 through a client device 204 (204a, 204b, 204c) or other device. For example, the client device 204 can be a computer terminal within a local area network (LAN) or within a wide area network (WAN). The client device 204 includes a random access memory (RAM) 206 (or other memory and/or a storage device) and a processor 208. The processor 208 is structured to process instructions within the system 200. In some implementations, the processor 208 is a single-threaded processor. In other implementations, the processor 208 is a multi-threaded processor. The processor 208 can include multiple processing cores and is structured to process instructions stored in the RAM 206 (or other memory and/or a storage device included with the client device 204) to display graphical information for a user interface.
A user 202a connects to the search engine 230 within a book search engine server 214 to submit a query 215. The book search engine server 214 and the query 215, for instance, are the same as the server 140 and the query 118, respectively, of
Book search engine server 214 includes a memory device 216, which includes the search engine 230 loaded therein. A processor 218 is configured to process instructions within the server 214. These instructions can implement one or more components of the search engine 230. The processor 218 may be a single-threaded processor or a multi-threaded processor and may include multiple processing cores. The processor 218 processes instructions stored in the memory 216 related to the search engine 230 and sends information to the client device 204, through the network 212, to create a graphical presentation in a user interface of the client device 204 (e.g., a search results web page displayed in a web browser). In some implementations, the graphical presentation is the page 116 in
The server-side query signal 210b is received by the search engine 230. The search engine 230 uses the information within the user query 215 (e.g., query terms) to find relevant documents. In some implementations, the search engine 230 includes an indexing engine 220 that actively searches a corpus (e.g., the corpus of book content documents 106 or web pages on the Internet) to index the documents found in that corpus, and the index information for the documents in the corpus is stored in a book content index database 222. This index database 222 is accessed to identify documents related to the user query 215. Note that, an electronic document (which for brevity will simply be referred to as a document) does not necessarily correspond to a file. A document can be stored in a portion of a file that holds other documents, in a single file dedicated to the document in question, or in multiple coordinated files.
In some implementations, the search engine 230 includes a ranking engine 252 to rank the documents related to the user query 215. The ranking of the documents is performed, for instance, using techniques for determining an information retrieval (IR) score for indexed documents in view of a given query. By way of illustration, the relevance of a particular document with respect to a particular search term or to other provided information may be determined by any appropriate technique. For example, the general number of back-links to a document that contains matches for a search term is used to infer a document's relevance. In particular, if a document is linked to (e.g., is the target of a hyperlink) by many other relevant documents (e.g., documents that also contain matches for the search terms), it can be inferred that the target document is particularly relevant. This inference is made because the authors of the pointing documents presumably point, for the most part, to other documents that are relevant to their audience.
If the pointing documents are in turn the targets of links from other relevant documents, they can be considered more relevant, and the first document is considered particularly relevant because it is the target of relevant (or even highly relevant) documents. Such a technique is the determinant of a document's relevance or one of multiple determinants. In some implementations, appropriate techniques are also utilized to identify and eliminate attempts to cast false votes so as to artificially drive up the relevance of a page.
To further improve such traditional document ranking techniques, the ranking engine 252 receives an additional signal from a rank modifier engine 256 to assist in determining an appropriate ranking for the documents. The rank modifier engine 256 provides one or more measures of relevance for the documents (e.g. relevance data 112, 114, 142, and 144 from
The search engine 230 forwards the final, ranked result list within a server-side search results signal 228a through the network 212. Exiting the network 212, a client-side search results signal 228b is received by the client device 204a where the results are stored within the RAM 206 and/or used by the processor 208 to display the results on an output device for the user 202a.
The ranking engine 330 produces a ranking of search results 340 for display to a user based on IR scores received from the scoring engine 320 and one or more signals from the rank modifier engine 370. A tracking component 350 records information regarding individual user selections of the results presented in the ranking 340. In some implementations, the tracking component 350 is embedded JavaScript code included in a web page ranking 340 that identifies user selections (clicks) of individual search results and also identifies when the user returns to the results page, thus indicating the amount of time the user spent viewing the selected document result. In other implementations, the tracking component 350 is a proxy system through which user selections of the search results are routed, or the tracking component includes pre-installed software at the client (e.g., a toolbar plug-in to the client's operating system). Other implementations are also possible, such as by using a feature of a web browser that allows a tag/directive to be included in a page, which requests the browser to connect back to the server with message(s) regarding link(s) clicked by the user.
The recorded information is stored in result selection logs 360. In some implementations, the recorded information includes log entries that indicate, for each user selection, the query (Q), the document (D), the time (T) on the document, the language (L) employed by the user, and the country (C) where the user is likely located (e.g., based on the server used to access the IR system). In further implementations, other information is recorded regarding user interactions with a presented ranking, including negative information, such as the fact that a document result was presented to a user, but was not clicked, position(s) of click(s) in the user interface, IR scores of clicked results, IR scores of all results shown before click, the titles and snippets shown to the user before the click, the user's cookie, cookie age, IP (Internet Protocol) address, user agent of the browser, etc. In other implementations, similar information (e.g., IR scores, position, etc.) is recorded for an entire session, or multiple sessions of a user, including potentially recording such information for every click that occurs both before and after a current click.
The information stored in the result selection logs 360 (e.g. relevance data 112 and 114 is included in this information) is used by the rank modifier engine 370 in generating the one or more signals to the ranking engine 330. In general, a wide range of information is collected and used to modify or tune the click signal from the user to make the signal, and the future search results provided, a better fit for the user's needs. Thus, user interactions with the rankings presented to the users of the information retrieval system can be used to improve future rankings.
In some implementations, information stored in general content search engine result selection logs 380 (e.g. relevance data 142 and 144 is included in this information) is used by the rank modifier engine 370 in generating one or more signals to the ranking engine 330. The information in logs 380 is created by the general content search engine server (discussed in relation to
The components shown in
In box 402, a query is provided to a search engine. The query is provided by a user of the search engine or by a system for searching documents in a corpus of documents. For example, the book search engine server 140 in
In box 404, search results are received. For example, the scoring engine 320 receives a list or a plurality of search results relevant to the query 118 from the indexing engine 310. Each search result represents or corresponds to a document in the corpus of documents. For example, the received search results (that are not shown) correspond to documents 124, 126, 128, and 130 in the corpus of book content documents 106.
In box 406, an initial rank or score is provided to each of the received search results based upon each corresponding document's relevance to the query. For example, the scoring engine 320 provides an initial rank to each of the received search results corresponding to documents 124, 126, 128, and 130. The search results are initially ranked based upon their corresponding documents' relevance to the query 118 “Dinosaurs.”
In box 408, an initial rank for a first search result (i.e., a single search result from the plurality of search results) is received. For example, the ranking engine 330 receives an initial rank for the search result corresponding to the document 126.
In box 410, content of a first document (i.e., a document corresponding to the first search result) is identified. In some implementations, the identified content includes physical objects (e.g., books or products). In other implementations, the physical objects include identification numbers (e.g., an ISBN number for a book or a product number for a product). For example, the book search engine server 140 identifies the book “Mean Dinosaurs” by John Doe as the content of document 126.
In other implementations, a non-physical object is identified as the content of the first document. For example, an electronic version of a book, a journal entry, a blog posting, a website, a song, or a video may be identified as the content of the first document. The non-physical object may include an identification number (e.g. an ISBN number for an electronic book or database tags or labels for digital content). In some implementations, only content of a particular type or subject matter is identified (e.g. only books are identified; not journal entries, newspaper articles, etc.). In some implementations, no content is identified for the first document and the operation of box 408 is followed by the determination of box 414.
In box 412, a second document is identified that includes content similar or the same as the content of the first document. In some implementations the second document is from a separate, second corpus of documents searched by a separate search engine. For example, the book search engine server 140 identifies the document 136 from corpus 104 as including content similar to the content of the document 126. Both the document 126 and 136 include content about the book “Mean Dinosaurs” by John Doe. In some implementations, the second document is from the same corpus of documents as the first document (e.g., the book search engine server 140 identifies document 130 as including content about the book “Mean Dinosaurs”). In other implementations, the book search engine server 140 identifies more than one document that includes content about the book “Mean Dinosaurs” (e.g., the documents 134 and 136).
In box 414, a new or modified rank of the first search result is determined using relevance data associated with the second document. In some implementations, the relevance data identifies information regarding user interaction with a search result corresponding to the second document. For example, the information may include a number of selections of the search result as a result for a query, a length of selections of the search result as a result for a query, an indication of previewing the second document as a result for the query, etc.
In some implementations, the relevance data is the relevance data 142 and 144 of
In box 416, a determination is made whether there are additional search results from the plurality of received search results for which the operations of boxes 408 through 414 has not been performed. If such an additional search result exists, the process performs the operations of boxes 408 through 412 for the additional search result (i.e., the new “first search result”). For example, the process 400 performs the operations of boxes 408 through 412 for the search results related to documents 124, 128, and 130 (the operations were already performed for the search result related to document 126). If no such additional search result exists, the process ends.
The system 500 includes a processor 510, a memory 520, a storage device 530, and an input/output device 540. Each of the components 510, 520, 530, and 540 are interconnected using a system bus 550. The processor 510 is capable of processing instructions for execution within the system 500. The processor may be designed using any of a number of architectures. For example, the processor 510 may be a CISC (Complex Instruction Set Computers) processor, a RISC (Reduced Instruction Set Computer) processor, or a MISC (Minimal Instruction Set Computer) processor.
In one implementation, the processor 510 is a single-threaded processor. In another implementation, the processor 510 is a multi-threaded processor. The processor 510 is capable of processing instructions stored in the memory 520 or on the storage device 530 to display graphical information for a user interface on the input/output device 540.
The memory 520 stores information within the system 500. In one implementation, the memory 520 is a computer-readable medium. In one implementation, the memory 520 is a volatile memory unit. In another implementation, the memory 520 is a non-volatile memory unit.
The storage device 530 is capable of providing mass storage for the system 500. In one implementation, the storage device 530 is a computer-readable medium. In various different implementations, the storage device 530 may be a floppy disk device, a hard disk device, an optical disk device, or a tape device.
The input/output device 540 provides input/output operations for the system 500. In one implementation, the input/output device 540 includes a keyboard and/or pointing device. In another implementation, the input/output device 540 includes a display unit for displaying graphical user interfaces.
The features described can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The apparatus can be implemented in a computer program product tangibly embodied in an information carrier, e.g., in a machine-readable storage device for execution by a programmable processor; and method steps can be performed by a programmable processor executing a program of instructions to perform functions of the described implementations by operating on input data and generating output. The described features can be implemented advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. A computer program is a set of instructions that can be used, directly or indirectly, in a computer to perform a certain activity or bring about a certain result. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.
Suitable processors for the execution of a program of instructions include, by way of example, both general and special purpose microprocessors, and the sole processor or one of multiple processors of any kind of computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memories for storing instructions and data. Generally, a computer will also include, or be operatively coupled to communicate with, one or more mass storage devices for storing data files; such devices include magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits).
To provide for interaction with a user, the features can be implemented on a computer having a display device such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor for displaying information to the user and a keyboard and a pointing device such as a mouse or a trackball by which the user can provide input to the computer.
The features can be implemented in a computer system that includes a back-end component, such as a data server, or that includes a middleware component, such as an application server or an Internet server, or that includes a front-end component, such as a client computer having a graphical user interface or an Internet browser, or any combination of them. The components of the system can be connected by any form or medium of digital data communication such as a communication network. Examples of communication networks include a local area network (“LAN”), a wide area network (“WAN”), peer-to-peer networks (having ad-hoc or static members), grid computing infrastructures, and the Internet.
The computer system can include clients and servers. A client and server are generally remote from each other and typically interact through a network, such as the described one. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
This application is a continuation application of and claims priority to U.S. application Ser. No. 12/331,872, filed on Dec. 10, 2008, the entire contents of which are hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5265065 | Turtle | Nov 1993 | A |
5488725 | Turtle | Jan 1996 | A |
5696962 | Kupiec | Dec 1997 | A |
5920854 | Kirsch et al. | Jul 1999 | A |
5963940 | Liddy et al. | Oct 1999 | A |
6006222 | Culliss | Dec 1999 | A |
6014665 | Culliss | Jan 2000 | A |
6026388 | Liddy et al. | Feb 2000 | A |
6067565 | Horvitz | May 2000 | A |
6078916 | Culliss | Jun 2000 | A |
6078917 | Paulsen et al. | Jun 2000 | A |
6088692 | Driscoll | Jul 2000 | A |
6134532 | Lazarus et al. | Oct 2000 | A |
6182066 | Marques | Jan 2001 | B1 |
6182068 | Culliss | Jan 2001 | B1 |
6185559 | Brin et al. | Feb 2001 | B1 |
6249252 | Dupray | Jun 2001 | B1 |
6285999 | Page | Sep 2001 | B1 |
6321228 | Crandall et al. | Nov 2001 | B1 |
6327590 | Chidlovskii et al. | Dec 2001 | B1 |
6341283 | Yamakawa et al. | Jan 2002 | B1 |
6353849 | Linsk | Mar 2002 | B1 |
6363378 | Conklin et al. | Mar 2002 | B1 |
6370526 | Agrawal et al. | Apr 2002 | B1 |
6421675 | Ryan | Jul 2002 | B1 |
6480843 | Li | Nov 2002 | B2 |
6490575 | Berstis | Dec 2002 | B1 |
6526440 | Bharat | Feb 2003 | B1 |
6529903 | Smith et al. | Mar 2003 | B2 |
6539377 | Culliss | Mar 2003 | B1 |
6560590 | Shwe et al. | May 2003 | B1 |
6567103 | Chaudhry | May 2003 | B1 |
6587848 | Aggarwal et al. | Jul 2003 | B1 |
6615209 | Gomes | Sep 2003 | B1 |
6623529 | Lakritz | Sep 2003 | B1 |
6658423 | Pugh et al. | Dec 2003 | B1 |
6671681 | Emens et al. | Dec 2003 | B1 |
6678681 | Brin et al. | Jan 2004 | B1 |
6701309 | Beeferman | Mar 2004 | B1 |
6725259 | Bharat | Apr 2004 | B1 |
6738764 | Mao et al. | May 2004 | B2 |
6754873 | Law et al. | Jun 2004 | B1 |
6792416 | Soetarman et al. | Sep 2004 | B2 |
6795820 | Barnett | Sep 2004 | B2 |
6816850 | Culliss | Nov 2004 | B2 |
6853993 | Ortega et al. | Feb 2005 | B2 |
6873982 | Bates et al. | Mar 2005 | B1 |
6877002 | Prince | Apr 2005 | B2 |
6882999 | Cohen et al. | Apr 2005 | B2 |
6901402 | Corston-Oliver et al. | May 2005 | B1 |
6912505 | Linden et al. | Jun 2005 | B2 |
6944611 | Flank et al. | Sep 2005 | B2 |
6944612 | Roustant et al. | Sep 2005 | B2 |
6954750 | Bradford | Oct 2005 | B2 |
6963867 | Ford | Nov 2005 | B2 |
6990453 | Wang et al. | Jan 2006 | B2 |
7016939 | Rothwell et al. | Mar 2006 | B1 |
7028027 | Zha et al. | Apr 2006 | B1 |
7072886 | Salmenkaita et al. | Jul 2006 | B2 |
7085761 | Shibata | Aug 2006 | B2 |
7113939 | Chou et al. | Sep 2006 | B2 |
7117206 | Bharat et al. | Oct 2006 | B1 |
7136849 | Patrick | Nov 2006 | B2 |
7146361 | Broder et al. | Dec 2006 | B2 |
7222127 | Bem et al. | May 2007 | B1 |
7231399 | Bem et al. | Jun 2007 | B1 |
7243102 | Naam et al. | Jul 2007 | B1 |
7266765 | Golovchinsky et al. | Sep 2007 | B2 |
7293016 | Shakib et al. | Nov 2007 | B1 |
7379951 | Chkodrov et al. | May 2008 | B2 |
7382358 | Kushler et al. | Jun 2008 | B2 |
7395222 | Sotos | Jul 2008 | B1 |
7426507 | Patterson | Sep 2008 | B1 |
7451487 | Oliver | Nov 2008 | B2 |
7516146 | Robertson et al. | Apr 2009 | B2 |
7526470 | Karnawat | Apr 2009 | B1 |
7533092 | Berkhin et al. | May 2009 | B2 |
7533130 | Narayana et al. | May 2009 | B2 |
7552112 | Jhala et al. | Jun 2009 | B2 |
7565363 | Anwar | Jul 2009 | B2 |
7565367 | Barrett et al. | Jul 2009 | B2 |
7566363 | Starling et al. | Jul 2009 | B2 |
7574530 | Wang et al. | Aug 2009 | B2 |
7584181 | Zeng et al. | Sep 2009 | B2 |
7610282 | Datar et al. | Oct 2009 | B1 |
7657626 | Zwicky | Feb 2010 | B1 |
7680775 | Levin et al. | Mar 2010 | B2 |
7693818 | Majumder | Apr 2010 | B2 |
7716225 | Dean et al. | May 2010 | B1 |
7747612 | Thun et al. | Jun 2010 | B2 |
7756887 | Haveliwala | Jul 2010 | B1 |
7783632 | Richardson et al. | Aug 2010 | B2 |
7801885 | Verma | Sep 2010 | B1 |
7809716 | Wang et al. | Oct 2010 | B2 |
7818315 | Cucerzan | Oct 2010 | B2 |
7818320 | Makeev | Oct 2010 | B2 |
7836058 | Chellapilla | Nov 2010 | B2 |
7844589 | Wang et al. | Nov 2010 | B2 |
7849089 | Zhang et al. | Dec 2010 | B2 |
7853557 | Schneider et al. | Dec 2010 | B2 |
7877404 | Achan et al. | Jan 2011 | B2 |
7895177 | Wu | Feb 2011 | B2 |
7953740 | Vadon | May 2011 | B1 |
7974974 | Tankovich et al. | Jul 2011 | B2 |
7987185 | Mysen et al. | Jul 2011 | B1 |
8019650 | Donsbach et al. | Sep 2011 | B2 |
8024326 | Tong et al. | Sep 2011 | B2 |
8024330 | Franco et al. | Sep 2011 | B1 |
8027439 | Zoldi | Sep 2011 | B2 |
8037042 | Anderson et al. | Oct 2011 | B2 |
8037043 | Zoeter et al. | Oct 2011 | B2 |
8051061 | Niu et al. | Nov 2011 | B2 |
8060456 | Gao | Nov 2011 | B2 |
8060497 | Zatsman et al. | Nov 2011 | B1 |
8065296 | Franz | Nov 2011 | B1 |
8069182 | Pieper | Nov 2011 | B2 |
8073263 | Hull et al. | Dec 2011 | B2 |
8073772 | Bishop et al. | Dec 2011 | B2 |
8086599 | Heymans | Dec 2011 | B1 |
8090717 | Bharat et al. | Jan 2012 | B1 |
8156111 | Jones et al. | Apr 2012 | B2 |
8224827 | Dean et al. | Jul 2012 | B2 |
8412699 | Mukherjee | Apr 2013 | B1 |
8458165 | Liao | Jun 2013 | B2 |
8498974 | Kim | Jul 2013 | B1 |
8521725 | Pearson | Aug 2013 | B1 |
8583636 | Franz | Nov 2013 | B1 |
20010000356 | Woods | Apr 2001 | A1 |
20020034292 | Tuoriniemi et al. | Mar 2002 | A1 |
20020042791 | Smith et al. | Apr 2002 | A1 |
20020049752 | Bowman et al. | Apr 2002 | A1 |
20020103790 | Wang et al. | Aug 2002 | A1 |
20020123988 | Dean et al. | Sep 2002 | A1 |
20020133481 | Smith et al. | Sep 2002 | A1 |
20020165849 | Singh et al. | Nov 2002 | A1 |
20030009399 | Boerner | Jan 2003 | A1 |
20030018707 | Flocken | Jan 2003 | A1 |
20030028529 | Cheung et al. | Feb 2003 | A1 |
20030037074 | Dwork et al. | Feb 2003 | A1 |
20030078914 | Witbrock | Apr 2003 | A1 |
20030120654 | Edlund et al. | Jun 2003 | A1 |
20030130998 | Fox et al. | Jul 2003 | A1 |
20030135490 | Barrett et al. | Jul 2003 | A1 |
20030149704 | Yayoi et al. | Aug 2003 | A1 |
20030167252 | Odom et al. | Sep 2003 | A1 |
20030195877 | Ford et al. | Oct 2003 | A1 |
20030204495 | Lehnert | Oct 2003 | A1 |
20030220913 | Doganata et al. | Nov 2003 | A1 |
20030229640 | Carlson et al. | Dec 2003 | A1 |
20040006456 | Loofbourrow | Jan 2004 | A1 |
20040006740 | Krohn et al. | Jan 2004 | A1 |
20040034632 | Carmel et al. | Feb 2004 | A1 |
20040049486 | Scanlon | Mar 2004 | A1 |
20040059708 | Dean et al. | Mar 2004 | A1 |
20040083205 | Yeager | Apr 2004 | A1 |
20040093325 | Banerjee et al. | May 2004 | A1 |
20040119740 | Chang et al. | Jun 2004 | A1 |
20040122811 | Page | Jun 2004 | A1 |
20040153472 | Rieffanaugh, Jr. | Aug 2004 | A1 |
20040158560 | Wen et al. | Aug 2004 | A1 |
20040186828 | Yadav | Sep 2004 | A1 |
20040186996 | Gibbs et al. | Sep 2004 | A1 |
20040199419 | Kim et al. | Oct 2004 | A1 |
20040215607 | Travis, Jr. | Oct 2004 | A1 |
20050015366 | Carrasco et al. | Jan 2005 | A1 |
20050027691 | Brin et al. | Feb 2005 | A1 |
20050033803 | Vleet et al. | Feb 2005 | A1 |
20050050014 | Gosse et al. | Mar 2005 | A1 |
20050055342 | Bharat et al. | Mar 2005 | A1 |
20050055345 | Ripley | Mar 2005 | A1 |
20050060290 | Herscovici et al. | Mar 2005 | A1 |
20050060310 | Tong et al. | Mar 2005 | A1 |
20050060311 | Tong et al. | Mar 2005 | A1 |
20050071741 | Acharya et al. | Mar 2005 | A1 |
20050102282 | Linden | May 2005 | A1 |
20050125376 | Curtis et al. | Jun 2005 | A1 |
20050160083 | Robinson | Jul 2005 | A1 |
20050192946 | Lu et al. | Sep 2005 | A1 |
20050198026 | Dehlinger et al. | Sep 2005 | A1 |
20050222987 | Vadon | Oct 2005 | A1 |
20050222998 | Driessen et al. | Oct 2005 | A1 |
20050240576 | Piscitello et al. | Oct 2005 | A1 |
20050240580 | Zamir et al. | Oct 2005 | A1 |
20050256848 | Alpert et al. | Nov 2005 | A1 |
20060047643 | Chaman | Mar 2006 | A1 |
20060069667 | Manasse et al. | Mar 2006 | A1 |
20060074903 | Meyerzon | Apr 2006 | A1 |
20060089926 | Knepper et al. | Apr 2006 | A1 |
20060095421 | Nagai et al. | May 2006 | A1 |
20060106793 | Liang | May 2006 | A1 |
20060173830 | Smyth et al. | Aug 2006 | A1 |
20060195443 | Franklin et al. | Aug 2006 | A1 |
20060200476 | Gottumukkala et al. | Sep 2006 | A1 |
20060200556 | Brave et al. | Sep 2006 | A1 |
20060227992 | Rathus | Oct 2006 | A1 |
20060230040 | Curtis et al. | Oct 2006 | A1 |
20060293950 | Meek | Dec 2006 | A1 |
20070005575 | Dai et al. | Jan 2007 | A1 |
20070005588 | Zhang et al. | Jan 2007 | A1 |
20070038659 | Datar et al. | Feb 2007 | A1 |
20070050339 | Kasperski | Mar 2007 | A1 |
20070061195 | Liu | Mar 2007 | A1 |
20070061211 | Ramer et al. | Mar 2007 | A1 |
20070081197 | Omoigui | Apr 2007 | A1 |
20070106659 | Lu et al. | May 2007 | A1 |
20070112730 | Gulli et al. | May 2007 | A1 |
20070130370 | Akaezuwa | Jun 2007 | A1 |
20070156677 | Szabo | Jul 2007 | A1 |
20070172155 | Guckenberger | Jul 2007 | A1 |
20070180355 | McCall | Aug 2007 | A1 |
20070192190 | Granville | Aug 2007 | A1 |
20070208730 | Agichtein | Sep 2007 | A1 |
20070214131 | Cucerzan et al. | Sep 2007 | A1 |
20070233653 | Biggs et al. | Oct 2007 | A1 |
20070255689 | Sun et al. | Nov 2007 | A1 |
20070260596 | Koran | Nov 2007 | A1 |
20070260597 | Cramer et al. | Nov 2007 | A1 |
20070266021 | Aravamudan et al. | Nov 2007 | A1 |
20070266439 | Kraft | Nov 2007 | A1 |
20070288450 | Datta et al. | Dec 2007 | A1 |
20080005064 | Sarukkai | Jan 2008 | A1 |
20080010143 | Kniaz et al. | Jan 2008 | A1 |
20080027913 | Chang et al. | Jan 2008 | A1 |
20080052219 | Sandholm et al. | Feb 2008 | A1 |
20080052273 | Pickens | Feb 2008 | A1 |
20080059453 | Laderman | Mar 2008 | A1 |
20080077570 | Tang et al. | Mar 2008 | A1 |
20080082518 | Loftesness | Apr 2008 | A1 |
20080091650 | Fontoura et al. | Apr 2008 | A1 |
20080104043 | Garg | May 2008 | A1 |
20080114624 | Kitts | May 2008 | A1 |
20080114729 | Raman et al. | May 2008 | A1 |
20080114750 | Saxena et al. | May 2008 | A1 |
20080140699 | Jones et al. | Jun 2008 | A1 |
20080162475 | Meggs et al. | Jul 2008 | A1 |
20080183660 | Szulcewski | Jul 2008 | A1 |
20080189269 | Olsen | Aug 2008 | A1 |
20080208825 | Curtis et al. | Aug 2008 | A1 |
20080228442 | Lippincott et al. | Sep 2008 | A1 |
20080256050 | Zhang et al. | Oct 2008 | A1 |
20080313168 | Liu et al. | Dec 2008 | A1 |
20080313247 | Galvin | Dec 2008 | A1 |
20090012969 | Rail et al. | Jan 2009 | A1 |
20090055392 | Gupta et al. | Feb 2009 | A1 |
20090070194 | Song | Mar 2009 | A1 |
20090157643 | Gollapudi et al. | Jun 2009 | A1 |
20090182723 | Shnitko et al. | Jul 2009 | A1 |
20090228442 | Adams | Sep 2009 | A1 |
20090287656 | Bennett | Nov 2009 | A1 |
20100106706 | Rorex et al. | Apr 2010 | A1 |
20100131563 | Yin | May 2010 | A1 |
20100205541 | Rapaport et al. | Aug 2010 | A1 |
20100228738 | Mehta et al. | Sep 2010 | A1 |
20100241472 | Hernandez | Sep 2010 | A1 |
20110064796 | Tosi et al. | Mar 2011 | A1 |
20110219025 | Lipson | Sep 2011 | A1 |
20110282906 | Wong | Nov 2011 | A1 |
20110295844 | Sun et al. | Dec 2011 | A1 |
20110295879 | Logis | Dec 2011 | A1 |
20120011148 | Rathus | Jan 2012 | A1 |
20120191705 | Tong et al. | Jul 2012 | A1 |
Number | Date | Country |
---|---|---|
WO 0077689 | Dec 2000 | WO |
WO 0116807 | Mar 2001 | WO |
WO 0167297 | Sep 2001 | WO |
WO 2004059514 | Jul 2004 | WO |
Entry |
---|
Agichtein, et al; Improving Web Search Ranking by Incorporating User Behavior Information; Aug. 2006; Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, p. 19-26. |
Agichtein, et al; Learning User Interaction Models for Predicting Web Search Result Performances: Aug. 2006; Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, p. 3-10. |
Boyan et al.; A Machine Learning Architecture for Optimizing Web Search Engines; Aug. 1996; Internet-based information systems-Workshop Technical Report-American Association for Artificial Intelligence, p. 1-8. |
Cutrell, et al.; Eye tracking in MSN Search: Investigating snippet length, target position and task types; 2007; Conference on Human Factors in Computing Systems—Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. |
Joachims; Optimizing search engines using clickthrough data; 2002; Proceedings of the ACM SIGKDD International Conference on Knowledge Discover and Data Mining, p. 133-142. |
Kelly. et al.; Implicit Feedback for Inferring User Preference: A Bibliography; SIGIR Forum, vol. 37, No. 2 (2003), pp. 18-28. |
Bar-Llan et al., “Presentation Bias is Significant in Determining User Preference for Search Results—A User X Study”; Journal of the American Society for Information Science and Technology, vol. 60, Issue 1 (p. 135-149), Sep. 2008, 15 pages. |
Bar-Llan et al.; “Methods for comparing rankings of search engine results”; Computer Networks: TheInternational Journal of Computer and Telecommunications Networking, Jul. 2006, vol. 50, Issue 10, 19 pages. |
Boldi, et al.; The Query-flow Graph: Model and Applications; CKIM '08, Oct. 26-30, Napaya Valley, California, USA, pp. 609-661. |
Burke, Robin, Integrating Knowledge-based and Collaborative-filtering Recommender Systems, AAAI Technical Report WS-99-01. Compilation copyright © 1999, AAAI (www.aaai.org), pp. 69-72. |
Craswell, et al.; Random Walks on the Click Graph; Jul. 2007; SIGIR '07, Amsterdam, the Netherlands, 8 pages. |
Diligenti, et al., Users, Queries and Documents: A Unified Representation for Web Mining, wi-iat, vol. 1, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 2009, pp. 238-244. |
Hofmann, Thomas, Latent Semantic Models for Collaborative Filtering, ACM Transactions on Information Systems, vol. 22, No. 1, Jan. 2004, pp. 89-115. |
Google News archive, Jul. 8, 2003, Webmasterworld.com, [online] Retrieved from the Internet http://www.webmasterwolrd.com/forum3/15085.htm [retrieved on Nov. 20, 2009] 3 pages. |
Gr{hacek over (e)}ar, Miha, User Profiling: Collaborative Filtering, SIKDD 2004, Oct. 12-15, 2004, Ljubljana, Slovenia, 4 pages. |
Joachims, T., Evaluating retrieval performance using clickthrough data. Proceedings of the SIGIR Workshop on Mathematical/Formal Methods in Information Retrieval; 2002, Aug. 12-15; Tampere, Finland, 18 pages. |
Joachims et al., “Search Engines that Learn from Implicit Feedback”; Aug. 2007, IEEE Computer Society. |
Linden, Greg et al., Amazon.com Recommendations: Item-to-Item Collaborative Filtering, [online], http://computer.org/internet/, IEEE Internet Computing, Jan.-Feb. 2003, IEEE Computer Society, pp. 76-80. |
U.S. Appl. No. 11/556,143, filed Nov. 2, 2006, in Office Action mailed Jan. 25, 2010, 14 pages. |
U.S. Appl. No. 11/556,143, filed Nov. 2, 2006, in Office Action mailed Jul. 6, 2010, 20 pages. |
U.S. Appl. No. 11/556,143, filed Nov. 2, 2006, in Office Action mailed Apr. 20, 2011, 18 pages. |
Nicole, Kristen, Heeii is StumbleUpon Plus Google Suggestions, [online], Retrieved from the Internet http://mashable.com/2007/05/15/heeii/, 11 pages. |
Lemire, Daniel: Scale and Translation Invariant Collaborative Filtering Systems, Published in Information Retrieval, 8(1), pp. 129-150, 2005. |
U.S. Appl. No, 11/685,095, filed Mar. 12, 2007, in Office Action mailed Feb. 8, 2010. 31 pages. |
U.S. Appl. No. 11/685,095, filed Mar. 12, 2007, in Office Action mailed Feb. 25, 2009, 21 pages. |
U.S. Appl. No. 11/685,095, filed Mar. 12, 2007, in Office Action mailed Sep. 10, 2009, 23 pages. |
U.S. Appl. No. 11/685,095, filed Mar. 12, 2007, in Office Action mailed Apr. 13, 2011, 31 pages. |
Radlinski, et al., Query Chains: Learning to Rank from Implicit Feedback, KDD '05, Aug. 21-24, 2005, Chicago, Illinois, USA, 10 pages. |
U.S. Appl. No. 11/556,086, filed Nov. 2, 2006, in Office Action mailed Jun. 23, 2010, 21 pages. |
Schwab, et al., Adaptivity through Unobstrusive Learning, 2002, 16(3), pp. 5-9. |
Stoilova, Lubomira et al., GiveALink: Mining a Semantic Network Bookmarks for Web Search and Recommendation, LinkKDD '05, Aug. 21, 2005, Chicago, IL, USA, 8 pages. |
W3C, URIs, URLs and URNs: Classification and Recommendations 1.0, Report from the joint W3C/IETF URI Planning Interest Group, Sep. 21, 2001, 8 pages. |
Xiao, et al., Measuring Similarity of Interest for Clustering Web-Users, ADC, 2001, pp. 107-114. |
Xie et al,. Web User Clustering from Access Log Using Belief Function, K-CAP '01, Oct. 22-23, 2001, Victoria, British Columbia, Canada, pp, 202-208. |
Yu et al., Selecting Relevant Instances for Efficient and Accurate Collaborative Filtering, CIKM '01, Nov. 5-10, 2001, Atlanta, Georgia, pp. 239-246. |
Zeng, et al., “Learning to Cluster Web Search Results”, SIGIR '04, Proceedings of the 27th Annual International ACM SIGIR conference on research and development in information retrieval, 2004. |
Joachims, “Evaluating Search Engines Using Clickthrough Data”, Cornell University, Department of Computer Science, Draft, Feb. 19, 2002, 13 pages. |
Jansen et al., “An Analysis of Web Documents Retrieved and Viewed”, School of Information Sciences and Technology, The Pennsylvania State University, the 4th International Conference on Internet Computing, Las Vegas, Nevada, pp. 65-69, Jun. 23-26, 2003, 5 pages. |
Soumen Chakrabarti, et al. “Enhanced Topic Distillation using Text, Markup tags, and Hyperlinks”. ACM, Sep. 9-12, 2001, pp. 208-216. |
Gabriel Somlo et al., “Using Web Hepler Agent Profiles in Query Generation”, ACM, Jul. 2003, pp. 812-818. |
Australian Patent Office Non-Final Office Action in AU App. Ser. No. 2004275274, mailed Feb. 3, 2010, 2 pages. |
Dan Olsen et al., “Query-by-critique: Spoken Language Access to Large Lists”, ACM, Oct. 2002, pp. 131-140. |
Susan Gauch et al., “A Corpus Analysis Approach for Automatic Query Expansion and its Extension to Multiple Databases”, ACM, Jul. 1999, pp. 250-269. |
Nicolas Bruno et al., “Top-K Selection Queries over Relational Databases: Mapping Strategies and Performance Evaluation”, ACM, Jun. 2002, pp. 153-187. |
Ji-Rong Wen et al., “Query Clustering using User Logs”, ACM, Jan. 2002, pp. 59-81. |
Brin, S. and L. Page, The Anatomy of a Large-Scale Hypertextual Web Search Engine, Computer Science Department, Apr. 1998. |
International Search Report and Written Opinion for Application No. PCT/US2004/029615, dated Jan. 19, 2005, 8 pages. |
Hungarian Patent Office, International Search Report and Written Opinion for Application No. 200806756-3, dated Nov. 19, 2010 12 pages. |
Authorized Officer Athina Nickitas-Etienne, International Preliminary Report and Written Opinion for Application No. PCT/US2004/029615, mailed Mar. 23, 2006. |
Indian Office Action in Indian Application No. 686/KOLNP/2006, mailed Jun. 3, 2008, 2 pages. |
Danish Search Report and Written Opinion for Application No. 200601630-7, dated Jun. 21, 2007, 15 pages. |
Jones et al., “Pictures of Relevance: A Geometric Analysis of Similarity Measures”, Journal of the American Society for Information Science, Nov. 1987, 23 pages. |
Kaplan et al., “Adaptive Hypertext Navigation Based on User Goals and Context”, User Modeling and User-Adapted Interaction 2, Sep. 1, 1993; pp. 193-220, 28 pages. |
Liddy et al., “A Natural Language Text Retrieval System With Relevance Feedback”, 16th National Online, May 2-6, 1995, 3 pages. |
Number | Date | Country | |
---|---|---|---|
Parent | 12331872 | Dec 2008 | US |
Child | 13617688 | US |