US6006222A - Method for organizing information - Google Patents

Method for organizing information Download PDF

Info

Publication number
US6006222A
US6006222A US08/904,795 US90479597A US6006222A US 6006222 A US6006222 A US 6006222A US 90479597 A US90479597 A US 90479597A US 6006222 A US6006222 A US 6006222A
Authority
US
United States
Prior art keywords
search query
key
user
term
articles
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US08/904,795
Inventor
Gary Culliss
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
IAC Search and Media Inc
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to US08/904,795 priority Critical patent/US6006222A/en
Application filed by Individual filed Critical Individual
Priority to US08/960,140 priority patent/US6014665A/en
Priority to US09/041,411 priority patent/US6078916A/en
Priority to AU20351/99A priority patent/AU2035199A/en
Priority to PCT/US1998/015109 priority patent/WO1999006924A1/en
Priority to US09/259,600 priority patent/US6182068B1/en
Assigned to DIRECT HIT TECHNOLOGIES, INC. reassignment DIRECT HIT TECHNOLOGIES, INC. EXCLUSIVE LICENSE Assignors: CULLISS, GARY
Publication of US6006222A publication Critical patent/US6006222A/en
Application granted granted Critical
Assigned to ASK JEEVES, INC. reassignment ASK JEEVES, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CULLISS, GARY A.
Priority to US09/684,209 priority patent/US6539377B1/en
Priority to US10/392,510 priority patent/US6816850B2/en
Assigned to IAC SEARCH & MEDIA, INC. reassignment IAC SEARCH & MEDIA, INC. CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: ASK JEEVES, INC.
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/951Indexing; Web crawling techniques
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9538Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/958Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99931Database or file accessing
    • Y10S707/99933Query processing, i.e. searching
    • Y10S707/99935Query augmenting and refining, e.g. inexact access

Definitions

  • the present invention relates to search engines, and more particularly pertains to a method for organizing information by monitoring the search activity of users.
  • the Internet is an extensive network of computer systems which allows a user to connect with various computer servers or systems.
  • the Internet permits users to send and receive data between computers connected to this network.
  • This data may include web sites, home pages, databases, text collections, audio, video or any other type of information made available over the Internet (collectively referred to as "articles") from a computer server connected to the Internet.
  • the articles may also include key terms representing selected portions of the information contained in the article. These key terms are available over the Internet to other computers and permit these other computers to locate the article.
  • a user of a remote computer searches for the key terms using a search program known as a search engine.
  • search engines currently available on the Internet include "Yahoo! (TM), "Excite” (TM), and "Alta Vista” (TM). These programs allow the remote user to type in one or more search terms, typically as a combination of English words.
  • the search terms may be connected by Boolean logic operators or may be truncated and combined with wild card terms to form a search query.
  • the search engine compares the search query with the key terms from the articles and retrieves at least a portion of the articles having key terms which match the search query.
  • the search engine will then display to the user the portion of the article such as the title. The user can then scroll through these retrieved portions of the articles and select a desired article.
  • a person who places an article on the Internet typically intends for it to be available to all people who type in search terms that are even remotely related to the subject matter of the article. This increases the exposure of the article to the public searching the Internet. Such increased exposure can potentially increase product sales or advertising revenue for the owner of the article, especially if advertising revenue is related to the number of visits to the article or web site.
  • some articles or search engines use every word in the article as key terms. As a result, search engines will retrieve many articles which are unrelated to the subject matter which the user desires to find through a combination of search terms.
  • the present invention generally comprises a method of organizing information in which the search activity of a user is monitored and such activity is used to organize articles displayed in the search results.
  • the invention operates by assigning scores to key terms and categories for articles. As users enter search queries and select articles, the scores are altered. The scores are then used in subsequent searches to organize the articles that match a search query.
  • the method allows the search activity of a large number of Internet users to organize the information available over the Internet through an evolutionary process.
  • FIG. 1 illustrates in flow diagram form the operational steps taken by the system.
  • the Internet is an extensive network of computer systems which allows a user to connect with various computer servers or systems.
  • the Internet permits users to send and receive data between the computers connected to this network.
  • the data can be read, viewed or listened to on a browser or other software program from over the Internet on a remote user's computer.
  • This data may comprise articles, databases, data collections, web sites, web pages, graphics, encryption, audio, video or any other type of information collectively referred to as articles and designated herein by the generic labels A1, A2, A3, etc.
  • the present invention maintains an index of key words, terms, data or identifiers in English or other languages, computer code, or encryption which are collectively referred to as key terms and represented herein by the generic labels Alpha, Beta, Gamma, Delta, Epsilon, etc.
  • the articles are each associated with one or more of these key terms by any conceivable method of association, such as through indexing all words or through meta-tag headers containing key words selected by the author or editor. Further, a key term score is associated with each article for each of the key terms. For example, an initial index setting may look like this:
  • the invention will accept a search query from a user and a search engine will identify key terms which match the search query. These key terms which match the search query are called matched key terms.
  • the search engine then identifies in any conceivable manner the articles which are associated with the matched key terms. This can be done by comparing all or part of the search query, or terms equivalent to those in the search query with the key terms in the index to identify the key terms which match the search query.
  • the search engine may account for Boolean logic operators in the search query.
  • a search query of "Alpha AND Gamma" would identify articles A1 and A3 because they are both associated with the matched key terms Alpha and Gamma. Because articles A1 and A3 are associated with the matched key terms, these articles are called matched articles.
  • the search engine will then display a squib of each of the matched articles.
  • the squib may comprise any portion, hypertext link to or representation of the matched article, such as the title, headings, first few lines of text, audio, video or any other type of information.
  • the user can then scroll through the squibs of the articles and select a desired one of the matched articles by opening, retrieving, reading, viewing, listening to or otherwise closely inspecting the article from over the Internet or from any other storage area.
  • the matched article selected by the user is called the selected matched article.
  • the index can be altered such that the key term scores for the selected matched article under the matched key terms are altered relative to other key term scores. This indicates that the user believes that the matched key terms for that selected matched article are properly associated with the selected matched article.
  • a positive score such as (+1) can be added to the key term scores, for example, although any other possible indication can be used and the key term scores can be altered by any possible type of operation, mathematical or otherwise, to alter the key term scores for the selected matched article under the matched key terms relative to other key term scores.
  • the search engine would display the squib of matched articles A1 and A3. If the user selected only article A3, the index could be altered such that the key term scores for the selected matched article A3 under the matched key terms Alpha and Gamma are altered relative to the other key term scores. The index would then look like this:
  • the invention could then rank the matched articles by using the key term scores, as shown in FIG. 1 at 50 and 60.
  • the key term scores of each matched article under each of the matched key terms of the new search could then be associated in any possible manner to create a comparison score for each matched article.
  • the key term scores could be added, multiplied together or averaged to create the comparison score for that matched article.
  • the matched articles can then be displayed to the user in order of comparison score superiority, such as by displaying the matched article with the highest comparison score first.
  • the search query "Alpha AND Epsilon" would again identify matched articles A1 and A3.
  • the comparison score for article A1 would equal 1
  • the comparison score for article A3 would be 2.
  • the invention would then display the matched article A3 to the user in a superior position to matched article A1.
  • the invention may include a key term total score for each key term score of each article under each key term.
  • the index could then be altered such that the key term total score of each matched article under each matched key term is altered relative to other key term total scores.
  • the index could be altered in this manner after each search query is entered or after any other event, such as after the user has selected one or more articles or has read a matched article for a predetermined length of time.
  • the index could have an initial setting such as is shown here where the key term scores are separated from the key term total scores by a backslash (/) and given an initial value of one.
  • the key term score for article A3 under the matched key terms Alpha and Gamma would be altered relative to other key term scores. Further, the key term total scores for both article A1 and article A3 under the matched key terms could also be altered. If the positive score is added to the key term scores for the selected matched article A3 under the matched key terms Alpha and Gamma, and the positive score is added to the key term total scores for the matched articles A1 and A3 (regardless of whether they were selected or not) under the matched key terms, the index would then look like this:
  • the invention could then organize or rank the articles by first comparing the key term scores as related to the respective key term total scores for each of the matched articles under each matched key term to create a key term probability score for that matched article under each respective matched key term from the new search.
  • the key term scores of each matched article under each of the matched key terms could be compared or associated with their respective key term total score in any known manner to create the key term probability scores for that matched article under the respective matched key terms.
  • the key term scores of each matched article under the matched key terms could be divided by their respective key term total score to create the key term probability score of that matched article under that matched key term.
  • the key term probability scores of each matched article under each of the matched key terms could then be associated in any known manner to create the comparison score for each matched article identified in the search. For example, the key term probability scores could be added, multiplied or averaged together to create the comparison score for that matched article.
  • the articles can then be displayed to the user in order of superiority, such as by displaying the article with the highest comparison score first.
  • the new and different search query "Alpha AND Epsilon" would again identify matched articles A1 and A3.
  • the key term probability score for matched article A1 under the key term Alpha would equal the key term score of 1 divided by the key term total score of 2, for a key term probability score of 0.5.
  • the key term probability score for matched article A2 under the key term Alpha would equal the key term score of 2 divided by the key term total score of 2, for a key term probability score of 1.
  • the key term probability score for matched article A1 would be 1, and the key term probability score for matched article A3 would also be 1, as neither of these scores has been altered from the initial setting in this example.
  • the comparison score for article A1 would equal 0.5, whereas the comparison score for article A3 would be 1.
  • the invention could then display the article A3 to the user in a superior position to article A1 because the comparison score for matched article A3 is higher.
  • the index may include matching associations of two or more key terms.
  • each key term is grouped with one or more other key terms in a matrix format.
  • Single key terms can be represented by a grouping of identical terms.
  • articles are listed in the boxes formed at the intersection of the rows and columns of the matrix to indicate that such articles are associated with the intersecting key terms.
  • the index is shown in pair groupings, the index can be extended to include triplicate or other associations as well, i.e. separate boxes for Alpha-Beta-Gamma combinations, etc.
  • the index shown below has empty boxes because some intersecting groupings are substantially equivalent to other intersecting groupings. As such, one of these intersecting groupings, i.e. Alpha-Beta or Beta-Alpha, can be left blank. Alternatively, the equivalent groupings could be used to record and distinguish between the order of key terms in a search query. In other words, a search query of "Alpha AND Beta" could include the grouping Alpha-Beta, whereas the search query "Beta AND Alpha” would include the grouping Beta-Alpha. In such case, the empty boxes in the matrix would be used.
  • article A1 is the only article which is associated with both the key terms Alpha and Beta. Accordingly, article A1 can be listed in at least the Alpha-Alpha box, in the Alpha-Beta box, and in the Beta-Beta box, for example. Doing this for all key term groupings of the articles in the example above would give an initial index that looked like this:
  • an entered search query would typically include one or more key terms.
  • the search engine could separate these key terms into one or more groupings.
  • the search query "Alpha AND Beta" could have only the one grouping Alpha-Beta, or could be separated into three groupings: Alpha-Alpha, Beta-Beta, and Alpha-Beta.
  • the search query "Alpha AND Beta AND Gamma” could have three groupings: Alpha-Beta, Beta-Gamma, and Alpha-Gamma, but could additionally include the single groupings Alpha-Alpha, Beta-Beta, and Gamma-Gamma.
  • a more complex query such as "Alpha AND (Beta OR Gamma)" could have the groupings Alpha-Beta and Alpha-Gamma, and could additionally include the single groupings Alpha-Alpha, Beta-Beta, and Gamma-Gamma.
  • the invention will then accept a search query from a user and a search engine will identify articles which are indexed with the key terms that match the search query.
  • a search query of "Alpha AND Gamma” would identify matched articles A1 and A3 because they are both indexed with the key term groupings Alpha-Alpha, Gamma-Gamma, and Alpha-Gamma.
  • the key term groupings which match the search query are called matched key term groupings.
  • the search engine will then display a squib of each of the matched articles. The user can then scroll through the squibs of the articles and select a desired one of the matched articles.
  • the key term scores for the selected matched article under the matched key term groupings can be altered to indicate that the user believes that those matched key term groupings are properly associated with the selected matched article.
  • the positive score can be added to the key term scores, although any other possible type of indication can be used.
  • the key term scores for selected matched article A3 under the matched key term groupings Alpha-Gamma would be altered. Additionally, the key term scores for selected matched article A3 under the matched key term groupings Alpha-Alpha and Gamma-Gamma could also be altered since the key terms Alpha and Gamma are each represented individually in the results of the search query.
  • the index would then look like this:
  • the invention could then organize the articles by first comparing the key term scores as related to the key term total scores for each of the matched articles under each matched key term grouping.
  • the key term scores of each matched article under each of the matched key term groupings could then be compared or associated with the respective key term total score in any known manner to create the key term probability score for that matched article under each matched key term grouping.
  • the key term scores of each matched article under the matched key term groupings could be divided by the respective key term total score to create the key term probability score for that matched article under those respective key term groupings.
  • the key term probability scores of each matched article under each of the matched key term groupings could then be associated in any known manner to create the comparison score for each matched article. For example, the key term probability scores could be multiplied together to create the comparison score for that matched article for the search query.
  • the matched articles can then be displayed to the user in order of superiority, such as by displaying the matched article with the highest comparison score first.
  • a new user entering the search query "Alpha AND Gamma" would result in the search engine again identifying matched articles A1 and A3.
  • the key term probability score for matched article A1 would equal the key term score of 1 divided by the key term total score of 2, for a key term probability score of 0.5.
  • the key term probability score for selected matched article A2 under the key term grouping Alpha-Alpha would equal the key term score of 2 divided by the key term total score of 2, for a key term probability score of 1.
  • the key term probability score for matched article A1 would be 0.5, and the key term probability score for selected matched article A3 would equal 1.
  • the key term probability score for the matched article A1 would equal 0.5, and the key term probability score for selected matched article A3 would equal 1.
  • the comparison score for article A1 would equal 0.5 times 0.5 times 0.5, for a total of 0.125.
  • the comparison score for article A3, on the other hand, would equal 1 times 1 times 1, for a total of 1.
  • the invention could then display the article A3 to the user in a superior position to article A1 because the comparison score for matched article A3 is higher.
  • the invention can also be used to organize articles by category.
  • the key terms of the index may simply comprise category key terms represented by the generic labels CAT1, CAT2, CAT3, CAT4, etc.
  • the articles can each be associated with one or more of these category key terms, and the key term score is associated with each article for each of the category key terms.
  • the index may also include the key term total score for each category key term score of each article, as described above for the key terms.
  • an initial index setting may look like this:
  • This embodiment of the invention operating separately from or in addition to the embodiments described above, would permit the user to enter or select a category key term for inclusion in the search query.
  • the invention would operate in a similar manner for the category key terms as described above for the key terms alone.
  • the invention may allow a user to enter one or more category key terms in formulating a search. For example, the user may enter the category key terms "Apartments” and “Los Angeles” or the category key terms "Romantic” and “Comedy” to find articles (i.e. advertisements or movies) which fall under two or more category key terms.
  • the category key terms can be incorporated into the index of key terms as just another key term and included in the association of the comparison score and, if used, the key term probability scores.
  • the category key terms can have a similar weight as other key terms or may be increasingly or decreasingly weighted to represent relative importance of the categories to the search query.
  • An example of such an index wherein all articles are initially equally ranked in all categories and under all key terms is shown below.
  • This embodiment of the invention works in a substantially similar manner as the key term groupings described above, except that the key term groupings may also include a category key term.
  • the search query "CAT1 AND Beta" could include just the one grouping CAT1-Beta, or could be separated into three groupings: CAT1-CAT1, Beta-Beta, and CAT1-Beta.
  • the category key terms can be incorporated into one side of the index of key terms and associated with the key terms in the index to form the key term groupings.
  • the category key terms each function as just another key term to form the key term groupings and are included in the association of the comparison score and, if used, the key term probability scores.
  • the category key terms can have a similar weight as other key terms or may be increasingly or decreasingly weighted to represent relative importance of the categories to the search query. An example of such an index wherein all articles are initially equally ranked in all categories is shown below.
  • This variation also works in a substantially similar manner as the key term groupings described above, with the key term groupings each including a category key term associated with a key term. For example, a key term grouping for the search query "CAT1 AND Beta" would have just the one grouping CAT1-Beta, and the key term grouping for the search query "CAT1 AND Alpha AND Beta” would have the two key term groupings CAT1-Alpha and CAT1-Beta.
  • the invention can also be used to organize articles by ratings.
  • the key terms of the index may additionally or alternatively comprise rating key terms represented by the generic labels G-Rated and X-Rated, for example.
  • the rating key term G-Rated is considered appropriate for all ages, while the rating key term X-Rated is considered appropriate only for adults.
  • the articles are each initially associated with one or more of these rating key terms by any possible manner such as by human judgment or default association.
  • the key term score is associated with each article for each of the rating key terms. Additionally, the index may also include the key term total score for each rating key term score of each article, as described above for the key terms.
  • the rating key terms can be incorporated into the index of key terms and included in the association of the comparison score and, if used, the key term probability score.
  • the rating key terms can have a similar weight as other key terms or may be increasingly or decreasingly weighted.
  • an initial index setting may look like this:
  • the invention operating separately from or in addition to the manner described above, would permit or require the user to enter a rating key term in the search query.
  • the invention would operate in a similar manner for the rating key terms as described above for the key terms alone, whereby the search activity of the user would alter the key term scores and key term total scores for the rating key terms.
  • the key term score for article A3 under the rating key term X-Rated would be altered relative to the other rating key term scores.
  • the key term total score for matched articles A1, A2 and A3 would also be altered. If the positive score is added to the key term scores for the selected matched article A3, and the positive score is added to the key term total score for the matched articles A1, A2 and A3, the index would then look like this:
  • X-Rated material can then be screened entirely from the rating key term of G-Rated by precluding articles entirely from the search results which have a key term probability score or comparison score for the rating key term X-Rated above a predetermined threshold.
  • index may look like this:
  • the invention would screen the article A3 (i.e. prevent the squib from being displayed) from search queries containing the rating key term of G-Rated.
  • the rating key terms for articles A1 and A2 under the X-Rated key term are low and suggest that these articles A1 and A2 do not contain adult content. Accordingly, these articles could be displayed in response to a search query containing a rating key term of G-Rated.
  • the rating key term scores could be permanently or temporarily attached to each article (such as incorporated into a meta-tag) so that articles which are downloaded by persons authorized to access X-rated articles cannot be e-mailed to persons not authorized to receive such articles.
  • the e-mail browser could have software incorporated therein which checks the rating key term score of any attached articles and screens out those articles which have an X-Rated key term score above the predetermined threshold.
  • the present invention is intended to operate in any form of networked or stand alone computer or computer system.
  • the program can be run on a server connected to the Internet.
  • a user having a remote computer connected to the Internet can access the program over the Internet via a browser or other program and enter a search query from the remote site.
  • the program on the server can generate a list of matched articles, by any method such as described herein, and transmit a list of squibs, such as hypertext links or other article identifiers to the remote computer for display on the screen.
  • the user can then select one of the articles by "clicking" on the squib or other identifier, for example.
  • clicking is generally meant any electronic selection of the article and is specifically meant the positioning an electronic pointer on the squib of the article displayed on the screen via a mouse or other pointing device and operating the button or switch of the mouse one or more times to direct a browser to access the article or any other portion thereof.
  • the browser of the remote computer will retrieve the data of the article from the server URL indicated by the hypertext link.
  • the remote computer can send a data packet to the search server to indicate which matched article the user selected.
  • the invention can send a message to the search server or other location to indicate the selected article either before or after the article is retrieved, opened, listened or otherwise viewed by the user for any amount of time, or after a pre-determined amount of time.
  • the remote computer could send a message to the search server after the remote user has selected a matched article and had the article open for more than a predetermined length of time. This would indicate that the article was what the user was searching for and indicate a stronger correlation between the search query and the selected matched article.
  • the invention may be incorporated into a client-side or server-side software interface which accepts or otherwise records a search query which is forwarded or input directly to another search engine available over the Internet. That search engine can then generate a list of matched articles which is then forwarded to the software interface wherein the organization method described herein is utilized to rank the articles.
  • the invention can be simply incorporated into the search engine as a single server-side or client-side software program.
  • the invention may initially or continuously utilize the ranking of the articles provide by a search engine.
  • the index of the invention may be initially empty or set to a neutral setting and subsequently populated through repeated uses of the invention, whereby the invention "learns" from each user. Each subsequent user would thus benefit from the prior human judgements about which key terms or groupings are relevant to which articles.
  • the organization or ranking provided by the search engine could initially be used in displaying the articles. Then, after a predetermined event or amount of time occurs, only the index of the invention could be used to organize the articles, if desired.
  • the comparison scores could be continuously combined with the ranking provided by the search engine to supplement or correct such a ranking.
  • the search engine may rank or organize the articles by providing a relevancy score, such as the percentile relevancy provided by the search engines "Excite” (TM) or “Lycos” (TM). This percentile could be associated (such as by averaging or multiplying) with the comparison score generated by the invention to create another comparison score that is then used to rank or organize the articles.
  • TM percentile relevancy
  • TM percentile relevancy
  • TM percentile relevancy
  • the index of the present invention may comprise a database, spreadsheet or any other means of storing (temporarily or otherwise) the scores or other information about the key terms and articles.
  • the present invention may also be incorporated in a search engine, browser, or other data managing program.
  • the scores or other information may also be integrated or otherwise associated with any index of key terms used by any search engine, browser, or other data managing program.
  • the index may include key terms, category key terms and ratings key terms.
  • a search query may comprise one or more key terms coupled with a category key term and/or a rating key term.
  • a search query may comprise one or more key terms coupled with a category key term and/or a rating key term.
  • a user could first select one or more category key terms.
  • the category key terms can be selected through a hierarchical structure of key terms, i.e. Real Estate; Rental; Apartments; Los Angeles.
  • the user can then enter or add onto the category key term a search query of one or more key terms such as words.
  • the total search query could then include the category key terms and the words as key terms.
  • a rating key term could also be added to the search query. This search query would then be processed as described above.
  • a search query could be separated not only into its component key terms, but also into key terms or key term groupings that include synonyms or otherwise analogous or equivalent key terms.
  • the search query "Car and Chrysler” could include the following key terms: Car, Automobile, Vehicle, Chevrolet, Chevy. If separated into key term groupings, there could be the key term groupings, Car-Chevrolet, Car-Chevy, Automobile-Chevrolet, Automobile-Chevy, Vehicle-Chevrolet and Vehicle-Chevy. These key terms or key term groupings could then all be altered as described above as the user selects and ignores certain of the matched articles.
  • the key terms, category key terms and rating key terms may be associated with words or other information in the article, or may be arbitrarily associated with the article in any manner.
  • the associations may be created by an indexing software robot which indexes all words in the article as key terms, meta tags specified by the author, reviewer or editor, or by any other means known or later developed for associating certain key terms with each article.
  • the scores in the index are initially shown at 1, they can be initially set to any desired score.
  • the scores can be initially set to correspond with the frequency of the term occurrence in the article.
  • a human editor could assign scores according to judgments made by such editor.
  • the key term probability score can be created by any possible association between one or more of the key term scores and one or more of the key term total scores for the matched article under one or more of the matched key terms.
  • the comparison score can be created by any possible association between one or more of the key term scores and/or one or more of the key term total scores and/or one or more of the key term probability scores for the matched article under one or more of the matched key terms.
  • the squib may comprise any portion or representation of the matched article, such as the title, headings, first few lines of text, audio, video or any other type of information.
  • the altering of the index may affect only those articles which the user has had a chance to view the squib of and either select or not select. For example, suppose over 1000 matched articles are identified, and the user views only the squibs of the first 20 articles and selects one of these articles. The matched articles having squibs displayed on screen are called displayed matched articles.
  • the index can be altered so as to alter the key term total scores of only the displayed matched articles under the matched key terms. In this manner, the scores of matched articles which are not seen by the user are not altered relative to other scores.
  • the index has been shown as listing the key terms and positioning the articles "under” the key terms, the index may be configured in any desired manner which allows the articles and scores to be associated with the key terms in any manner.
  • the index may be configured such that the key terms are positioned "under” the articles. An example of such an index is shown below.
  • the key term score for that matched article under that key term can be assigned a negative score.
  • the negative score can be (-1), for example.
  • the negative score implies that the user believes that the article should not be associated with that key term. This is because the user has performed a search with a search query containing that matched key term and has not selected that matched article from that search.
  • the key term score for that matched article under that matched key term can be assigned a neutral score.
  • the neutral score can be (0), for example. The neutral score implies that the user neither believes nor disbelieves that the article should be associated with that matched key term.
  • Another method of altering the index may comprise altering the key term scores and/or key term total scores by a first positive score for certain actions, such as simply opening the article for viewing or listening, and altering the key term scores and/or key term total scores by a second positive score for certain actions such as downloading, reading the entire article or reading the article for a predetermined length of time (i.e. determined as having the article open for a predetermined length of time while scrolling through the article on the screen).
  • the second positive score is greater than the first positive score such that certain actions by the user which are more likely to indicate the relevance of the article to the key words of the search query affect the index greater than certain actions which may be considered "noise" in the searcher's activity, i.e. such as what occurs when a user begins "surfing the net" aimlessly during a search query.
  • score marking, indicia, indicator, data element, or other identifier, whether in computer code, a readable language, encryption, or any other method of data, all of which are collectively referred to as score.
  • the names positive, negative and neutral as used in the scores do not necessarily refer to positive or negative numbers, but instead refer to whether an article has received a positive vote, a negative vote, or a neutral vote.
  • the search activity of a user can be stored in the form of what are commonly known in the computer industry as "cookies. " For example, the key terms and/or key term groupings and scores for certain articles as a result of the search activity of the user could be stored as one or more cookies. These cookies could then be periodically downloaded to a central location for inclusion in the index, whereby the data from the cookies would be used to alter the index as described herein.

Abstract

A method of organizing information in which the search activity of a user is monitored and such activity is used to organize articles in a subsequent search by the same or another user who enters a similar search query. The invention operates by assigning scores to articles under the key terms in the index. As users enter search queries and select articles, the scores are altered. The scores are then used in subsequent searches to organize the articles that match a search query. As millions of people use the Internet, type in millions of search queries, and display or select from the many articles available over the Internet, the ranks the information available over the Internet through an evolutionary process. The invention includes additional embodiments which incorporate category key terms and rating key terms.

Description

RELATED APPLICATION
This patent application is a continuation-in-part of co-pending patent application, Ser. No. 08/840,922, filed Apr. 25, 1997, also entitled "Method for Organizing Information."
BACKGROUND OF THE INVENTION
1. Related Disclosures
This patent application contains subject matter disclosed in Disclosure Document Numbers 411,887; 417,369 and 417,458.
2. Field of the Invention
The present invention relates to search engines, and more particularly pertains to a method for organizing information by monitoring the search activity of users.
3. Description of the Prior Art
The Internet is an extensive network of computer systems which allows a user to connect with various computer servers or systems. The Internet permits users to send and receive data between computers connected to this network. This data may include web sites, home pages, databases, text collections, audio, video or any other type of information made available over the Internet (collectively referred to as "articles") from a computer server connected to the Internet. The articles may also include key terms representing selected portions of the information contained in the article. These key terms are available over the Internet to other computers and permit these other computers to locate the article.
To locate articles on the Internet, a user of a remote computer searches for the key terms using a search program known as a search engine. Examples of search engines currently available on the Internet include "Yahoo!" (TM), "Excite" (TM), and "Alta Vista" (TM). These programs allow the remote user to type in one or more search terms, typically as a combination of English words. The search terms may be connected by Boolean logic operators or may be truncated and combined with wild card terms to form a search query. The search engine then compares the search query with the key terms from the articles and retrieves at least a portion of the articles having key terms which match the search query. The search engine will then display to the user the portion of the article such as the title. The user can then scroll through these retrieved portions of the articles and select a desired article.
Conventional key word searching and various prior art methods of accomplishing such key word searching are disclosed in at least the following patents:
______________________________________                                    
U.S. Pat. No.                                                             
            Title                                                         
______________________________________                                    
5,588,060   METHOD AND APPARATUS FOR A                                    
            KEY-MANAGEMENT SCHEME FOR                                     
            INTERNET PROTOCOLS;                                           
5,546,390   METHOD AND APPARATUS FOR RADIX                                
            DECISION PACKET PROCESSING;                                   
5,528,757   ROUTING SYSTEM FOR RETRIEVING                                 
            REQUESTED PROGRAM BY DISCARDING                               
            RECEIVED PROGRAM IDENTICAL WITH                               
            STORED PROGRAMS AND                                           
            TRANSFERRING THE RECEIVED                                     
            PROGRAM NOT IDENTICAL WITH                                    
            STORED PROGRAMS;                                              
5,377,355   METHOD AND APPARATUS FOR                                      
            AUTOMATED PROCEDURE INITIATION                                
            IN A DATA PROCESSING SYSTEM                                   
            INCLUDING SOLICITING AN                                       
            EVALUATION VOTE FROM USERS                                    
            AUTOMATICALLY DETERMINED IN                                   
            RESPONSE TO IDENTIFICATION OF A                               
            FUNCTIONAL AREA ASSOCIATED WITH                               
            A DOCUMENT;                                                   
5,404,507   APPARATUS AND METHOD FOR                                      
            FINDING RECORDS IN A DATABASE                                 
            BY FORMULATING A QUERY USING                                  
            EQUIVALENT TERMS WHICH                                        
            CORRESPOND TO TERMS IN THE                                    
            INPUT QUERY;                                                  
5,408,586   HISTORICAL DATABASE TRAINING                                  
            METHOD FOR NEURAL NETWORKS;                                   
5,408,655   USER INTERFACE SYSTEM AND                                     
            METHOD FOR TRAVERSING A                                       
            DATABASE;                                                     
5,371,676   APPARATUS AND METHOD FOR                                      
            DETERMINING DATA OF COMPOUND                                  
            WORDS;                                                        
5,185,888   METHOD AND APPARATUS FOR DATA                                 
            MERGING/SORTING AND SEARCHING                                 
            USING A PLURALITY OF BIT-SLICED                               
            PROCESSING UNITS;                                             
4,967,341   METHOD AND APPARATUS FOR                                      
            PROCESSING DATA BASE;                                         
______________________________________                                    
A person who places an article on the Internet typically intends for it to be available to all people who type in search terms that are even remotely related to the subject matter of the article. This increases the exposure of the article to the public searching the Internet. Such increased exposure can potentially increase product sales or advertising revenue for the owner of the article, especially if advertising revenue is related to the number of visits to the article or web site. Thus, there is an incentive to use as many search terms as are possibly related to the article. In fact, some articles or search engines use every word in the article as key terms. As a result, search engines will retrieve many articles which are unrelated to the subject matter which the user desires to find through a combination of search terms.
Further, some Internet users are not skilled in selecting and connecting key word search queries. These users will often type in a single word or two words connected by an "AND" operator. These searches are extremely broad and often retrieve thousands of articles which the user must manually search through by examining the title or other brief information about each article to find the desired information or advertisement.
As the total number of articles posted on the Internet continues to increase, there is an increasing number of articles retrieved with each search query. To find an article, the user must manually search through the retrieved articles and/or repeatedly modify the search query.
OBJECTS AND SUMMARY OF THE INVENTION
Accordingly, it is an object of the invention to organize articles available on the Internet.
It is another object of the present invention to monitor searching activity to organize articles in accordance with the searching activity of one or more users.
To accomplish these and other objects, the present invention generally comprises a method of organizing information in which the search activity of a user is monitored and such activity is used to organize articles displayed in the search results. The invention operates by assigning scores to key terms and categories for articles. As users enter search queries and select articles, the scores are altered. The scores are then used in subsequent searches to organize the articles that match a search query. The method allows the search activity of a large number of Internet users to organize the information available over the Internet through an evolutionary process.
This brief description sets forth rather broadly the more important features of the present invention in order that the detailed description thereof that follows may be better understood, and in order that the present contributions to the art may be better appreciated. There are, of course, additional features of the invention that will be described hereinafter and which will be for the subject matter of the claims appended hereto.
In this respect, before explaining a preferred embodiment of the invention in detail, it is understood that the invention is not limited in its application to the details of the method set forth in the following description. The invention is capable of other embodiments and of being practiced and carried out in various ways. Also, it is to be understood, that the phraseology and terminology employed herein are for the purpose of description and should not be regarded as limiting.
As such, those skilled in the art will appreciate that the conception, upon which disclosure is based, may readily be utilized as a basis for designing other methods and systems for carrying out the objects and purposes of the present invention. It is important, therefore, that the claims be regarded as including such equivalent constructions insofar as they do not depart from the spirit and scope of the present invention.
DESCRIPTION OF THE DRAWING
FIG. 1 illustrates in flow diagram form the operational steps taken by the system.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
The Internet is an extensive network of computer systems which allows a user to connect with various computer servers or systems. The Internet permits users to send and receive data between the computers connected to this network. The data can be read, viewed or listened to on a browser or other software program from over the Internet on a remote user's computer. This data may comprise articles, databases, data collections, web sites, web pages, graphics, encryption, audio, video or any other type of information collectively referred to as articles and designated herein by the generic labels A1, A2, A3, etc.
The present invention maintains an index of key words, terms, data or identifiers in English or other languages, computer code, or encryption which are collectively referred to as key terms and represented herein by the generic labels Alpha, Beta, Gamma, Delta, Epsilon, etc.
The articles are each associated with one or more of these key terms by any conceivable method of association, such as through indexing all words or through meta-tag headers containing key words selected by the author or editor. Further, a key term score is associated with each article for each of the key terms. For example, an initial index setting may look like this:
______________________________________                                    
Index                                                                     
Alpha    Beta    Gamma       Delta Epsilon                                
______________________________________                                    
A1 - 1   A1 - 1  A1 - 1      A2 - 1                                       
                                   A1 - 1                                 
A2 - 1           A3 - 1      A3 - 1                                       
                                   A3 - 1                                 
A3 - 1                                                                    
______________________________________                                    
The invention will accept a search query from a user and a search engine will identify key terms which match the search query. These key terms which match the search query are called matched key terms. The search engine then identifies in any conceivable manner the articles which are associated with the matched key terms. This can be done by comparing all or part of the search query, or terms equivalent to those in the search query with the key terms in the index to identify the key terms which match the search query. The search engine may account for Boolean logic operators in the search query.
In the example above, and as illustrted at 10 in FIG. 1, a search query of "Alpha AND Gamma" would identify articles A1 and A3 because they are both associated with the matched key terms Alpha and Gamma. Because articles A1 and A3 are associated with the matched key terms, these articles are called matched articles.
As shown in FIG. 1 at 20, the search engine will then display a squib of each of the matched articles. The squib may comprise any portion, hypertext link to or representation of the matched article, such as the title, headings, first few lines of text, audio, video or any other type of information. As shown in FIG. 1 at 30, the user can then scroll through the squibs of the articles and select a desired one of the matched articles by opening, retrieving, reading, viewing, listening to or otherwise closely inspecting the article from over the Internet or from any other storage area. The matched article selected by the user is called the selected matched article.
Once the user has selected a matched article, and as shown in FIG. 1 at 40, the index can be altered such that the key term scores for the selected matched article under the matched key terms are altered relative to other key term scores. This indicates that the user believes that the matched key terms for that selected matched article are properly associated with the selected matched article. To alter the key term scores, a positive score such as (+1) can be added to the key term scores, for example, although any other possible indication can be used and the key term scores can be altered by any possible type of operation, mathematical or otherwise, to alter the key term scores for the selected matched article under the matched key terms relative to other key term scores.
Thus, after executing the search query "Alpha AND Gamma," the search engine would display the squib of matched articles A1 and A3. If the user selected only article A3, the index could be altered such that the key term scores for the selected matched article A3 under the matched key terms Alpha and Gamma are altered relative to the other key term scores. The index would then look like this:
______________________________________                                    
Index                                                                     
Alpha    Beta    Gamma       Delta Epsilon                                
______________________________________                                    
A1 - 1   A1 - 1  A1 - 1      A2 - 1                                       
                                   A1 - 1                                 
A2 - 1           A3 - 2      A3 - 1                                       
                                   A3 - 1                                 
A3 - 2                                                                    
______________________________________                                    
For the next search by either the same or a different user, the invention could then rank the matched articles by using the key term scores, as shown in FIG. 1 at 50 and 60. To this end, the key term scores of each matched article under each of the matched key terms of the new search could then be associated in any possible manner to create a comparison score for each matched article. For example, the key term scores could be added, multiplied together or averaged to create the comparison score for that matched article. The matched articles can then be displayed to the user in order of comparison score superiority, such as by displaying the matched article with the highest comparison score first.
For example, the search query "Alpha AND Epsilon" would again identify matched articles A1 and A3. By multiplying the key term scores of each matched article under each matched key term together to get the comparison score, the comparison score for article A1 would equal 1, whereas the comparison score for article A3 would be 2. The invention would then display the matched article A3 to the user in a superior position to matched article A1.
DISPARATE SEARCH ACTIVITY
To compensate for disparate search activity for certain articles relative to other articles, the invention may include a key term total score for each key term score of each article under each key term. After each search query is entered or after any other event occurs, the index could then be altered such that the key term total score of each matched article under each matched key term is altered relative to other key term total scores. The index could be altered in this manner after each search query is entered or after any other event, such as after the user has selected one or more articles or has read a matched article for a predetermined length of time.
For example, the index could have an initial setting such as is shown here where the key term scores are separated from the key term total scores by a backslash (/) and given an initial value of one.
______________________________________                                    
Index                                                                     
Alpha    Beta    Gamma       Delta Epsilon                                
______________________________________                                    
A1 - 1/1 A1 - 1/1                                                         
                 A1 - 1/1    A2 - 1/1                                     
                                   A1 - 1/1                               
A2 - 1/1         A3 - 1/1    A3 - 1/1                                     
                                   A3 - 1/1                               
A3 - 1/1                                                                  
______________________________________                                    
As illustrated above, if the user selected only article A3 after executing the search query "Alpha AND Gamma," the key term score for article A3 under the matched key terms Alpha and Gamma would be altered relative to other key term scores. Further, the key term total scores for both article A1 and article A3 under the matched key terms could also be altered. If the positive score is added to the key term scores for the selected matched article A3 under the matched key terms Alpha and Gamma, and the positive score is added to the key term total scores for the matched articles A1 and A3 (regardless of whether they were selected or not) under the matched key terms, the index would then look like this:
______________________________________                                    
Index                                                                     
Alpha    Beta    Gamma       Delta Epsilon                                
______________________________________                                    
A1 - 1/2 A1 - 1/1                                                         
                 A1 - 1/2    A2 - 1/1                                     
                                   A1 - 1/1                               
A2 - 1/1         A3 - 2/2    A3 - 1/1                                     
                                   A3 - 1/1                               
A3 - 2/2                                                                  
______________________________________                                    
For the next search, the invention could then organize or rank the articles by first comparing the key term scores as related to the respective key term total scores for each of the matched articles under each matched key term to create a key term probability score for that matched article under each respective matched key term from the new search. To this end, the key term scores of each matched article under each of the matched key terms could be compared or associated with their respective key term total score in any known manner to create the key term probability scores for that matched article under the respective matched key terms. For example, the key term scores of each matched article under the matched key terms could be divided by their respective key term total score to create the key term probability score of that matched article under that matched key term.
The key term probability scores of each matched article under each of the matched key terms could then be associated in any known manner to create the comparison score for each matched article identified in the search. For example, the key term probability scores could be added, multiplied or averaged together to create the comparison score for that matched article. The articles can then be displayed to the user in order of superiority, such as by displaying the article with the highest comparison score first.
For example, the new and different search query "Alpha AND Epsilon" would again identify matched articles A1 and A3. The key term probability score for matched article A1 under the key term Alpha would equal the key term score of 1 divided by the key term total score of 2, for a key term probability score of 0.5. Similarly, the key term probability score for matched article A2 under the key term Alpha would equal the key term score of 2 divided by the key term total score of 2, for a key term probability score of 1. Under the key term Epsilon, the key term probability score for matched article A1 would be 1, and the key term probability score for matched article A3 would also be 1, as neither of these scores has been altered from the initial setting in this example.
By multiplying the key term probability scores of each matched article under each matched key term together to get the comparison score, for example, the comparison score for article A1 would equal 0.5, whereas the comparison score for article A3 would be 1. The invention could then display the article A3 to the user in a superior position to article A1 because the comparison score for matched article A3 is higher.
Increased Resolution:
To provide for increased resolution in search ranking, the index may include matching associations of two or more key terms. For example, in the index illustrated below, each key term is grouped with one or more other key terms in a matrix format. Single key terms can be represented by a grouping of identical terms. Using the same initial settings from above, articles are listed in the boxes formed at the intersection of the rows and columns of the matrix to indicate that such articles are associated with the intersecting key terms. Although the index is shown in pair groupings, the index can be extended to include triplicate or other associations as well, i.e. separate boxes for Alpha-Beta-Gamma combinations, etc.
The index shown below has empty boxes because some intersecting groupings are substantially equivalent to other intersecting groupings. As such, one of these intersecting groupings, i.e. Alpha-Beta or Beta-Alpha, can be left blank. Alternatively, the equivalent groupings could be used to record and distinguish between the order of key terms in a search query. In other words, a search query of "Alpha AND Beta" could include the grouping Alpha-Beta, whereas the search query "Beta AND Alpha" would include the grouping Beta-Alpha. In such case, the empty boxes in the matrix would be used.
In the example above, article A1 is the only article which is associated with both the key terms Alpha and Beta. Accordingly, article A1 can be listed in at least the Alpha-Alpha box, in the Alpha-Beta box, and in the Beta-Beta box, for example. Doing this for all key term groupings of the articles in the example above would give an initial index that looked like this:
______________________________________                                    
Index                                                                     
Alpha         Beta    Gamma     Delta Epsilon                             
______________________________________                                    
Alpha   A1 - 1/1  A1 - 1/1                                                
                          A1 - 1/1                                        
                                  A2 - 1/1                                
                                        A1 - 1/1                          
        A2 - 1/1          A3 - 1/1                                        
                                  A3 - 1/1                                
                                        A3 - 1/1                          
        A3 - 1/1                                                          
Beta              A1 - 1/1                                                
                          A1 - 1/1      A1 - 1/1                          
Gamma                     A1 - 1/1                                        
                                  A3 - 1/1                                
                                        A1 - 1/1                          
                          A3 - 1/1      A3 - 1/1                          
Delta                             A2 - 1/1                                
                                        A3 - 1/1                          
                                  A3 - 1/1                                
Epsilon                                 A1 - 1/1                          
                                        A3 - 1/1                          
______________________________________                                    
During a search, an entered search query would typically include one or more key terms. The search engine could separate these key terms into one or more groupings. For example, the search query "Alpha AND Beta" could have only the one grouping Alpha-Beta, or could be separated into three groupings: Alpha-Alpha, Beta-Beta, and Alpha-Beta.
For larger queries, the search query "Alpha AND Beta AND Gamma" could have three groupings: Alpha-Beta, Beta-Gamma, and Alpha-Gamma, but could additionally include the single groupings Alpha-Alpha, Beta-Beta, and Gamma-Gamma. As an additional example, a more complex query such as "Alpha AND (Beta OR Gamma)" could have the groupings Alpha-Beta and Alpha-Gamma, and could additionally include the single groupings Alpha-Alpha, Beta-Beta, and Gamma-Gamma.
As described above, the invention will then accept a search query from a user and a search engine will identify articles which are indexed with the key terms that match the search query. A search query of "Alpha AND Gamma" would identify matched articles A1 and A3 because they are both indexed with the key term groupings Alpha-Alpha, Gamma-Gamma, and Alpha-Gamma. The key term groupings which match the search query are called matched key term groupings. The search engine will then display a squib of each of the matched articles. The user can then scroll through the squibs of the articles and select a desired one of the matched articles.
Once the user has selected a matched article, the key term scores for the selected matched article under the matched key term groupings can be altered to indicate that the user believes that those matched key term groupings are properly associated with the selected matched article. To alter the key term scores, for example, the positive score can be added to the key term scores, although any other possible type of indication can be used.
If the user selected only article A3, the key term scores for selected matched article A3 under the matched key term groupings Alpha-Gamma would be altered. Additionally, the key term scores for selected matched article A3 under the matched key term groupings Alpha-Alpha and Gamma-Gamma could also be altered since the key terms Alpha and Gamma are each represented individually in the results of the search query.
If the key term total score is also used for each key term score of each article and is altered every time a search query matches that key term grouping of that matched article, the index would then look like this:
______________________________________                                    
Index                                                                     
Alpha         Beta    Gamma     Delta Epsilon                             
______________________________________                                    
Alpha   A1 - 1/2  A1 - 1/1                                                
                          A1 - 1/2                                        
                                  A2 - 1/1                                
                                        A1 - 1/1                          
        A2 - 1/1          A3 - 2/2                                        
                                  A3 - 1/1                                
                                        A3 - 1/1                          
        A3 - 2/2                                                          
Beta              A1 - 1/1                                                
                          A1 - 1/1      A1 - 1/1                          
Gamma                     A1 - 1/2                                        
                                  A3 - 1/1                                
                                        A1 - 1/1                          
                          A3 - 2/2      A3 - 1/1                          
Delta                             A2 - 1/1                                
                                        A3 - 1/1                          
                                  A3 - 1/1                                
Epsilon                                 A1 - 1/1                          
                                        A3 - 1/1                          
______________________________________                                    
As explained above, the invention could then organize the articles by first comparing the key term scores as related to the key term total scores for each of the matched articles under each matched key term grouping. To this end, the key term scores of each matched article under each of the matched key term groupings could then be compared or associated with the respective key term total score in any known manner to create the key term probability score for that matched article under each matched key term grouping. For example, the key term scores of each matched article under the matched key term groupings could be divided by the respective key term total score to create the key term probability score for that matched article under those respective key term groupings.
The key term probability scores of each matched article under each of the matched key term groupings could then be associated in any known manner to create the comparison score for each matched article. For example, the key term probability scores could be multiplied together to create the comparison score for that matched article for the search query. The matched articles can then be displayed to the user in order of superiority, such as by displaying the matched article with the highest comparison score first.
For example, a new user entering the search query "Alpha AND Gamma" would result in the search engine again identifying matched articles A1 and A3. Under the key term grouping Alpha-Alpha, the key term probability score for matched article A1 would equal the key term score of 1 divided by the key term total score of 2, for a key term probability score of 0.5. Also, the key term probability score for selected matched article A2 under the key term grouping Alpha-Alpha would equal the key term score of 2 divided by the key term total score of 2, for a key term probability score of 1.
Similarly, under the key term grouping Gamma-Gamma, the key term probability score for matched article A1 would be 0.5, and the key term probability score for selected matched article A3 would equal 1. Under the key term grouping Alpha-Gamma, the key term probability score for the matched article A1 would equal 0.5, and the key term probability score for selected matched article A3 would equal 1.
By multiplying the key term probability scores for each key term of each matched article together to get the comparison score, for example, the comparison score for article A1 would equal 0.5 times 0.5 times 0.5, for a total of 0.125. The comparison score for article A3, on the other hand, would equal 1 times 1 times 1, for a total of 1. The invention could then display the article A3 to the user in a superior position to article A1 because the comparison score for matched article A3 is higher.
CATEGORIES
The invention can also be used to organize articles by category. To this end, the key terms of the index may simply comprise category key terms represented by the generic labels CAT1, CAT2, CAT3, CAT4, etc. The articles can each be associated with one or more of these category key terms, and the key term score is associated with each article for each of the category key terms. Additionally, the index may also include the key term total score for each category key term score of each article, as described above for the key terms.
For example, an initial index setting may look like this:
______________________________________                                    
Index                                                                     
CAT1     CAT2    CAT3        CAT4  CAT5                                   
______________________________________                                    
A1 - 1/1 A2 - 1/1                                                         
                 A1 - 1/1    A2 - 1/1                                     
                                   A1 - 1/1                               
A2 - 1/1         A3 - 1/1    A3 - 1/1                                     
                                   A3 - 1/1                               
A3 - 1/1                                                                  
______________________________________                                    
This embodiment of the invention, operating separately from or in addition to the embodiments described above, would permit the user to enter or select a category key term for inclusion in the search query. In this embodiment, the invention would operate in a similar manner for the category key terms as described above for the key terms alone. The invention may allow a user to enter one or more category key terms in formulating a search. For example, the user may enter the category key terms "Apartments" and "Los Angeles" or the category key terms "Romantic" and "Comedy" to find articles (i.e. advertisements or movies) which fall under two or more category key terms.
Moreover, the category key terms can be incorporated into the index of key terms as just another key term and included in the association of the comparison score and, if used, the key term probability scores. The category key terms can have a similar weight as other key terms or may be increasingly or decreasingly weighted to represent relative importance of the categories to the search query. An example of such an index wherein all articles are initially equally ranked in all categories and under all key terms is shown below.
__________________________________________________________________________
Index                                                                     
Alpha    Beta                                                             
             Gamma                                                        
                 Delta                                                    
                     Epsilon                                              
                          CAT1                                            
                              CAT2                                        
                                  CAT3                                    
__________________________________________________________________________
Alpha                                                                     
     A1-1/1                                                               
         A1-1/1                                                           
             A1-1/1                                                       
                 A2-1/1                                                   
                     A1-1/1                                               
                          A1-1/1                                          
                              A1-1/1                                      
                                  A1-1/1                                  
     A2-1/1  A3-1/1                                                       
                 A3-1/1                                                   
                     A3-1/1                                               
                          A2-1/1                                          
                              A2-1/1                                      
                                  A2-1/1                                  
     A3-1/1               A3-1/1                                          
                              A3-1/1                                      
                                  A3-1/1                                  
Beta     A1-1/1                                                           
             A1-1/1  A1-1/1                                               
                          A1-1/1                                          
                              A1-1/1                                      
                                  A1-1/1                                  
Gamma        A1-1/1                                                       
                 A3-1/1                                                   
                     A1-1/1                                               
                          A1-1/1                                          
                              A1-1/1                                      
                                  A1-1/1                                  
             A3-1/1  A3-1/1                                               
                          A3-1/1                                          
                              A3-1/1                                      
                                  A3-1/1                                  
Delta            A2-1/1                                                   
                     A3-1/1                                               
                          A2-1/1                                          
                              A2-1/1                                      
                                  A2-1/1                                  
                 A3-1/1   A3-1/1                                          
                              A3-1/1                                      
                                  A3-1/1                                  
Epsilon              A1-1/1                                               
                          A1-1/1                                          
                              A1-1/1                                      
                                  A1-1/1                                  
                     A3-1/1                                               
                          A3-1/1                                          
                              A3-1/1                                      
                                  A3-1/1                                  
CAT1                      A1-1/1                                          
                              A1-1/1                                      
                                  A1-1/1                                  
                          A2-1/1                                          
                              A2-1/1                                      
                                  A2-1/1                                  
                          A3-1/1                                          
                              A3-1/1                                      
                                  A3-1/1                                  
CAT2                          A1-1/1                                      
                                  A1-1/1                                  
                              A2-1/1                                      
                                  A2-1/1                                  
                              A3-1/1                                      
                                  A3-1/1                                  
CAT3                              A1-1/1                                  
                                  A2-1/1                                  
                                  A3-1/1                                  
__________________________________________________________________________
This embodiment of the invention works in a substantially similar manner as the key term groupings described above, except that the key term groupings may also include a category key term. For example, the search query "CAT1 AND Beta" could include just the one grouping CAT1-Beta, or could be separated into three groupings: CAT1-CAT1, Beta-Beta, and CAT1-Beta.
In yet another embodiment of the invention, the category key terms can be incorporated into one side of the index of key terms and associated with the key terms in the index to form the key term groupings. In this embodiment, the category key terms each function as just another key term to form the key term groupings and are included in the association of the comparison score and, if used, the key term probability scores. The category key terms can have a similar weight as other key terms or may be increasingly or decreasingly weighted to represent relative importance of the categories to the search query. An example of such an index wherein all articles are initially equally ranked in all categories is shown below.
______________________________________                                    
Index                                                                     
Alpha         Beta    Gamma     Delta Epsilon                             
______________________________________                                    
CAT1    A1-1/1    A1-1/1  A1-1/1  A2-1/1                                  
                                        A1-1/1                            
        A2-1/1            A3-1/1  A3-1/1                                  
                                        A3-1/1                            
        A3-1/1                                                            
CAT2    A1-1/1    A1-1/1  A1-1/1  A2-1/1                                  
                                        A1-1/1                            
        A2-1/1            A3-1/1  A3-1/1                                  
                                        A3-1/1                            
        A3-1/1                                                            
CAT3    A1-1/1    A1-1/1  A1-1/1  A2-1/1                                  
                                        A1-1/1                            
        A2-1/1            A3-1/1  A3-1/1                                  
                                        A3-1/1                            
        A3-1/1                                                            
______________________________________                                    
This variation also works in a substantially similar manner as the key term groupings described above, with the key term groupings each including a category key term associated with a key term. For example, a key term grouping for the search query "CAT1 AND Beta" would have just the one grouping CAT1-Beta, and the key term grouping for the search query "CAT1 AND Alpha AND Beta" would have the two key term groupings CAT1-Alpha and CAT1-Beta.
RATINGS
The invention can also be used to organize articles by ratings. To this end, the key terms of the index may additionally or alternatively comprise rating key terms represented by the generic labels G-Rated and X-Rated, for example. The rating key term G-Rated is considered appropriate for all ages, while the rating key term X-Rated is considered appropriate only for adults.
The articles are each initially associated with one or more of these rating key terms by any possible manner such as by human judgment or default association. The key term score is associated with each article for each of the rating key terms. Additionally, the index may also include the key term total score for each rating key term score of each article, as described above for the key terms.
Moreover, the rating key terms can be incorporated into the index of key terms and included in the association of the comparison score and, if used, the key term probability score. The rating key terms can have a similar weight as other key terms or may be increasingly or decreasingly weighted.
For example, an initial index setting may look like this:
______________________________________                                    
Index                                                                     
        G-Rated                                                           
              X-Rated                                                     
______________________________________                                    
        A1 - 1/1                                                          
              A1 - 1/1                                                    
        A3 - 1/1                                                          
              A2 - 1/1                                                    
              A3 - 1/1                                                    
______________________________________                                    
The invention, operating separately from or in addition to the manner described above, would permit or require the user to enter a rating key term in the search query. The invention would operate in a similar manner for the rating key terms as described above for the key terms alone, whereby the search activity of the user would alter the key term scores and key term total scores for the rating key terms.
For example, if the user selected only article A3 after executing a search query containing the rating key term X-Rated, the key term score for article A3 under the rating key term X-Rated would be altered relative to the other rating key term scores. The key term total score for matched articles A1, A2 and A3 would also be altered. If the positive score is added to the key term scores for the selected matched article A3, and the positive score is added to the key term total score for the matched articles A1, A2 and A3, the index would then look like this:
______________________________________                                    
Index                                                                     
        G-Rated                                                           
              X-Rated                                                     
______________________________________                                    
        A1 - 1/1                                                          
              A1 - 1/2                                                    
        A3 - 1/1                                                          
              A2 - 1/2                                                    
              A3 - 2/2                                                    
______________________________________                                    
In this manner, people looking for X-Rated material will identify and effectively label that material as X-Rated. Such X-Rated material can then be screened entirely from the rating key term of G-Rated by precluding articles entirely from the search results which have a key term probability score or comparison score for the rating key term X-Rated above a predetermined threshold.
For example, suppose article A3 contained adult content and articles A1 and A2 contained non-adult content which would not be of interest to users searching with the rating key term of X-Rated. After several users have performed searches, the index may look like this:
______________________________________                                    
Index                                                                     
       G-Rated       X-Rated                                              
______________________________________                                    
       A1 - 4/4      A1 - 2/7                                             
       A3 - 21/22    A2 - 2/10                                            
                     A3 - 45/45                                           
______________________________________                                    
While the article A3 containing adult content was clearly of interest to the G-Rated crowd, it was also clearly of interest to the X-Rated crowd. Accordingly, the invention would screen the article A3 (i.e. prevent the squib from being displayed) from search queries containing the rating key term of G-Rated.
On the other hand, the rating key terms for articles A1 and A2 under the X-Rated key term are low and suggest that these articles A1 and A2 do not contain adult content. Accordingly, these articles could be displayed in response to a search query containing a rating key term of G-Rated.
The rating key term scores could be permanently or temporarily attached to each article (such as incorporated into a meta-tag) so that articles which are downloaded by persons authorized to access X-rated articles cannot be e-mailed to persons not authorized to receive such articles. In other words, the e-mail browser could have software incorporated therein which checks the rating key term score of any attached articles and screens out those articles which have an X-Rated key term score above the predetermined threshold.
IMPLEMENTATION
The present invention is intended to operate in any form of networked or stand alone computer or computer system. For instance, the program can be run on a server connected to the Internet. A user having a remote computer connected to the Internet can access the program over the Internet via a browser or other program and enter a search query from the remote site. The program on the server can generate a list of matched articles, by any method such as described herein, and transmit a list of squibs, such as hypertext links or other article identifiers to the remote computer for display on the screen. The user can then select one of the articles by "clicking" on the squib or other identifier, for example. By clicking is generally meant any electronic selection of the article and is specifically meant the positioning an electronic pointer on the squib of the article displayed on the screen via a mouse or other pointing device and operating the button or switch of the mouse one or more times to direct a browser to access the article or any other portion thereof.
If the squib is a hypertext link, then the browser of the remote computer will retrieve the data of the article from the server URL indicated by the hypertext link. Before or after accessing the article URL through the hypertext link, the remote computer can send a data packet to the search server to indicate which matched article the user selected. As a user selects an article, the invention can send a message to the search server or other location to indicate the selected article either before or after the article is retrieved, opened, listened or otherwise viewed by the user for any amount of time, or after a pre-determined amount of time. For example, the remote computer could send a message to the search server after the remote user has selected a matched article and had the article open for more than a predetermined length of time. This would indicate that the article was what the user was searching for and indicate a stronger correlation between the search query and the selected matched article.
The invention may be incorporated into a client-side or server-side software interface which accepts or otherwise records a search query which is forwarded or input directly to another search engine available over the Internet. That search engine can then generate a list of matched articles which is then forwarded to the software interface wherein the organization method described herein is utilized to rank the articles. Alternatively, the invention can be simply incorporated into the search engine as a single server-side or client-side software program.
In this connection, the invention may initially or continuously utilize the ranking of the articles provide by a search engine. Specifically, the index of the invention may be initially empty or set to a neutral setting and subsequently populated through repeated uses of the invention, whereby the invention "learns" from each user. Each subsequent user would thus benefit from the prior human judgements about which key terms or groupings are relevant to which articles. In this case, the organization or ranking provided by the search engine could initially be used in displaying the articles. Then, after a predetermined event or amount of time occurs, only the index of the invention could be used to organize the articles, if desired.
Alternatively, the comparison scores could be continuously combined with the ranking provided by the search engine to supplement or correct such a ranking. For example, the search engine may rank or organize the articles by providing a relevancy score, such as the percentile relevancy provided by the search engines "Excite" (TM) or "Lycos" (TM). This percentile could be associated (such as by averaging or multiplying) with the comparison score generated by the invention to create another comparison score that is then used to rank or organize the articles. For search engines that do not provide a percentile relevancy score, a percentile relevancy can be assigned to the articles in accordance with their order or position in the list generated by the search engine.
The index of the present invention may comprise a database, spreadsheet or any other means of storing (temporarily or otherwise) the scores or other information about the key terms and articles. The present invention may also be incorporated in a search engine, browser, or other data managing program. The scores or other information may also be integrated or otherwise associated with any index of key terms used by any search engine, browser, or other data managing program.
The index may include key terms, category key terms and ratings key terms. A search query may comprise one or more key terms coupled with a category key term and/or a rating key term. For example, a user could first select one or more category key terms. The category key terms can be selected through a hierarchical structure of key terms, i.e. Real Estate; Rental; Apartments; Los Angeles. The user can then enter or add onto the category key term a search query of one or more key terms such as words. The total search query could then include the category key terms and the words as key terms. If desired, a rating key term could also be added to the search query. This search query would then be processed as described above.
To further broaden the utility of the invention, a search query could be separated not only into its component key terms, but also into key terms or key term groupings that include synonyms or otherwise analogous or equivalent key terms. For example, the search query "Car and Chevrolet" could include the following key terms: Car, Automobile, Vehicle, Chevrolet, Chevy. If separated into key term groupings, there could be the key term groupings, Car-Chevrolet, Car-Chevy, Automobile-Chevrolet, Automobile-Chevy, Vehicle-Chevrolet and Vehicle-Chevy. These key terms or key term groupings could then all be altered as described above as the user selects and ignores certain of the matched articles. This use of similar key terms would broadened the use of the invention because a subsequent user who types in the search query "Automobile and Chevy" would benefit from the search activity of a previous user who typed in the search query "Car and Chevrolet" and selected certain articles from a list of hits.
Initially, the key terms, category key terms and rating key terms may be associated with words or other information in the article, or may be arbitrarily associated with the article in any manner. For example, the associations may be created by an indexing software robot which indexes all words in the article as key terms, meta tags specified by the author, reviewer or editor, or by any other means known or later developed for associating certain key terms with each article.
Although the scores in the index are initially shown at 1, they can be initially set to any desired score. For example, the scores can be initially set to correspond with the frequency of the term occurrence in the article. Alternatively, a human editor could assign scores according to judgments made by such editor.
The key term probability score can be created by any possible association between one or more of the key term scores and one or more of the key term total scores for the matched article under one or more of the matched key terms. Similarly, the comparison score can be created by any possible association between one or more of the key term scores and/or one or more of the key term total scores and/or one or more of the key term probability scores for the matched article under one or more of the matched key terms.
The squib may comprise any portion or representation of the matched article, such as the title, headings, first few lines of text, audio, video or any other type of information.
When a search identifies more matched articles than can be displayed on the user's computer screen, the altering of the index may affect only those articles which the user has had a chance to view the squib of and either select or not select. For example, suppose over 1000 matched articles are identified, and the user views only the squibs of the first 20 articles and selects one of these articles. The matched articles having squibs displayed on screen are called displayed matched articles. The index can be altered so as to alter the key term total scores of only the displayed matched articles under the matched key terms. In this manner, the scores of matched articles which are not seen by the user are not altered relative to other scores.
Although the index has been shown as listing the key terms and positioning the articles "under" the key terms, the index may be configured in any desired manner which allows the articles and scores to be associated with the key terms in any manner. For example, the index may be configured such that the key terms are positioned "under" the articles. An example of such an index is shown below.
______________________________________                                    
Index                                                                     
A1      A2        A3        A4       A5                                   
______________________________________                                    
Alpha-1/1                                                                 
        Alpha-1/1 Alpha-1/1 Beta-1/1 Alpha-1/1                            
Beta-1/1          Gamma-1/1 Gamma-1/1                                     
                                     Gamma-1/1                            
Gamma-1/1                                                                 
______________________________________                                    
Although the specification describes altering the index by adding the positive score, other permutations are possible. For example, if the user does not select the matched article, the key term score for that matched article under that key term can be assigned a negative score. The negative score can be (-1), for example. The negative score implies that the user believes that the article should not be associated with that key term. This is because the user has performed a search with a search query containing that matched key term and has not selected that matched article from that search. Further, if the article is not displayed on the screen because the user does not scroll down to display that article, the key term score for that matched article under that matched key term can be assigned a neutral score. The neutral score can be (0), for example. The neutral score implies that the user neither believes nor disbelieves that the article should be associated with that matched key term.
Another method of altering the index may comprise altering the key term scores and/or key term total scores by a first positive score for certain actions, such as simply opening the article for viewing or listening, and altering the key term scores and/or key term total scores by a second positive score for certain actions such as downloading, reading the entire article or reading the article for a predetermined length of time (i.e. determined as having the article open for a predetermined length of time while scrolling through the article on the screen). Preferably, the second positive score is greater than the first positive score such that certain actions by the user which are more likely to indicate the relevance of the article to the key words of the search query affect the index greater than certain actions which may be considered "noise" in the searcher's activity, i.e. such as what occurs when a user begins "surfing the net" aimlessly during a search query.
The definitions used herein are not meant to be limiting. For example, by altering is meant any action which changes the score or scores of the selected matched article relative to the scores of the unselected matched articles. By score is meant marking, indicia, indicator, data element, or other identifier, whether in computer code, a readable language, encryption, or any other method of data, all of which are collectively referred to as score. The names positive, negative and neutral as used in the scores do not necessarily refer to positive or negative numbers, but instead refer to whether an article has received a positive vote, a negative vote, or a neutral vote.
In yet another alternative embodiment, the search activity of a user can be stored in the form of what are commonly known in the computer industry as "cookies. " For example, the key terms and/or key term groupings and scores for certain articles as a result of the search activity of the user could be stored as one or more cookies. These cookies could then be periodically downloaded to a central location for inclusion in the index, whereby the data from the cookies would be used to alter the index as described herein.
As to a further discussion of the manner of usage and operation of the present invention, the same should be apparent from the above description. Accordingly, no further discussion relating to the manner of usage and operation will be provided.
With respect to the above description then, it is to be realized that the optimum dimensional relationships for the parts of the invention, to include variations in form, function and manner of operation, implementation and use, are deemed readily apparent and obvious to one skilled in the art, and all equivalent relationships to those described in the specification are intended to be encompassed by the present invention.
Therefore, the foregoing is considered as illustrative only of the principles of the invention. Further, since numerous modifications and changes will readily occur to those skilled in the art, it is not desired to limit the invention to the exact construction and operation shown and described, and accordingly, all suitable modifications and equivalents may be resorted to, falling within the scope of the invention.

Claims (46)

What is claimed is:
1. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store key terms and associate each article with at least one of the key terms, the index further being able to associate a key term score with each article under each of the respective key terms when stored within the index, wherein the index is able to further associate a key term total score with each key term score;
(b) accepting a first search query from a first user;
(c) identifying the key terms that match the first search query, the key terms that match the first search query being first matched key terms;
(d) displaying squibs of articles related to the first search query to the first user;
(e) allowing the first user to select at least one of the articles related to the first search query, the article selected by the first user being a selected article;
(f1a) altering the index such that the key term score for the selected article under at least one of the first matched key terms is altered relative to other key term scores;
(f1b) altering the index such that key term total scores of at least one of the articles related to the first search query under at least one of the first matched key terms are altered relative to other key term total scores;
(g) accepting a second search query from a second user;
(h) identifying key terms that match the second search query, the key terms that match the second search query being second matched key terms;
(i) displaying squibs of articles related to the second search query to the second user, wherein the squibs of articles related to the second search query are organized in order of superiority of their key term scores under at least one of the second matched key terms when at least one of the second matched key terms matches at least one of the first matched key terms, whereby the selected article will be ranked higher for the second user than before the first user had selected the article.
2. The method of organizing a plurality of articles of claim 1 wherein step (f1a) comprises:
(f2a) altering the index such that the key term score for the selected article under at least one of the first matched key terms is altered relative to other key term scores;
and further wherein step (f1b) comprises:
(f2b) altering the index such that key term total scores of at least one of the articles related to the first search query under at least one of the first matched key terms are altered relative to other key term total scores, but only for articles that have had their squibs displayed to the first user.
3. The method of organizing a plurality of articles of claim 1, wherein step (f1a) comprises:
(f3a) adding a positive score to the key term scores for the selected article under at least one of the first matched key terms.
4. The method of organizing a plurality of articles of claim 1, wherein step (f1a) comprises:
(f4a) adding a positive score to the key term scores for the selected article under all the first matched key terms.
5. The method of organizing a plurality of articles of claim 1, wherein step (i) comprises:
(i5a) associating the key term score of individual articles related to the second search query under at least one of the second matched key terms with the respective key term total score to create a key term probability score for each of the respective individual articles related to the second search query under the respective second matched key term;
(i5b) associating the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query;
(i5c) displaying squibs of articles related to the second search query in order of superiority of the comparison scores when at least a portion of the second search query is related to the at least a portion of the first search query.
6. The method of organizing a plurality of articles of claim 5, wherein step (i5b) comprises:
(i6b) at least multiplying the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
7. The method of organizing a plurality of articles of claim 5, wherein step (i5b) comprises:
(i7b) at least adding the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
8. The method of organizing a plurality of articles of claim 5, wherein step (i5b) comprises:
(i8b) at least averaging the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
9. The method of organizing a plurality of articles of claim 1, wherein step (i5a) comprises:
(i6a) at least dividing the key term score of individual articles related to the second search query under at least one of the second matched key terms by the respective key term total score to create a key term probability score for each of the respective individual articles related to the second search query under the respective second matched key term.
10. The method of organizing a plurality of articles of claim 9, wherein step (i5b) comprises:
(i6b) at least multiplying the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
11. The method of organizing a plurality of articles of claim 9, wherein step (i5b) comprises:
(i7b) at least adding the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
12. The method of organizing a plurality of articles of claim 9, wherein step (i5b) comprises:
(i6b) at least averaging the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
13. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store key terms and associate each article with at least one of the key terms, the index further being able to associate a key term score with each article under each of the respective key terms when stored within the index;
(b) accepting a first search query from a first user;
(c) identifying the key terms that match the first search query, the key terms that match the first search query being first matched key terms:
(d) displaying squibs of articles related to the first search query to the first user;
(e1) allowing the first user to select at least one of the articles related to the first search query through any action allowing the first user to sense more than just the squib of the at least one of the articles related to the first search query, the article selected by the first user being a selected article;
(f) altering the index such that the key term score for the selected article under at least one of the first matched key terms is altered relative to other key term scores;
(g) accepting a second search query from a second user;
(h) identifying key terms that match the second search query, the key terms that match the second search query being second matched key terms;
(i) displaying squibs of articles related to the second search query to the second user, wherein the squibs of articles related to the second search query are organized in order of superiority of their key term scores under at least one of the second matched key terms when at least one of the second matched key terms matches at least one of the first matched key terms, whereby the selected article will be ranked higher for the second user than before the first user had selected the article.
14. The method of organizing a plurality of articles of claim 13, wherein step (g) comprises:
(g1) accepting a second search query from a second user, the second user being different from the first user.
15. The method of organizing a plurality of articles of claim 13, and further comprising:
(j) allowing the second user to select at least one of the articles related to the second search query, the article selected by the second user being a second selected article;
(k) altering the index such that the key term score for the second selected article under at least one of the second matched key terms is altered relative to other key term scores;
(l) repeating steps (g) through (k) for additional users.
16. The method of organizing a plurality of articles of claim 13, wherein step (i) comprises:
(i1a) associating the key term scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query;
(i2b) displaying squibs of articles related to the second search query in order of superiority of the comparison scores when at least a portion of the second search query is related to the at least a portion of the first search query.
17. The method of organizing a plurality of articles of claim 16, wherein step (i1a) comprises:
(i2a) at least multiplying the key term scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
18. The method of organizing a plurality of articles of claim 16, wherein step (i1a) comprises:
(i3a) at least adding the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
19. The method of organizing a plurality of articles of claim 16, wherein step (i1a) comprises:
(i4a) at least averaging the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
20. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store key terms and associate each article with at least one of the key terms, the index further being able to associate a key term score with each article under each of the respective key terms when stored within the index;
(b) accepting a first search query from a first user;
(c) identifying the key terms that match the first search query, the key terms that match the first search query being first matched key terms;
(d) displaying squibs of articles related to the first search query to the first user;
(e2) allowing the user to select at least one of the articles related to the first search query by clicking on a hypertext link portion of the squib of the at least one of the articles related to the first search query, the article selected by the user being a selected article;
(f) altering the index such that the key term score for the selected article under at least one of the first matched key terms is altered relative to other key term scores;
(g) accepting a second search query from a second user;
(h) identifying key terms that match the second search query, the key terms that match the second search query being second matched key terms;
(i) displaying squibs of articles related to the second search query to the second user, wherein the squibs of articles related to the second search query are organized in order of superiority of their key term scores under at least one of the second matched key terms when at least one of the second matched key terms matches at least one of the first matched key terms, whereby the selected article will be ranked higher for the second user than before the first user had selected the article.
21. The method of organizing a plurality of articles of claim 20, wherein step (g) comprises:
(g1) accepting a second search query from a second user, the second user being different from the first user.
22. The method of organizing a plurality of articles of claim 20, and further comprising:
(j) allowing the second user to select at least one of the articles related to the second search query, the article selected by the second user being a second selected article;
(k) altering the index such that the key term score for the second selected article under at least one of the second matched key terms is altered relative to other key term scores;
(l) repeating steps (g) through (k) for additional users.
23. The method of organizing a plurality of articles of claim 20, wherein step (i) comprises:
(i1a) associating the key term scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query;
(i2b) displaying squibs of articles related to the second search query in order of superiority of the comparison scores when at least a portion of the second search query is related to the at least a portion of the first search query.
24. The method of organizing a plurality of articles of claim 23, wherein step (i1a) comprises:
(i2a) at least multiplying the key term scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
25. The method of organizing a plurality of articles of claim 23, wherein step (i1a) comprises:
(i3a) at least adding the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
26. The method of organizing a plurality of articles of claim 23, wherein step (i1a) comprises:
(i4a) at least averaging the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
27. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store key terms and associate each article with at least one of the key terms, the index further being able to associate a key term score with each article under each of the respective key terms when stored within the index;
(b) accepting a first search query from a first user;
(c) identifying the key terms that match the first search query, the key terms that match the first search query being first matched key terms;
(d) displaying squibs of articles related to the first search query to the first user;
(e3) allowing the user to select at least one of the articles related to the first search query by opening the at least one of the articles related to the first search query, the article selected by the first user being a selected article;
(f) altering the index such that the key term score for the selected article under at least one of the first matched key terms is altered relative to other key term scores;
(g) accepting a second search query from a second user;
(h) identifying key terms that match the second search query, the key terms that match the second search query being second matched key terms;
(i) displaying squibs of articles related to the second search query to the second user, wherein the squibs of articles related to the second search query are organized in order of superiority of their key term scores under at least one of the second matched key terms when at least one of the second matched key terms matches at least one of the first matched key terms, whereby the selected article will be ranked higher for the second user than before the first user had selected the article.
28. The method of organizing a plurality of articles of claim 27, wherein step (g) comprises:
(g1) accepting a second search query from a second user, the second user being different from the first user.
29. The method of organizing a plurality of articles of claim 27, and further comprising:
(j) allowing the second user to select at least one of the articles related to the second search query, the article selected by the second user being a second selected article;
(k) altering the index such that the key term score for the second selected article under at least one of the second matched key terms is altered relative to other key term scores;
(l) repeating steps (g) through (k) for additional users.
30. The method of organizing a plurality of articles of claim 27, wherein step (i) comprises:
(i1a) associating the key term scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query;
(i2b) displaying squibs of articles related to the second search query in order of superiority of the comparison scores when at least a portion of the second search query is related to the at least a portion of the first search query.
31. The method of organizing a plurality of articles of claim 30, wherein step (i1a) comprises:
(i2a) at least multiplying the key term scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
32. The method of organizing a plurality of articles of claim 30, wherein step (i1a) comprises:
(i3a) at least adding the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
33. The method of organizing a plurality of articles of claim 30, wherein step (i1a) comprises:
(i4a) at least averaging the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
34. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store key terms and associate each article with at least one of the key terms, the index further being able to associate a key term score with each article under each of the respective key terms when stored within the index;
(b) accepting a first search query from a first user;
(c) identifying the key terms that match the first search query, the key terms that match the first search query being first matched key terms;
(d) displaying squibs of articles related to the first search query to the first user;
(e4) allowing the user to select at least one of the articles by retrieving the at least one of the articles related to the first search query from a remote server, the article selected by the first user being a selected article;
(f) altering the index such that the key term score for the selected article under at least one of the first matched key terms is altered relative to other key term scores;
(g) accepting a second search query from a second user;
(h) identifying key terms that match the second search query, the key terms that match the second search query being second matched key terms;
(i) displaying squibs of articles related to the second search query to the second user, wherein the squibs of articles related to the second search query are organized in order of superiority of their key term scores under at least one of the second matched key terms when at least one of the second matched key terms matches at least one of the first matched key terms, whereby the selected article will be ranked higher for the second user than before the first user had selected the article.
35. The method of organizing a plurality of articles of claim 34, wherein step (i) comprises:
(i1a) associating the key term scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query;
(i2b) displaying squibs of articles related to the second search query in order of superiority of the comparison scores when at least a portion of the second search query is related to the at least a portion of the first search query.
36. The method of organizing a plurality of articles of claim 35, wherein step (i1a) comprises:
(i2a) at least multiplying the key term scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
37. The method of organizing a plurality of articles of claim 35, wherein step (i1a) comprises:
(i3a) at least adding the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
38. The method of organizing a plurality of articles of claim 35, wherein step (i1a) comprises:
(i4a) at least averaging the key term probability scores of individual articles related to the second search query under at least some of the second matched key terms to create comparison scores for each of the respective individual articles related to the second search query.
39. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store category terms and associate each article with at least one of the category terms, the index further being able to associate a category term score with each article under each of the respective category terms when stored within the index;
(b) accepting a first search query from a first user;
(c) accepting at least one first category term from the first user, the first category term being an indication of a generic type of information the first user is searching for;
(d) identifying articles related to the first search query;
(e) displaying squibs of articles related to the first search query to the first user;
(f) allowing the first user to select at least one of the articles related to the first search query, the article selected by the first user being a first selected article;
(g) altering the index such that the selected article is associated with the first category term and the category term score for the selected article under at least the first category term is altered relative to other category term scores;
(h) accepting at least one second category term from the second user, the second category term being an indication of a generic type of information the second user is searching for;
(i) displaying squibs of articles associated with the second category term to the second user, wherein the squibs of articles associated with the second category term are organized relative to their key term scores under the at least one second category term when the second category term is related to the first category term, whereby the first selected article will be ranked higher than before the first user had selected the article.
40. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store key terms and associate each article with at least one of the key terms, the index further being able to associate a key term score with each article under each of the respective key terms when stored within the index, the index further being able to store category terms and associate each article with at least one of the category terms, the index further being able to associate a category term score with each article under each of the respective category terms when stored within the index;
(b) accepting a first search query from a first user;
(c) accepting at least one first category term from the first user, the first category term being an indication of a generic type of information the first user is searching for;
(d) identifying articles related to the first search query;
(e) displaying squibs of articles related to the first search query to the first user;
(f) allowing the first user to select at least one of the articles related to the first search query, the article selected by the first user being a first selected article;
(g) identifying the key terms that match the first search query, the key terms that match the first search query being first matched key terms;
(h) altering the index such that the key term score for the selected article under at least one of the first matched key terms is altered relative to other key term scores;
(i) altering the index such that the selected article is associated with the first category term and the category term score for the selected article under at least the first category term is altered relative to other category term scores;
(j) accepting a second search query from a second user;
(k) accepting at least one second category term from the second user, the second category term being an indication of a generic type of information the second user is searching for;
(m) displaying squibs of articles associated with the second search query and the second category term to the second user, wherein the squibs of articles associated with the second category term are organized relative to their key term scores under the at least one second category term when the second category term is related to the first category term, whereby the first selected article will be ranked higher than before the first user had selected the article.
41. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store rating terms and associate each article with at least one of the rating terms, the index further being able to associate a rating term score with each article under each of the respective rating terms when stored within the index;
(b) accepting a first search query from a first user;
(c) accepting a first rating term from the first user, the first rating term being an indication of an appropriateness of an article for particular age groups, including all-age groups and adults-only groups;
(d) displaying squibs of articles related to the first search query to the first user;
(e) allowing the first user to select at least one of the articles related to the first search query, the article selected by the first user being a selected article;
(f) altering the index such that the rating term score for the selected article under at least one of the first rating terms is altered relative to other key term scores;
(g) accepting a second search query from a second user;
(h) accepting a second rating term from the second user, the second rating term being an indication of an appropriateness of an article for particular age groups, including all-age groups and adults-only groups;
(i) displaying squibs of articles related to the second search query to the second user in which the rating term score of the respective article under the first rating term is below a predetermined threshold when the second rating term is different than the first rating term;
(j) displaying squibs of articles related to the second search query to the second user when the second rating term is the same as the first rating term.
42. A method of organizing a plurality of articles comprising:
(a) providing an index, the index being able to store key term groupings derived from search queries entered by previous users, and associate each article with at least one of the key term groupings, the index further being able to associate a key term score with each article under each of the respective key term groupings when stored within the index;
(b) accepting a first search query from a first user;
(c) deriving key term groupings from the first search query, the key term groupings derived from the first search query being first matched key term groupings;
(d) displaying squibs of articles related to the first search query to the first user;
(e) allowing the first user to select at least one of the articles related to the first search query, the article selected by the first user being a selected article;
(f) altering the index such that the key term score for the selected article under at least one of the first matched key term groupings is altered relative to other key term scores;
(g) accepting a second search query from a second user;
(h) identifying the key term groupings that match the second search query, the key term groupings that match the second search query being second matched key term groupings;
(i) displaying squibs of articles related to the second search query to the second user, wherein the squibs of articles related to the second search query are organized relative to their key term scores under at least one of the second matched key term groupings when at least one of the key term groupings from the second search query matches at least one of the first key term groupings from the first search query, whereby the selected article will be ranked higher than before the first user had selected the article.
43. The method of organizing a plurality of articles of claim 42, wherein step (g) comprises:
(g1) accepting a second search query from a second user, the second user being different from the first user.
44. The method of organizing a plurality of articles of claim 42, wherein step (c) comprises:
(c1) deriving key term groupings which each contain at least one term derived from the first search query, the key term groupings derived from the first search query being first matched key term groupings.
45. The method of organizing a plurality of articles of claim 42, wherein step (c) comprises:
(c2) deriving key term groupings containing at least two different terms derived from the first search query, the key term groupings derived from the first search query being first matched key term groupings.
46. The method of organizing a plurality of articles of claim 42, wherein step (c) comprises:
(c3) deriving a key term grouping containing all the terms in the first search query in any order, the key term grouping derived from the first search query being a first matched key term grouping.
US08/904,795 1997-04-25 1997-08-01 Method for organizing information Expired - Lifetime US6006222A (en)

Priority Applications (8)

Application Number Priority Date Filing Date Title
US08/904,795 US6006222A (en) 1997-04-25 1997-08-01 Method for organizing information
US08/960,140 US6014665A (en) 1997-08-01 1997-10-29 Method for organizing information
US09/041,411 US6078916A (en) 1997-08-01 1998-03-12 Method for organizing information
AU20351/99A AU2035199A (en) 1997-08-01 1998-07-22 Method for organizing information
PCT/US1998/015109 WO1999006924A1 (en) 1997-08-01 1998-07-22 Method for organizing information
US09/259,600 US6182068B1 (en) 1997-08-01 1999-03-01 Personalized search methods
US09/684,209 US6539377B1 (en) 1997-08-01 2000-10-06 Personalized search methods
US10/392,510 US6816850B2 (en) 1997-08-01 2003-03-20 Personalized search methods including combining index entries for catagories of personal data

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US84092297A 1997-04-25 1997-04-25
US08/904,795 US6006222A (en) 1997-04-25 1997-08-01 Method for organizing information

Related Parent Applications (2)

Application Number Title Priority Date Filing Date
US84092297A Continuation-In-Part 1997-04-25 1997-04-25
US08/960,140 Continuation-In-Part US6014665A (en) 1997-08-01 1997-10-29 Method for organizing information

Related Child Applications (4)

Application Number Title Priority Date Filing Date
US08/960,140 Continuation-In-Part US6014665A (en) 1997-08-01 1997-10-29 Method for organizing information
US09/041,411 Continuation-In-Part US6078916A (en) 1997-08-01 1998-03-12 Method for organizing information
US09/259,600 Continuation-In-Part US6182068B1 (en) 1997-08-01 1999-03-01 Personalized search methods
US09/684,209 Continuation US6539377B1 (en) 1997-08-01 2000-10-06 Personalized search methods

Publications (1)

Publication Number Publication Date
US6006222A true US6006222A (en) 1999-12-21

Family

ID=25283584

Family Applications (1)

Application Number Title Priority Date Filing Date
US08/904,795 Expired - Lifetime US6006222A (en) 1997-04-25 1997-08-01 Method for organizing information

Country Status (1)

Country Link
US (1) US6006222A (en)

Cited By (205)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000077689A1 (en) * 1999-06-16 2000-12-21 Triogo, Inc. A process for improving search engine efficiency using user feedback
US6311178B1 (en) * 1997-09-29 2001-10-30 Webplus, Ltd. Multi-element confidence matching system and the method therefor
US6314420B1 (en) 1996-04-04 2001-11-06 Lycos, Inc. Collaborative/adaptive search engine
US20010054020A1 (en) * 2000-03-22 2001-12-20 Barth Brian E. Method and apparatus for dynamic information connection engine
US20020049752A1 (en) * 1998-03-03 2002-04-25 Dwayne Bowman Identifying the items most relevant to a current query based on items selected in connection with similar queries
US6381592B1 (en) * 1997-12-03 2002-04-30 Stephen Michael Reuning Candidate chaser
US20020073065A1 (en) * 2000-10-31 2002-06-13 Yasuhiko Inaba Document retrieval method and system and computer readable storage medium
US20020087390A1 (en) * 2000-10-04 2002-07-04 Weathersby Robert G. Method and system of using collective human intelligence to logically group related items
US20020123994A1 (en) * 2000-04-26 2002-09-05 Yves Schabes System for fulfilling an information need using extended matching techniques
US20020123988A1 (en) * 2001-03-02 2002-09-05 Google, Inc. Methods and apparatus for employing usage statistics in document retrieval
US20020169851A1 (en) * 2000-10-04 2002-11-14 Robert Weathersby Internet-based system for dynamically creating and delivering customized content within remote web pages
US6496824B1 (en) * 1999-02-19 2002-12-17 Saar Wilf Session management over a stateless protocol
US6507841B2 (en) 1998-02-20 2003-01-14 Hewlett-Packard Company Methods of and apparatus for refining descriptors
US20030014501A1 (en) * 2001-07-10 2003-01-16 Golding Andrew R. Predicting the popularity of a text-based object
US20030018625A1 (en) * 2001-07-23 2003-01-23 Tremblay Michael A. System and method for user adaptive software interface
US20030078914A1 (en) * 2001-10-18 2003-04-24 Witbrock Michael J. Search results using editor feedback
US6564170B2 (en) * 2000-12-29 2003-05-13 Hewlett-Packard Development Company, L.P. Customizable user interfaces
US20030097617A1 (en) * 2001-05-24 2003-05-22 Goeller Sunni K. Automatic classification of event data
US20030146939A1 (en) * 2001-09-24 2003-08-07 John Petropoulos Methods and apparatus for mouse-over preview of contextually relevant information
US6606102B1 (en) 2000-06-02 2003-08-12 Gary Odom Optimizing interest potential
US6640218B1 (en) 2000-06-02 2003-10-28 Lycos, Inc. Estimating the usefulness of an item in a collection of information
US6738764B2 (en) 2001-05-08 2004-05-18 Verity, Inc. Apparatus and method for adaptively ranking search results
US6785669B1 (en) * 2000-03-08 2004-08-31 International Business Machines Corporation Methods and apparatus for flexible indexing of text for use in similarity searches
US20040205575A1 (en) * 2001-04-12 2004-10-14 Martin Wattenberg Method and system for incorporating a value in a document
US6810395B1 (en) * 1999-11-22 2004-10-26 Hewlett-Packard Development Company, L.P. Method and apparatus for query-specific bookmarking and data collection
US20040215607A1 (en) * 2003-04-25 2004-10-28 Travis Robert L. Method and system fo blending search engine results from disparate sources into one search result
US6832218B1 (en) * 2000-09-22 2004-12-14 International Business Machines Corporation System and method for associating search results
US20050021397A1 (en) * 2003-07-22 2005-01-27 Cui Yingwei Claire Content-targeted advertising using collected user behavior data
US20050027670A1 (en) * 2003-07-30 2005-02-03 Petropoulos Jack G. Ranking search results using conversion data
US6859800B1 (en) * 2000-04-26 2005-02-22 Global Information Research And Technologies Llc System for fulfilling an information need
US6859807B1 (en) * 1999-05-11 2005-02-22 Maquis Techtrix, Llc Online content tabulating system and method
US20050060310A1 (en) * 2003-09-12 2005-03-17 Simon Tong Methods and systems for improving a search ranking using population information
US20050060311A1 (en) * 2003-09-12 2005-03-17 Simon Tong Methods and systems for improving a search ranking using related queries
US20050114322A1 (en) * 1998-09-27 2005-05-26 Infobit, Ltd. Apparatus and Method fopr Search and Retrieval of Documents
US20050149500A1 (en) * 2003-12-31 2005-07-07 David Marmaros Systems and methods for unification of search results
US20050149498A1 (en) * 2003-12-31 2005-07-07 Stephen Lawrence Methods and systems for improving a search ranking using article information
US20050223027A1 (en) * 2004-03-31 2005-10-06 Lawrence Stephen R Methods and systems for structuring event data in a database for location and retrieval
US6954755B2 (en) 2000-08-30 2005-10-11 Richard Reisman Task/domain segmentation in applying feedback to command control
US20050240557A1 (en) * 2000-05-22 2005-10-27 Overture Services, Inc. Method and apparatus for identifying related searches in a database search system
US20050246588A1 (en) * 2004-03-31 2005-11-03 Google, Inc. Profile based capture component
EP1622041A1 (en) * 2004-07-30 2006-02-01 France Telecom Distributed process and system for personalised filtering of search engine results
US20060036599A1 (en) * 2004-08-09 2006-02-16 Glaser Howard J Apparatus, system, and method for identifying the content representation value of a set of terms
US20060036565A1 (en) * 2004-08-10 2006-02-16 Carl Bruecken Passive monitoring of user interaction with a browser application
US20060053065A1 (en) * 1998-03-03 2006-03-09 Dwayne Bowman Identifying items relevant to a current query based on items accessed in connection with similar queries
US20060074628A1 (en) * 2004-09-30 2006-04-06 Elbaz Gilad I Methods and systems for selecting a language for text segmentation
US20060073058A1 (en) * 2004-10-06 2006-04-06 Lg Electronics Inc. Orbiting vane compressor with side-inlet structure
US7035864B1 (en) 2000-05-18 2006-04-25 Endeca Technologies, Inc. Hierarchical data-driven navigation system and method for information retrieval
US7062561B1 (en) 2000-05-23 2006-06-13 Richard Reisman Method and apparatus for utilizing the social usage learned from multi-user feedback to improve resource identity signifier mapping
US20060184577A1 (en) * 2005-02-15 2006-08-17 Kaushal Kurapati Methods and apparatuses to determine adult images by query association
US20060224554A1 (en) * 2005-03-29 2006-10-05 Bailey David R Query revision using known highly-ranked queries
US20060259510A1 (en) * 2000-04-26 2006-11-16 Yves Schabes Method for detecting and fulfilling an information need corresponding to simple queries
US7159011B1 (en) 1999-05-11 2007-01-02 Maquis Techtrix, Llc System and method for managing an online message board
US20070016491A1 (en) * 2003-09-30 2007-01-18 Xuejun Wang Method and apparatus for search scoring
US20070083505A1 (en) * 2000-05-18 2007-04-12 Ferrari Adam J Hierarchical data-driven search and navigation system and method for information retrieval
US7222127B1 (en) 2003-11-14 2007-05-22 Google Inc. Large scale machine learning systems and methods
US20070118542A1 (en) * 2005-03-30 2007-05-24 Peter Sweeney System, Method and Computer Program for Faceted Classification Synthesis
US20070124301A1 (en) * 2004-09-30 2007-05-31 Elbaz Gilad I Methods and systems for improving text segmentation
US20070136221A1 (en) * 2005-03-30 2007-06-14 Peter Sweeney System, Method and Computer Program for Facet Analysis
US20070156621A1 (en) * 2005-12-30 2007-07-05 Daniel Wright Using estimated ad qualities for ad filtering, ranking and promotion
US20070156514A1 (en) * 2005-12-30 2007-07-05 Daniel Wright Estimating ad quality from observed user behavior
US20070156887A1 (en) * 2005-12-30 2007-07-05 Daniel Wright Predicting ad quality
US7272601B1 (en) 2004-03-31 2007-09-18 Google Inc. Systems and methods for associating a keyword with a user interface area
US7281008B1 (en) 2003-12-31 2007-10-09 Google Inc. Systems and methods for constructing a query result set
US7302645B1 (en) 2003-12-10 2007-11-27 Google Inc. Methods and systems for identifying manipulated articles
US20070276829A1 (en) * 2004-03-31 2007-11-29 Niniane Wang Systems and methods for ranking implicit search results
US20070276801A1 (en) * 2004-03-31 2007-11-29 Lawrence Stephen R Systems and methods for constructing and using a user profile
US20070282797A1 (en) * 2004-03-31 2007-12-06 Niniane Wang Systems and methods for refreshing a content display
US7310633B1 (en) 2004-03-31 2007-12-18 Google Inc. Methods and systems for generating textual information
US20080005090A1 (en) * 2004-03-31 2008-01-03 Khan Omar H Systems and methods for identifying a named entity
US20080021925A1 (en) * 2005-03-30 2008-01-24 Peter Sweeney Complex-adaptive system for providing a faceted classification
US7325201B2 (en) 2000-05-18 2008-01-29 Endeca Technologies, Inc. System and method for manipulating content in a hierarchical data-driven search and navigation system
US20080033823A1 (en) * 2000-07-24 2008-02-07 Dante Monteverde Internet-Based Advertising and Referral System
US20080040315A1 (en) * 2004-03-31 2008-02-14 Auerbach David B Systems and methods for generating a user interface
US7333976B1 (en) 2004-03-31 2008-02-19 Google Inc. Methods and systems for processing contact information
US20080059419A1 (en) * 2004-03-31 2008-03-06 David Benjamin Auerbach Systems and methods for providing search results
US7412708B1 (en) 2004-03-31 2008-08-12 Google Inc. Methods and systems for capturing information
US7428528B1 (en) 2004-03-31 2008-09-23 Endeca Technologies, Inc. Integrated application for manipulating content in a hierarchical data-driven search and navigation system
US7499958B1 (en) 2004-03-31 2009-03-03 Google Inc. Systems and methods of replicating all or part of a data store
US7516118B1 (en) 2003-12-31 2009-04-07 Google Inc. Methods and systems for assisted network browsing
US20090125482A1 (en) * 2007-11-12 2009-05-14 Peregrine Vladimir Gluzman System and method for filtering rules for manipulating search results in a hierarchical search and navigation system
US7565367B2 (en) 2002-01-15 2009-07-21 Iac Search & Media, Inc. Enhanced popularity ranking
US7574426B1 (en) 2005-03-31 2009-08-11 A9.Com, Inc. Efficiently identifying the items most relevant to a current query based on items selected in connection with similar queries
US7581227B1 (en) 2004-03-31 2009-08-25 Google Inc. Systems and methods of synchronizing indexes
US7580568B1 (en) 2004-03-31 2009-08-25 Google Inc. Methods and systems for identifying an image as a representative image for an article
US20090248669A1 (en) * 2008-04-01 2009-10-01 Nitin Mangesh Shetti Method and system for organizing information
US7617184B2 (en) 2000-05-18 2009-11-10 Endeca Technologies, Inc. Scalable hierarchical data-driven navigation system and method for information retrieval
US20090326943A1 (en) * 2008-06-25 2009-12-31 Fujitsu Limited Guidance information display device, guidance information display method and recording medium
US7664734B2 (en) 2004-03-31 2010-02-16 Google Inc. Systems and methods for generating multiple implicit search queries
US7680888B1 (en) 2004-03-31 2010-03-16 Google Inc. Methods and systems for processing instant messenger messages
US7707142B1 (en) 2004-03-31 2010-04-27 Google Inc. Methods and systems for performing an offline search
US7707573B1 (en) 2003-12-31 2010-04-27 Google Inc. Systems and methods for providing and installing software
US7716225B1 (en) 2004-06-17 2010-05-11 Google Inc. Ranking documents based on user behavior and/or feature data
US7725508B2 (en) 2004-03-31 2010-05-25 Google Inc. Methods and systems for information capture and retrieval
US7730074B1 (en) 2005-11-04 2010-06-01 Google Inc. Accelerated large scale optimization
US7761439B1 (en) 2004-06-30 2010-07-20 Google Inc. Systems and methods for performing a directory search
US7788274B1 (en) 2004-06-30 2010-08-31 Google Inc. Systems and methods for category-based search
USRE41754E1 (en) 1999-05-11 2010-09-21 Knight Timothy O User interface for interacting with online message board
US7818208B1 (en) 2005-06-28 2010-10-19 Google Inc. Accurately estimating advertisement performance
US7827176B2 (en) 2004-06-30 2010-11-02 Google Inc. Methods and systems for endorsing local search results
US7840547B1 (en) 2004-03-31 2010-11-23 Google Inc. Methods and systems for efficient query rewriting
US7844565B2 (en) 2005-03-30 2010-11-30 Primal Fusion Inc. System, method and computer program for using a multi-tiered knowledge representation model
US7853606B1 (en) 2004-09-14 2010-12-14 Google, Inc. Alternate methods of displaying search results
US20110035370A1 (en) * 1998-07-15 2011-02-10 Ortega Ruben E Identifying related search terms based on search behaviors of users
US7925657B1 (en) 2004-03-17 2011-04-12 Google Inc. Methods and systems for adjusting a scoring measure based on query breadth
US20110191410A1 (en) * 1998-01-30 2011-08-04 Net-Express, Ltd. WWW Addressing
US7996396B2 (en) 2006-03-28 2011-08-09 A9.Com, Inc. Identifying the items most relevant to a current query based on user activity with respect to the results of similar queries
US8005716B1 (en) 2004-06-30 2011-08-23 Google Inc. Methods and systems for establishing a keyword utilizing path navigation information
US8019752B2 (en) 2005-11-10 2011-09-13 Endeca Technologies, Inc. System and method for information retrieval from object collections with complex interrelationships
US8041713B2 (en) 2004-03-31 2011-10-18 Google Inc. Systems and methods for analyzing boilerplate
US8051096B1 (en) 2004-09-30 2011-11-01 Google Inc. Methods and systems for augmenting a token lexicon
US8064736B2 (en) 2004-05-10 2011-11-22 Google Inc. Method and system for providing targeted documents based on concepts automatically identified therein
US8099407B2 (en) 2004-03-31 2012-01-17 Google Inc. Methods and systems for processing media files
US8131754B1 (en) 2004-06-30 2012-03-06 Google Inc. Systems and methods for determining an article association measure
US8140524B1 (en) 2005-03-30 2012-03-20 Google Inc. Estimating confidence for query revision models
US8156444B1 (en) 2003-12-31 2012-04-10 Google Inc. Systems and methods for determining a user interface attribute
US8161053B1 (en) 2004-03-31 2012-04-17 Google Inc. Methods and systems for eliminating duplicate events
US20120197979A1 (en) * 2011-01-24 2012-08-02 Palm Leon G Web-wide content quality crowd sourcing
US8271651B1 (en) 2003-12-31 2012-09-18 Google Inc. Methods and systems for regulating resource usage
US8275839B2 (en) 2004-03-31 2012-09-25 Google Inc. Methods and systems for processing email messages
US8312003B2 (en) 2004-12-16 2012-11-13 Hewlett-Packard Development Company, L.P. Computer method and apparatus for collaborative web searches
US8321858B1 (en) 2003-12-31 2012-11-27 Google Inc. Systems and methods for providing software updates
US8346792B1 (en) 2010-11-09 2013-01-01 Google Inc. Query generation using structural similarity between documents
US8346764B1 (en) 2007-06-01 2013-01-01 Thomson Reuters Global Resources Information retrieval systems, methods, and software with content-relevancy enhancements
US8346791B1 (en) 2008-05-16 2013-01-01 Google Inc. Search augmentation
US8346777B1 (en) 2004-03-31 2013-01-01 Google Inc. Systems and methods for selectively storing event data
US8386728B1 (en) 2004-03-31 2013-02-26 Google Inc. Methods and systems for prioritizing a crawl
US8396865B1 (en) 2008-12-10 2013-03-12 Google Inc. Sharing search engine relevance data between corpora
US8412727B1 (en) 2009-06-05 2013-04-02 Google Inc. Generating query refinements from user preference data
US8447760B1 (en) 2009-07-20 2013-05-21 Google Inc. Generating a related set of documents for an initial set of documents
US8495001B2 (en) 2008-08-29 2013-07-23 Primal Fusion Inc. Systems and methods for semantic concept definition and semantic concept relationship synthesis utilizing existing domain definitions
US8498974B1 (en) 2009-08-31 2013-07-30 Google Inc. Refining search results
US8515975B1 (en) 2009-12-07 2013-08-20 Google Inc. Search entity transition matrix and applications of the transition matrix
US8521725B1 (en) * 2003-12-03 2013-08-27 Google Inc. Systems and methods for improved searching
US8548991B1 (en) * 2006-09-29 2013-10-01 Google Inc. Personalized browsing activity displays
US8583675B1 (en) * 2009-08-28 2013-11-12 Google Inc. Providing result-based query suggestions
US8595214B1 (en) 2004-03-31 2013-11-26 Google Inc. Systems and methods for article location and retrieval
US8595228B1 (en) 2009-01-09 2013-11-26 Google Inc. Preferred sites
US8615514B1 (en) 2010-02-03 2013-12-24 Google Inc. Evaluating website properties by partitioning user feedback
US8631001B2 (en) * 2004-03-31 2014-01-14 Google Inc. Systems and methods for weighting a search query result
US8631076B1 (en) 2004-03-31 2014-01-14 Google Inc. Methods and systems for associating instant messenger events
US8645367B1 (en) 2009-04-14 2014-02-04 Google Inc. Predicting data for document attributes based on aggregated data for repeated URL patterns
US8650125B2 (en) 1999-09-21 2014-02-11 I/P Engine, Inc. Content distribution system and method
US8661029B1 (en) 2006-11-02 2014-02-25 Google Inc. Modifying search result ranking based on implicit user feedback
US8676722B2 (en) 2008-05-01 2014-03-18 Primal Fusion Inc. Method, system, and computer program for user-driven dynamic generation of semantic networks and media synthesis
US8676732B2 (en) 2008-05-01 2014-03-18 Primal Fusion Inc. Methods and apparatus for providing information of interest to one or more users
US8676802B2 (en) 2006-11-30 2014-03-18 Oracle Otc Subsidiary Llc Method and system for information retrieval with clustering
US8676790B1 (en) 2003-12-05 2014-03-18 Google Inc. Methods and systems for improving search rankings using advertising data
US8694374B1 (en) 2007-03-14 2014-04-08 Google Inc. Detecting click spam
US8694511B1 (en) 2007-08-20 2014-04-08 Google Inc. Modifying search result ranking based on populations
US8744989B1 (en) 2010-08-26 2014-06-03 Google Inc. Ranking and vote scheduling using statistical confidence intervals
US20140180676A1 (en) * 2012-12-21 2014-06-26 Microsoft Corporation Named entity variations for multimodal understanding systems
US8825639B2 (en) 2004-06-30 2014-09-02 Google Inc. Endorsing search results
US8832083B1 (en) 2010-07-23 2014-09-09 Google Inc. Combining user feedback
US8838587B1 (en) 2010-04-19 2014-09-16 Google Inc. Propagating query classifications
US8843536B1 (en) 2004-12-31 2014-09-23 Google Inc. Methods and systems for providing relevant advertisements or other content for inactive uniform resource locators using search queries
US8849860B2 (en) 2005-03-30 2014-09-30 Primal Fusion Inc. Systems and methods for applying statistical inference techniques to knowledge representations
US8874555B1 (en) 2009-11-20 2014-10-28 Google Inc. Modifying scoring data based on historical changes
US8909616B2 (en) 2006-09-14 2014-12-09 Thomson Reuters Global Resources Information-retrieval systems, methods, and software with content relevancy enhancements
US8909627B1 (en) 2011-11-30 2014-12-09 Google Inc. Fake skip evaluation of synonym rules
US8909655B1 (en) 2007-10-11 2014-12-09 Google Inc. Time based ranking
US8924379B1 (en) 2010-03-05 2014-12-30 Google Inc. Temporal-based score adjustments
US8930351B1 (en) 2010-03-31 2015-01-06 Google Inc. Grouping of users
US8930350B1 (en) 2009-03-23 2015-01-06 Google Inc. Autocompletion using previously submitted query data
US8938463B1 (en) 2007-03-12 2015-01-20 Google Inc. Modifying search result ranking based on implicit user feedback and a model of presentation bias
US8954420B1 (en) 2003-12-31 2015-02-10 Google Inc. Methods and systems for improving a search ranking using article information
US8959093B1 (en) 2010-03-15 2015-02-17 Google Inc. Ranking search results based on anchors
US8959103B1 (en) 2012-05-25 2015-02-17 Google Inc. Click or skip evaluation of reordering rules
US8965882B1 (en) 2011-07-13 2015-02-24 Google Inc. Click or skip evaluation of synonym rules
US8965875B1 (en) 2012-01-03 2015-02-24 Google Inc. Removing substitution rules based on user interactions
US8972391B1 (en) 2009-10-02 2015-03-03 Google Inc. Recent interest based relevance scoring
US20150082135A1 (en) * 2013-09-13 2015-03-19 Clicktale Ltd. Method and system for generating comparable visual maps for browsing activity analysis
US9002867B1 (en) 2010-12-30 2015-04-07 Google Inc. Modifying ranking data based on document changes
US9009146B1 (en) 2009-04-08 2015-04-14 Google Inc. Ranking search results based on similar queries
US9020927B1 (en) 2012-06-01 2015-04-28 Google Inc. Determining resource quality based on resource competition
US9053129B1 (en) 2013-03-14 2015-06-09 Google Inc. Content item relevance based on presentation data
US9092510B1 (en) 2007-04-30 2015-07-28 Google Inc. Modifying search result ranking based on a temporal element of user feedback
US9092516B2 (en) 2011-06-20 2015-07-28 Primal Fusion Inc. Identifying information of interest based on user preferences
US9104759B1 (en) * 2012-01-13 2015-08-11 Google Inc. Identifying stem variants of search query terms
US9104779B2 (en) 2005-03-30 2015-08-11 Primal Fusion Inc. Systems and methods for analyzing and synthesizing complex knowledge representations
US9141672B1 (en) 2012-01-25 2015-09-22 Google Inc. Click or skip evaluation of query term optionalization rule
US9141964B1 (en) 2004-05-10 2015-09-22 Google Inc. Method and system for automatically creating an image advertisement
US9146966B1 (en) 2012-10-04 2015-09-29 Google Inc. Click or skip evaluation of proximity rules
US9152698B1 (en) 2012-01-03 2015-10-06 Google Inc. Substitute term identification based on over-represented terms identification
US9177248B2 (en) 2005-03-30 2015-11-03 Primal Fusion Inc. Knowledge representation systems and methods incorporating customization
US9183499B1 (en) 2013-04-19 2015-11-10 Google Inc. Evaluating quality based on neighbor features
US9223868B2 (en) 2004-06-28 2015-12-29 Google Inc. Deriving and using interaction profiles
US9235806B2 (en) 2010-06-22 2016-01-12 Primal Fusion Inc. Methods and devices for customizing knowledge representation systems
US9262446B1 (en) 2005-12-29 2016-02-16 Google Inc. Dynamically ranking entries in a personal data book
US9262520B2 (en) 2009-11-10 2016-02-16 Primal Fusion Inc. System, method and computer program for creating and manipulating data structures using an interactive graphical interface
US9292855B2 (en) 2009-09-08 2016-03-22 Primal Fusion Inc. Synthesizing messaging using context provided by consumers
US9361365B2 (en) 2008-05-01 2016-06-07 Primal Fusion Inc. Methods and apparatus for searching of content using semantic synthesis
US9378203B2 (en) 2008-05-01 2016-06-28 Primal Fusion Inc. Methods and apparatus for providing information of interest to one or more users
US9451310B2 (en) 1999-09-21 2016-09-20 Quantum Stream Inc. Content distribution system and method
US9563646B1 (en) 2004-05-10 2017-02-07 Google Inc. Method and system for mining image searches to associate images with concepts
US9623119B1 (en) 2010-06-29 2017-04-18 Google Inc. Accentuating search results
US9672481B1 (en) * 2009-10-30 2017-06-06 Parasoft Corporation System and method for automatically monitoring the overall health of a software project
US9792359B2 (en) * 2005-04-29 2017-10-17 Entit Software Llc Providing training information for training a categorizer
US10002325B2 (en) 2005-03-30 2018-06-19 Primal Fusion Inc. Knowledge representation systems and methods incorporating inference rules
US10108988B2 (en) 2005-12-30 2018-10-23 Google Llc Advertising with video ad creatives
US10248669B2 (en) 2010-06-22 2019-04-02 Primal Fusion Inc. Methods and devices for customizing knowledge representation systems
US10600090B2 (en) 2005-12-30 2020-03-24 Google Llc Query feature based data structure retrieval of predicted values
US11080757B2 (en) 2013-03-04 2021-08-03 Mindports AI, Inc. System and method for cyclic recognition-primed notifications and responsive situational awareness in an advertising display network
US11294977B2 (en) 2011-06-20 2022-04-05 Primal Fusion Inc. Techniques for presenting content to a user based on the user's preferences
US20220207030A1 (en) * 2020-12-26 2022-06-30 International Business Machines Corporation Unsupervised discriminative facet generation for dynamic faceted search
US11409812B1 (en) 2004-05-10 2022-08-09 Google Llc Method and system for mining image searches to associate images with concepts

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5321833A (en) * 1990-08-29 1994-06-14 Gte Laboratories Incorporated Adaptive ranking system for information retrieval
US5535382A (en) * 1989-07-31 1996-07-09 Ricoh Company, Ltd. Document retrieval system involving ranking of documents in accordance with a degree to which the documents fulfill a retrieval condition corresponding to a user entry
US5754939A (en) * 1994-11-29 1998-05-19 Herz; Frederick S. M. System for generation of user profiles for a system for customized electronic identification of desirable objects

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5535382A (en) * 1989-07-31 1996-07-09 Ricoh Company, Ltd. Document retrieval system involving ranking of documents in accordance with a degree to which the documents fulfill a retrieval condition corresponding to a user entry
US5321833A (en) * 1990-08-29 1994-06-14 Gte Laboratories Incorporated Adaptive ranking system for information retrieval
US5754939A (en) * 1994-11-29 1998-05-19 Herz; Frederick S. M. System for generation of user profiles for a system for customized electronic identification of desirable objects

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Fuhr et. al. Probabilistic Learning Approaches for indexing and retrieval with the TREC 2 Collection, TREC Text REtrieval Conference, pp. 67 74, 1993. *
Fuhr et. al. Probabilistic Learning Approaches for indexing and retrieval with the TREC-2 Collection, TREC Text REtrieval Conference, pp. 67-74, 1993.
Savoy, "A New Probabilistic Scheme for Information Retrieval in Hypertext", New Review of Hypermedia and Multimedia, Applications and Research, vol. 1, pp. 107-34, 1995.
Savoy, A New Probabilistic Scheme for Information Retrieval in Hypertext , New Review of Hypermedia and Multimedia, Applications and Research, vol. 1, pp. 107 34, 1995. *

Cited By (401)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6314420B1 (en) 1996-04-04 2001-11-06 Lycos, Inc. Collaborative/adaptive search engine
US6775664B2 (en) 1996-04-04 2004-08-10 Lycos, Inc. Information filter system and method for integrated content-based and collaborative/adaptive feedback queries
US6311178B1 (en) * 1997-09-29 2001-10-30 Webplus, Ltd. Multi-element confidence matching system and the method therefor
US6381592B1 (en) * 1997-12-03 2002-04-30 Stephen Michael Reuning Candidate chaser
US20110191410A1 (en) * 1998-01-30 2011-08-04 Net-Express, Ltd. WWW Addressing
US6507841B2 (en) 1998-02-20 2003-01-14 Hewlett-Packard Company Methods of and apparatus for refining descriptors
US20050177569A1 (en) * 1998-03-03 2005-08-11 Dwayne Bowman Identifying the items most relevant to a current query based on items selected in connection with similar queries
US7305390B2 (en) 1998-03-03 2007-12-04 A9.Com, Inc. Identifying the items most relevant to a current query based on items selected in connection with similar queries
US7921119B2 (en) 1998-03-03 2011-04-05 A9.Com, Inc. Identifying the items most relevant to a current query based on items selected in connection with similar queries
US7974885B1 (en) 1998-03-03 2011-07-05 A9.Com, Inc. Identifying items relevant to a current query based on items accessed in connection with similar queries
US7124129B2 (en) * 1998-03-03 2006-10-17 A9.Com, Inc. Identifying the items most relevant to a current query based on items selected in connection with similar queries
US7761446B2 (en) 1998-03-03 2010-07-20 A9.Com, Inc. Identifying the items most relevant to a current query based on items selected in connection with similar queries
US20020049752A1 (en) * 1998-03-03 2002-04-25 Dwayne Bowman Identifying the items most relevant to a current query based on items selected in connection with similar queries
US20060053065A1 (en) * 1998-03-03 2006-03-09 Dwayne Bowman Identifying items relevant to a current query based on items accessed in connection with similar queries
US8694385B1 (en) * 1998-03-03 2014-04-08 A9.Com, Inc. Identifying items relevant to a current query based on items accessed in connection with similar queries
US7620572B2 (en) 1998-03-03 2009-11-17 A9.Com, Inc. Identifying items relevant to a current query based on items accessed in connection with similar queries
US20070083507A1 (en) * 1998-03-03 2007-04-12 Dwayne Bowman Identifying the items most relevant to a current query based on items selected in connection with similar queries
US20080177728A1 (en) * 1998-03-03 2008-07-24 Dwayne Bowman Identifying the items most relevant to a current query based on items selected in connection with similar queries
US7996398B2 (en) 1998-07-15 2011-08-09 A9.Com, Inc. Identifying related search terms based on search behaviors of users
US20110035370A1 (en) * 1998-07-15 2011-02-10 Ortega Ruben E Identifying related search terms based on search behaviors of users
US20100106717A1 (en) * 1998-09-27 2010-04-29 Haim Zvi Melman Apparatus and method for search and retrieval of documents
US9965557B2 (en) 1998-09-27 2018-05-08 Uber Technologies, Inc. Apparatus and method for retrieval of documents
US9015134B2 (en) * 1998-09-27 2015-04-21 Haim Zvi Melman Apparatus and method for search and retrieval of documents
US9026509B2 (en) * 1998-09-27 2015-05-05 Haim Zvi Melman Apparatus and method for search and retrieval of documents
US20150081677A1 (en) * 1998-09-27 2015-03-19 Haim Zvi Melman Apparatus and method for search and retrieval of documents
US9262538B2 (en) 1998-09-27 2016-02-16 Haim Zvi Melman Apparatus and method for search and retrieval of documents
US9081813B2 (en) * 1998-09-27 2015-07-14 Haim Zvi Melman Apparatus and method for search and retrieval of documents
US9152710B2 (en) 1998-09-27 2015-10-06 Scailex Corporation Ltd. Apparatus and method for search and retrieval of documents
US20050114322A1 (en) * 1998-09-27 2005-05-26 Infobit, Ltd. Apparatus and Method fopr Search and Retrieval of Documents
US9229973B2 (en) 1998-09-27 2016-01-05 Haim Zvi Melman Apparatus and method for search and retrieval of documents
US6496824B1 (en) * 1999-02-19 2002-12-17 Saar Wilf Session management over a stateless protocol
US7162471B1 (en) 1999-05-11 2007-01-09 Maquis Techtrix Llc Content query system and method
USRE41754E1 (en) 1999-05-11 2010-09-21 Knight Timothy O User interface for interacting with online message board
US6859807B1 (en) * 1999-05-11 2005-02-22 Maquis Techtrix, Llc Online content tabulating system and method
USRE45661E1 (en) * 1999-05-11 2015-09-01 Maquis Techtrix Llc Online content tabulating system and method
USRE43835E1 (en) * 1999-05-11 2012-11-27 Maquis Techtrix Llc Online content tabulating system and method
US7159011B1 (en) 1999-05-11 2007-01-02 Maquis Techtrix, Llc System and method for managing an online message board
WO2000077689A1 (en) * 1999-06-16 2000-12-21 Triogo, Inc. A process for improving search engine efficiency using user feedback
US8650125B2 (en) 1999-09-21 2014-02-11 I/P Engine, Inc. Content distribution system and method
US8688582B2 (en) 1999-09-21 2014-04-01 I/P Engine, Inc. Content distribution system and method
US9047626B2 (en) 1999-09-21 2015-06-02 I/P Engine, Inc. Content distribution system and method
US8682794B2 (en) 1999-09-21 2014-03-25 I/P Engine, Inc. Content distribution system and method
US9451310B2 (en) 1999-09-21 2016-09-20 Quantum Stream Inc. Content distribution system and method
US9349136B2 (en) 1999-09-21 2016-05-24 Quantum Stream Inc. Content distribution system and method
US9117228B1 (en) 1999-09-21 2015-08-25 I/P Engine, Inc. Content distribution system and method
US9635408B2 (en) 1999-09-21 2017-04-25 Quantum Stream Inc. Content distribution system and method
US6810395B1 (en) * 1999-11-22 2004-10-26 Hewlett-Packard Development Company, L.P. Method and apparatus for query-specific bookmarking and data collection
US6785669B1 (en) * 2000-03-08 2004-08-31 International Business Machines Corporation Methods and apparatus for flexible indexing of text for use in similarity searches
US20010054020A1 (en) * 2000-03-22 2001-12-20 Barth Brian E. Method and apparatus for dynamic information connection engine
US20080033770A1 (en) * 2000-03-22 2008-02-07 Barth Brian E Method and apparatus for dynamic information connection search engine
US8458162B2 (en) 2000-03-22 2013-06-04 Kayak Software Corporation Purchase handoff in a travel search engine
US7349894B2 (en) 2000-03-22 2008-03-25 Sidestep, Inc. Method and apparatus for dynamic information connection search engine
US20020123994A1 (en) * 2000-04-26 2002-09-05 Yves Schabes System for fulfilling an information need using extended matching techniques
US20060259510A1 (en) * 2000-04-26 2006-11-16 Yves Schabes Method for detecting and fulfilling an information need corresponding to simple queries
US6859800B1 (en) * 2000-04-26 2005-02-22 Global Information Research And Technologies Llc System for fulfilling an information need
US7325201B2 (en) 2000-05-18 2008-01-29 Endeca Technologies, Inc. System and method for manipulating content in a hierarchical data-driven search and navigation system
US7617184B2 (en) 2000-05-18 2009-11-10 Endeca Technologies, Inc. Scalable hierarchical data-driven navigation system and method for information retrieval
US7912823B2 (en) 2000-05-18 2011-03-22 Endeca Technologies, Inc. Hierarchical data-driven navigation system and method for information retrieval
US20070083505A1 (en) * 2000-05-18 2007-04-12 Ferrari Adam J Hierarchical data-driven search and navigation system and method for information retrieval
US7035864B1 (en) 2000-05-18 2006-04-25 Endeca Technologies, Inc. Hierarchical data-driven navigation system and method for information retrieval
US7567957B2 (en) 2000-05-18 2009-07-28 Endeca Technologies, Inc. Hierarchical data-driven search and navigation system and method for information retrieval
US20050240557A1 (en) * 2000-05-22 2005-10-27 Overture Services, Inc. Method and apparatus for identifying related searches in a database search system
US7657555B2 (en) 2000-05-22 2010-02-02 Yahoo! Inc Method and apparatus for identifying related searches in a database search system
US20060167862A1 (en) * 2000-05-23 2006-07-27 Richard Reisman Method and apparatus for utilizing user feedback to improve signifier mapping
US8255541B2 (en) 2000-05-23 2012-08-28 Rpx Corporation Method and apparatus for utilizing user feedback to improve signifier mapping
US7062561B1 (en) 2000-05-23 2006-06-13 Richard Reisman Method and apparatus for utilizing the social usage learned from multi-user feedback to improve resource identity signifier mapping
US7461155B2 (en) 2000-05-23 2008-12-02 Richard Reisman Method and apparatus for utilizing the social usage learned from multi-user feedback to improve resource identity signifier mapping
US20090119286A1 (en) * 2000-05-23 2009-05-07 Richard Reisman Method and Apparatus for Utilizing User Feedback to Improve Signifier Mapping
US9158764B2 (en) 2000-05-23 2015-10-13 Rpx Corporation Method and apparatus for utilizing user feedback to improve signifier mapping
US6640218B1 (en) 2000-06-02 2003-10-28 Lycos, Inc. Estimating the usefulness of an item in a collection of information
US6606102B1 (en) 2000-06-02 2003-08-12 Gary Odom Optimizing interest potential
US7707063B2 (en) * 2000-07-24 2010-04-27 Emergency 24, Inc. Internet-based advertising and referral system
US20080033823A1 (en) * 2000-07-24 2008-02-07 Dante Monteverde Internet-Based Advertising and Referral System
US8849842B2 (en) 2000-08-30 2014-09-30 Rpx Corporation Task/domain segmentation in applying feedback to command control
US20060161507A1 (en) * 2000-08-30 2006-07-20 Richard Reisman Task/domain segmentation in applying feedback to command control
US7062488B1 (en) 2000-08-30 2006-06-13 Richard Reisman Task/domain segmentation in applying feedback to command control
US6954755B2 (en) 2000-08-30 2005-10-11 Richard Reisman Task/domain segmentation in applying feedback to command control
US8185545B2 (en) 2000-08-30 2012-05-22 Rpx Corporation Task/domain segmentation in applying feedback to command control
US6832218B1 (en) * 2000-09-22 2004-12-14 International Business Machines Corporation System and method for associating search results
US20020087390A1 (en) * 2000-10-04 2002-07-04 Weathersby Robert G. Method and system of using collective human intelligence to logically group related items
US20020169851A1 (en) * 2000-10-04 2002-11-14 Robert Weathersby Internet-based system for dynamically creating and delivering customized content within remote web pages
US20050210379A1 (en) * 2000-10-04 2005-09-22 Robert Weathersby Internet-based system for dynamically creating and delivering customized content within remote web pages
US6865571B2 (en) * 2000-10-31 2005-03-08 Hitachi, Ltd. Document retrieval method and system and computer readable storage medium
US20020073065A1 (en) * 2000-10-31 2002-06-13 Yasuhiko Inaba Document retrieval method and system and computer readable storage medium
US6564170B2 (en) * 2000-12-29 2003-05-13 Hewlett-Packard Development Company, L.P. Customizable user interfaces
US8001118B2 (en) 2001-03-02 2011-08-16 Google Inc. Methods and apparatus for employing usage statistics in document retrieval
US8352452B2 (en) 2001-03-02 2013-01-08 Google Inc. Methods and apparatus for employing usage statistics in document retrieval
US8156100B2 (en) 2001-03-02 2012-04-10 Google Inc. Methods and apparatus for employing usage statistics in document retrieval
US20020123988A1 (en) * 2001-03-02 2002-09-05 Google, Inc. Methods and apparatus for employing usage statistics in document retrieval
US20110179023A1 (en) * 2001-03-02 2011-07-21 Google Inc. Methods and Apparatus for Employing Usage Statistics in Document Retrieval
US20040205575A1 (en) * 2001-04-12 2004-10-14 Martin Wattenberg Method and system for incorporating a value in a document
US6738764B2 (en) 2001-05-08 2004-05-18 Verity, Inc. Apparatus and method for adaptively ranking search results
US6898737B2 (en) * 2001-05-24 2005-05-24 Microsoft Corporation Automatic classification of event data
US20030097617A1 (en) * 2001-05-24 2003-05-22 Goeller Sunni K. Automatic classification of event data
US20030014501A1 (en) * 2001-07-10 2003-01-16 Golding Andrew R. Predicting the popularity of a text-based object
US7263522B2 (en) 2001-07-23 2007-08-28 Hewlett-Packard Development Company, L.P. System and method for user adaptive software interface
US6694308B2 (en) * 2001-07-23 2004-02-17 Hewlett-Packard Development Company, L.P. System and method for user adaptive software interface
US20040107193A1 (en) * 2001-07-23 2004-06-03 Tremblay Michael A. System and method for user adaptive software interface
US20030018625A1 (en) * 2001-07-23 2003-01-23 Tremblay Michael A. System and method for user adaptive software interface
US20030146939A1 (en) * 2001-09-24 2003-08-07 John Petropoulos Methods and apparatus for mouse-over preview of contextually relevant information
US20060095424A1 (en) * 2001-09-24 2006-05-04 John Petropoulos Methods and apparatus for mouse-over preview of contextually relevant information
US7047502B2 (en) 2001-09-24 2006-05-16 Ask Jeeves, Inc. Methods and apparatus for mouse-over preview of contextually relevant information
US6944609B2 (en) 2001-10-18 2005-09-13 Lycos, Inc. Search results using editor feedback
US20030078914A1 (en) * 2001-10-18 2003-04-24 Witbrock Michael J. Search results using editor feedback
US7565367B2 (en) 2002-01-15 2009-07-21 Iac Search & Media, Inc. Enhanced popularity ranking
US20040215607A1 (en) * 2003-04-25 2004-10-28 Travis Robert L. Method and system fo blending search engine results from disparate sources into one search result
US7219090B2 (en) 2003-04-25 2007-05-15 Overture Services, Inc. Method and system for blending search engine results from disparate sources into one search result
US20050021397A1 (en) * 2003-07-22 2005-01-27 Cui Yingwei Claire Content-targeted advertising using collected user behavior data
EP2299396A1 (en) 2003-07-22 2011-03-23 Google, Inc. Improving content-targeted advertising using collected user behavior data
US20050027670A1 (en) * 2003-07-30 2005-02-03 Petropoulos Jack G. Ranking search results using conversion data
US8510294B2 (en) 2003-09-12 2013-08-13 Google Inc. Methods and systems for improving a search ranking using population information
US8024326B2 (en) 2003-09-12 2011-09-20 Google Inc. Methods and systems for improving a search ranking using related queries
US20050060310A1 (en) * 2003-09-12 2005-03-17 Simon Tong Methods and systems for improving a search ranking using population information
US20050060311A1 (en) * 2003-09-12 2005-03-17 Simon Tong Methods and systems for improving a search ranking using related queries
US7505964B2 (en) 2003-09-12 2009-03-17 Google Inc. Methods and systems for improving a search ranking using related queries
US8515951B2 (en) 2003-09-12 2013-08-20 Google Inc. Methods and systems for improving a search ranking using population information
US20110238643A1 (en) * 2003-09-12 2011-09-29 Google Inc. Methods and systems for improving a search ranking using population information
US8380705B2 (en) 2003-09-12 2013-02-19 Google Inc. Methods and systems for improving a search ranking using related queries
US7454417B2 (en) 2003-09-12 2008-11-18 Google Inc. Methods and systems for improving a search ranking using population information
US8452758B2 (en) 2003-09-12 2013-05-28 Google Inc. Methods and systems for improving a search ranking using related queries
US8090713B2 (en) 2003-09-12 2012-01-03 Google Inc. Methods and systems for improving a search ranking using population information
US20090112857A1 (en) * 2003-09-12 2009-04-30 Google Inc. Methods and Systems for Improving a Search Ranking Using Related Queries
US20070016491A1 (en) * 2003-09-30 2007-01-18 Xuejun Wang Method and apparatus for search scoring
US7840442B2 (en) * 2003-09-30 2010-11-23 Yahoo! Inc. Method and computer storage medium for search scoring
US9697249B1 (en) 2003-09-30 2017-07-04 Google Inc. Estimating confidence for query revision models
US10055461B1 (en) 2003-11-14 2018-08-21 Google Llc Ranking documents based on large data sets
US9116976B1 (en) 2003-11-14 2015-08-25 Google Inc. Ranking documents based on large data sets
US8364618B1 (en) 2003-11-14 2013-01-29 Google Inc. Large scale machine learning systems and methods
US8688705B1 (en) 2003-11-14 2014-04-01 Google Inc. Large scale machine learning systems and methods
US7769763B1 (en) 2003-11-14 2010-08-03 Google Inc. Large scale machine learning systems and methods
US7222127B1 (en) 2003-11-14 2007-05-22 Google Inc. Large scale machine learning systems and methods
US8195674B1 (en) 2003-11-14 2012-06-05 Google Inc. Large scale machine learning systems and methods
US7231399B1 (en) 2003-11-14 2007-06-12 Google Inc. Ranking documents based on large data sets
US7743050B1 (en) 2003-11-14 2010-06-22 Google Inc. Model generation for ranking documents based on large data sets
US8914358B1 (en) 2003-12-03 2014-12-16 Google Inc. Systems and methods for improved searching
US8521725B1 (en) * 2003-12-03 2013-08-27 Google Inc. Systems and methods for improved searching
US8676790B1 (en) 2003-12-05 2014-03-18 Google Inc. Methods and systems for improving search rankings using advertising data
US7302645B1 (en) 2003-12-10 2007-11-27 Google Inc. Methods and systems for identifying manipulated articles
US8156444B1 (en) 2003-12-31 2012-04-10 Google Inc. Systems and methods for determining a user interface attribute
US8271651B1 (en) 2003-12-31 2012-09-18 Google Inc. Methods and systems for regulating resource usage
US10423679B2 (en) 2003-12-31 2019-09-24 Google Llc Methods and systems for improving a search ranking using article information
US7707573B1 (en) 2003-12-31 2010-04-27 Google Inc. Systems and methods for providing and installing software
US9383987B1 (en) 2003-12-31 2016-07-05 Google Inc. Systems and methods for providing software updates
US8954420B1 (en) 2003-12-31 2015-02-10 Google Inc. Methods and systems for improving a search ranking using article information
US7281008B1 (en) 2003-12-31 2007-10-09 Google Inc. Systems and methods for constructing a query result set
US7516118B1 (en) 2003-12-31 2009-04-07 Google Inc. Methods and systems for assisted network browsing
US7437353B2 (en) 2003-12-31 2008-10-14 Google Inc. Systems and methods for unification of search results
US8321858B1 (en) 2003-12-31 2012-11-27 Google Inc. Systems and methods for providing software updates
US20050149498A1 (en) * 2003-12-31 2005-07-07 Stephen Lawrence Methods and systems for improving a search ranking using article information
US20050149500A1 (en) * 2003-12-31 2005-07-07 David Marmaros Systems and methods for unification of search results
US7925657B1 (en) 2004-03-17 2011-04-12 Google Inc. Methods and systems for adjusting a scoring measure based on query breadth
US8060517B2 (en) 2004-03-17 2011-11-15 Google Inc. Methods and systems for adjusting a scoring measure based on query breadth
US8099407B2 (en) 2004-03-31 2012-01-17 Google Inc. Methods and systems for processing media files
US8275839B2 (en) 2004-03-31 2012-09-25 Google Inc. Methods and systems for processing email messages
US20050223027A1 (en) * 2004-03-31 2005-10-06 Lawrence Stephen R Methods and systems for structuring event data in a database for location and retrieval
US9311408B2 (en) 2004-03-31 2016-04-12 Google, Inc. Methods and systems for processing media files
US20050246588A1 (en) * 2004-03-31 2005-11-03 Google, Inc. Profile based capture component
US8631076B1 (en) 2004-03-31 2014-01-14 Google Inc. Methods and systems for associating instant messenger events
US8631001B2 (en) * 2004-03-31 2014-01-14 Google Inc. Systems and methods for weighting a search query result
US7840547B1 (en) 2004-03-31 2010-11-23 Google Inc. Methods and systems for efficient query rewriting
US8631026B1 (en) 2004-03-31 2014-01-14 Google Inc. Methods and systems for efficient query rewriting
US8595214B1 (en) 2004-03-31 2013-11-26 Google Inc. Systems and methods for article location and retrieval
US9009153B2 (en) 2004-03-31 2015-04-14 Google Inc. Systems and methods for identifying a named entity
US7941439B1 (en) 2004-03-31 2011-05-10 Google Inc. Methods and systems for information capture
US10685017B1 (en) 2004-03-31 2020-06-16 Google Llc Methods and systems for efficient query rewriting
US7272601B1 (en) 2004-03-31 2007-09-18 Google Inc. Systems and methods for associating a keyword with a user interface area
US20070276829A1 (en) * 2004-03-31 2007-11-29 Niniane Wang Systems and methods for ranking implicit search results
US20070276801A1 (en) * 2004-03-31 2007-11-29 Lawrence Stephen R Systems and methods for constructing and using a user profile
US20070282797A1 (en) * 2004-03-31 2007-12-06 Niniane Wang Systems and methods for refreshing a content display
US7725508B2 (en) 2004-03-31 2010-05-25 Google Inc. Methods and systems for information capture and retrieval
US7310633B1 (en) 2004-03-31 2007-12-18 Google Inc. Methods and systems for generating textual information
US20080005090A1 (en) * 2004-03-31 2008-01-03 Khan Omar H Systems and methods for identifying a named entity
US7707142B1 (en) 2004-03-31 2010-04-27 Google Inc. Methods and systems for performing an offline search
US7693825B2 (en) 2004-03-31 2010-04-06 Google Inc. Systems and methods for ranking implicit search results
US7680809B2 (en) 2004-03-31 2010-03-16 Google Inc. Profile based capture component
US20080040315A1 (en) * 2004-03-31 2008-02-14 Auerbach David B Systems and methods for generating a user interface
US8041713B2 (en) 2004-03-31 2011-10-18 Google Inc. Systems and methods for analyzing boilerplate
US8386728B1 (en) 2004-03-31 2013-02-26 Google Inc. Methods and systems for prioritizing a crawl
US7680888B1 (en) 2004-03-31 2010-03-16 Google Inc. Methods and systems for processing instant messenger messages
US7333976B1 (en) 2004-03-31 2008-02-19 Google Inc. Methods and systems for processing contact information
US20080059419A1 (en) * 2004-03-31 2008-03-06 David Benjamin Auerbach Systems and methods for providing search results
US7412708B1 (en) 2004-03-31 2008-08-12 Google Inc. Methods and systems for capturing information
US7664734B2 (en) 2004-03-31 2010-02-16 Google Inc. Systems and methods for generating multiple implicit search queries
US8812515B1 (en) 2004-03-31 2014-08-19 Google Inc. Processing contact information
US8346777B1 (en) 2004-03-31 2013-01-01 Google Inc. Systems and methods for selectively storing event data
US7428528B1 (en) 2004-03-31 2008-09-23 Endeca Technologies, Inc. Integrated application for manipulating content in a hierarchical data-driven search and navigation system
US9189553B2 (en) 2004-03-31 2015-11-17 Google Inc. Methods and systems for prioritizing a crawl
US9836544B2 (en) 2004-03-31 2017-12-05 Google Inc. Methods and systems for prioritizing a crawl
US9959300B1 (en) * 2004-03-31 2018-05-01 Google Llc Systems and methods for article location and retrieval
US8161053B1 (en) 2004-03-31 2012-04-17 Google Inc. Methods and systems for eliminating duplicate events
US9165033B1 (en) 2004-03-31 2015-10-20 Google Inc. Efficient query rewriting
US7580568B1 (en) 2004-03-31 2009-08-25 Google Inc. Methods and systems for identifying an image as a representative image for an article
US7499958B1 (en) 2004-03-31 2009-03-03 Google Inc. Systems and methods of replicating all or part of a data store
US7581227B1 (en) 2004-03-31 2009-08-25 Google Inc. Systems and methods of synchronizing indexes
US10180980B2 (en) 2004-03-31 2019-01-15 Google Llc Methods and systems for eliminating duplicate events
US8520982B2 (en) 2004-05-10 2013-08-27 Google Inc. Method and system for providing targeted documents based on concepts automatically identified therein
US9141964B1 (en) 2004-05-10 2015-09-22 Google Inc. Method and system for automatically creating an image advertisement
US9563646B1 (en) 2004-05-10 2017-02-07 Google Inc. Method and system for mining image searches to associate images with concepts
US8849070B2 (en) 2004-05-10 2014-09-30 Google Inc. Method and system for providing targeted documents based on concepts automatically identified therein
US10146776B1 (en) 2004-05-10 2018-12-04 Google Llc Method and system for mining image searches to associate images with concepts
US11775595B1 (en) 2004-05-10 2023-10-03 Google Llc Method and system for mining image searches to associate images with concepts
US11681761B1 (en) 2004-05-10 2023-06-20 Google Llc Method and system for mining image searches to associate images with concepts
US11409812B1 (en) 2004-05-10 2022-08-09 Google Llc Method and system for mining image searches to associate images with concepts
US8064736B2 (en) 2004-05-10 2011-11-22 Google Inc. Method and system for providing targeted documents based on concepts automatically identified therein
US10152520B1 (en) 2004-06-17 2018-12-11 Google Llc Ranking documents based on user behavior and/or feature data
US8117209B1 (en) 2004-06-17 2012-02-14 Google Inc. Ranking documents based on user behavior and/or feature data
US9305099B1 (en) 2004-06-17 2016-04-05 Google Inc. Ranking documents based on user behavior and/or feature data
US7716225B1 (en) 2004-06-17 2010-05-11 Google Inc. Ranking documents based on user behavior and/or feature data
US9223868B2 (en) 2004-06-28 2015-12-29 Google Inc. Deriving and using interaction profiles
US10387512B2 (en) 2004-06-28 2019-08-20 Google Llc Deriving and using interaction profiles
US8131754B1 (en) 2004-06-30 2012-03-06 Google Inc. Systems and methods for determining an article association measure
US7827176B2 (en) 2004-06-30 2010-11-02 Google Inc. Methods and systems for endorsing local search results
US7761439B1 (en) 2004-06-30 2010-07-20 Google Inc. Systems and methods for performing a directory search
US20110040741A1 (en) * 2004-06-30 2011-02-17 Google Inc. Methods and Systems for Endorsing Local Search Results
US8880516B2 (en) 2004-06-30 2014-11-04 Google Inc. Endorsing local search results
US8825639B2 (en) 2004-06-30 2014-09-02 Google Inc. Endorsing search results
US8489586B2 (en) 2004-06-30 2013-07-16 Google Inc. Methods and systems for endorsing local search results
US9177063B2 (en) 2004-06-30 2015-11-03 Google Inc. Endorsing search results
US9633116B2 (en) 2004-06-30 2017-04-25 Google Inc. Endorsing local search results
US8005716B1 (en) 2004-06-30 2011-08-23 Google Inc. Methods and systems for establishing a keyword utilizing path navigation information
US7788274B1 (en) 2004-06-30 2010-08-31 Google Inc. Systems and methods for category-based search
US8615433B1 (en) 2004-06-30 2013-12-24 Google Inc. Methods and systems for determining and utilizing selection data
EP1622041A1 (en) * 2004-07-30 2006-02-01 France Telecom Distributed process and system for personalised filtering of search engine results
US20060036599A1 (en) * 2004-08-09 2006-02-16 Glaser Howard J Apparatus, system, and method for identifying the content representation value of a set of terms
US20060036565A1 (en) * 2004-08-10 2006-02-16 Carl Bruecken Passive monitoring of user interaction with a browser application
EP1779233A4 (en) * 2004-08-10 2008-10-15 Aol Llc Passive monitoring of user interaction with a browser application
EP1779233A2 (en) * 2004-08-10 2007-05-02 Aol Llc Passive monitoring of user interaction with a browser application
US7853606B1 (en) 2004-09-14 2010-12-14 Google, Inc. Alternate methods of displaying search results
US20100174716A1 (en) * 2004-09-30 2010-07-08 Google Inc. Methods and systems for improving text segmentation
US9652529B1 (en) 2004-09-30 2017-05-16 Google Inc. Methods and systems for augmenting a token lexicon
US7680648B2 (en) * 2004-09-30 2010-03-16 Google Inc. Methods and systems for improving text segmentation
US20070124301A1 (en) * 2004-09-30 2007-05-31 Elbaz Gilad I Methods and systems for improving text segmentation
US8306808B2 (en) 2004-09-30 2012-11-06 Google Inc. Methods and systems for selecting a language for text segmentation
US8078633B2 (en) 2004-09-30 2011-12-13 Google Inc. Methods and systems for improving text segmentation
US8051096B1 (en) 2004-09-30 2011-11-01 Google Inc. Methods and systems for augmenting a token lexicon
US7996208B2 (en) 2004-09-30 2011-08-09 Google Inc. Methods and systems for selecting a language for text segmentation
US20060074628A1 (en) * 2004-09-30 2006-04-06 Elbaz Gilad I Methods and systems for selecting a language for text segmentation
US8849852B2 (en) 2004-09-30 2014-09-30 Google Inc. Text segmentation
US20060073058A1 (en) * 2004-10-06 2006-04-06 Lg Electronics Inc. Orbiting vane compressor with side-inlet structure
US8312003B2 (en) 2004-12-16 2012-11-13 Hewlett-Packard Development Company, L.P. Computer method and apparatus for collaborative web searches
US8843536B1 (en) 2004-12-31 2014-09-23 Google Inc. Methods and systems for providing relevant advertisements or other content for inactive uniform resource locators using search queries
US20060184577A1 (en) * 2005-02-15 2006-08-17 Kaushal Kurapati Methods and apparatuses to determine adult images by query association
US20060224554A1 (en) * 2005-03-29 2006-10-05 Bailey David R Query revision using known highly-ranked queries
US8375049B2 (en) 2005-03-29 2013-02-12 Google Inc. Query revision using known highly-ranked queries
US20110060736A1 (en) * 2005-03-29 2011-03-10 Google Inc. Query Revision Using Known Highly-Ranked Queries
US7870147B2 (en) 2005-03-29 2011-01-11 Google Inc. Query revision using known highly-ranked queries
US9104779B2 (en) 2005-03-30 2015-08-11 Primal Fusion Inc. Systems and methods for analyzing and synthesizing complex knowledge representations
US8849860B2 (en) 2005-03-30 2014-09-30 Primal Fusion Inc. Systems and methods for applying statistical inference techniques to knowledge representations
US7860817B2 (en) 2005-03-30 2010-12-28 Primal Fusion Inc. System, method and computer program for facet analysis
US10002325B2 (en) 2005-03-30 2018-06-19 Primal Fusion Inc. Knowledge representation systems and methods incorporating inference rules
US9069841B1 (en) 2005-03-30 2015-06-30 Google Inc. Estimating confidence for query revision models
US7849090B2 (en) 2005-03-30 2010-12-07 Primal Fusion Inc. System, method and computer program for faceted classification synthesis
US20070118542A1 (en) * 2005-03-30 2007-05-24 Peter Sweeney System, Method and Computer Program for Faceted Classification Synthesis
US20070136221A1 (en) * 2005-03-30 2007-06-14 Peter Sweeney System, Method and Computer Program for Facet Analysis
US7844565B2 (en) 2005-03-30 2010-11-30 Primal Fusion Inc. System, method and computer program for using a multi-tiered knowledge representation model
US8010570B2 (en) 2005-03-30 2011-08-30 Primal Fusion Inc. System, method and computer program for transforming an existing complex data structure to another complex data structure
US20090300326A1 (en) * 2005-03-30 2009-12-03 Peter Sweeney System, method and computer program for transforming an existing complex data structure to another complex data structure
US9177248B2 (en) 2005-03-30 2015-11-03 Primal Fusion Inc. Knowledge representation systems and methods incorporating customization
US7606781B2 (en) 2005-03-30 2009-10-20 Primal Fusion Inc. System, method and computer program for facet analysis
US7596574B2 (en) 2005-03-30 2009-09-29 Primal Fusion, Inc. Complex-adaptive system for providing a facted classification
US20100036790A1 (en) * 2005-03-30 2010-02-11 Primal Fusion, Inc. System, method and computer program for facet analysis
US9934465B2 (en) 2005-03-30 2018-04-03 Primal Fusion Inc. Systems and methods for analyzing and synthesizing complex knowledge representations
US9904729B2 (en) 2005-03-30 2018-02-27 Primal Fusion Inc. System, method, and computer program for a consumer defined information architecture
US20080021925A1 (en) * 2005-03-30 2008-01-24 Peter Sweeney Complex-adaptive system for providing a faceted classification
US8140524B1 (en) 2005-03-30 2012-03-20 Google Inc. Estimating confidence for query revision models
US7574426B1 (en) 2005-03-31 2009-08-11 A9.Com, Inc. Efficiently identifying the items most relevant to a current query based on items selected in connection with similar queries
US9792359B2 (en) * 2005-04-29 2017-10-17 Entit Software Llc Providing training information for training a categorizer
US7818208B1 (en) 2005-06-28 2010-10-19 Google Inc. Accurately estimating advertisement performance
US7730074B1 (en) 2005-11-04 2010-06-01 Google Inc. Accelerated large scale optimization
US8019752B2 (en) 2005-11-10 2011-09-13 Endeca Technologies, Inc. System and method for information retrieval from object collections with complex interrelationships
US9262446B1 (en) 2005-12-29 2016-02-16 Google Inc. Dynamically ranking entries in a personal data book
US10108988B2 (en) 2005-12-30 2018-10-23 Google Llc Advertising with video ad creatives
US11587128B2 (en) 2005-12-30 2023-02-21 Google Llc Verifying presentation of video content
US11403676B2 (en) 2005-12-30 2022-08-02 Google Llc Interleaving video content in a multi-media document using keywords extracted from accompanying audio
US8429012B2 (en) 2005-12-30 2013-04-23 Google Inc. Using estimated ad qualities for ad filtering, ranking and promotion
US10706444B2 (en) 2005-12-30 2020-07-07 Google Llc Inserting video content in multi-media documents
US20070156514A1 (en) * 2005-12-30 2007-07-05 Daniel Wright Estimating ad quality from observed user behavior
US10679261B2 (en) 2005-12-30 2020-06-09 Google Llc Interleaving video content in a multi-media document using keywords extracted from accompanying audio
US8065184B2 (en) 2005-12-30 2011-11-22 Google Inc. Estimating ad quality from observed user behavior
US20110015988A1 (en) * 2005-12-30 2011-01-20 Google Inc. Using estimated ad qualities for ad filtering, ranking and promotion
US20070156887A1 (en) * 2005-12-30 2007-07-05 Daniel Wright Predicting ad quality
US10600090B2 (en) 2005-12-30 2020-03-24 Google Llc Query feature based data structure retrieval of predicted values
US11403677B2 (en) 2005-12-30 2022-08-02 Google Llc Inserting video content in multi-media documents
US20070156621A1 (en) * 2005-12-30 2007-07-05 Daniel Wright Using estimated ad qualities for ad filtering, ranking and promotion
US7827060B2 (en) 2005-12-30 2010-11-02 Google Inc. Using estimated ad qualities for ad filtering, ranking and promotion
US10949895B2 (en) 2005-12-30 2021-03-16 Google Llc Video content including content item slots
US7996396B2 (en) 2006-03-28 2011-08-09 A9.Com, Inc. Identifying the items most relevant to a current query based on user activity with respect to the results of similar queries
US8510302B2 (en) 2006-08-31 2013-08-13 Primal Fusion Inc. System, method, and computer program for a consumer defined information architecture
US8909616B2 (en) 2006-09-14 2014-12-09 Thomson Reuters Global Resources Information-retrieval systems, methods, and software with content relevancy enhancements
US8548991B1 (en) * 2006-09-29 2013-10-01 Google Inc. Personalized browsing activity displays
US8914362B1 (en) 2006-09-29 2014-12-16 Google Inc. Personalized browsing activity displays
US11188544B1 (en) 2006-11-02 2021-11-30 Google Llc Modifying search result ranking based on implicit user feedback
US11816114B1 (en) 2006-11-02 2023-11-14 Google Llc Modifying search result ranking based on implicit user feedback
US9235627B1 (en) 2006-11-02 2016-01-12 Google Inc. Modifying search result ranking based on implicit user feedback
US9811566B1 (en) 2006-11-02 2017-11-07 Google Inc. Modifying search result ranking based on implicit user feedback
US8661029B1 (en) 2006-11-02 2014-02-25 Google Inc. Modifying search result ranking based on implicit user feedback
US10229166B1 (en) 2006-11-02 2019-03-12 Google Llc Modifying search result ranking based on implicit user feedback
US8676802B2 (en) 2006-11-30 2014-03-18 Oracle Otc Subsidiary Llc Method and system for information retrieval with clustering
US8938463B1 (en) 2007-03-12 2015-01-20 Google Inc. Modifying search result ranking based on implicit user feedback and a model of presentation bias
US8694374B1 (en) 2007-03-14 2014-04-08 Google Inc. Detecting click spam
US9092510B1 (en) 2007-04-30 2015-07-28 Google Inc. Modifying search result ranking based on a temporal element of user feedback
US8346764B1 (en) 2007-06-01 2013-01-01 Thomson Reuters Global Resources Information retrieval systems, methods, and software with content-relevancy enhancements
US8694511B1 (en) 2007-08-20 2014-04-08 Google Inc. Modifying search result ranking based on populations
US9152678B1 (en) 2007-10-11 2015-10-06 Google Inc. Time based ranking
US8909655B1 (en) 2007-10-11 2014-12-09 Google Inc. Time based ranking
US20090125482A1 (en) * 2007-11-12 2009-05-14 Peregrine Vladimir Gluzman System and method for filtering rules for manipulating search results in a hierarchical search and navigation system
US7856434B2 (en) 2007-11-12 2010-12-21 Endeca Technologies, Inc. System and method for filtering rules for manipulating search results in a hierarchical search and navigation system
US20090248669A1 (en) * 2008-04-01 2009-10-01 Nitin Mangesh Shetti Method and system for organizing information
US9792550B2 (en) 2008-05-01 2017-10-17 Primal Fusion Inc. Methods and apparatus for providing information of interest to one or more users
US8676722B2 (en) 2008-05-01 2014-03-18 Primal Fusion Inc. Method, system, and computer program for user-driven dynamic generation of semantic networks and media synthesis
US8676732B2 (en) 2008-05-01 2014-03-18 Primal Fusion Inc. Methods and apparatus for providing information of interest to one or more users
US9378203B2 (en) 2008-05-01 2016-06-28 Primal Fusion Inc. Methods and apparatus for providing information of interest to one or more users
US11868903B2 (en) 2008-05-01 2024-01-09 Primal Fusion Inc. Method, system, and computer program for user-driven dynamic generation of semantic networks and media synthesis
US9361365B2 (en) 2008-05-01 2016-06-07 Primal Fusion Inc. Methods and apparatus for searching of content using semantic synthesis
US11182440B2 (en) 2008-05-01 2021-11-23 Primal Fusion Inc. Methods and apparatus for searching of content using semantic synthesis
US8346791B1 (en) 2008-05-16 2013-01-01 Google Inc. Search augmentation
US9128945B1 (en) 2008-05-16 2015-09-08 Google Inc. Query augmentation
US9916366B1 (en) 2008-05-16 2018-03-13 Google Llc Query augmentation
US20090326943A1 (en) * 2008-06-25 2009-12-31 Fujitsu Limited Guidance information display device, guidance information display method and recording medium
US8407047B2 (en) * 2008-06-25 2013-03-26 Fujitsu Limited Guidance information display device, guidance information display method and recording medium
US8495001B2 (en) 2008-08-29 2013-07-23 Primal Fusion Inc. Systems and methods for semantic concept definition and semantic concept relationship synthesis utilizing existing domain definitions
US9595004B2 (en) 2008-08-29 2017-03-14 Primal Fusion Inc. Systems and methods for semantic concept definition and semantic concept relationship synthesis utilizing existing domain definitions
US10803107B2 (en) 2008-08-29 2020-10-13 Primal Fusion Inc. Systems and methods for semantic concept definition and semantic concept relationship synthesis utilizing existing domain definitions
US8943016B2 (en) 2008-08-29 2015-01-27 Primal Fusion Inc. Systems and methods for semantic concept definition and semantic concept relationship synthesis utilizing existing domain definitions
US8396865B1 (en) 2008-12-10 2013-03-12 Google Inc. Sharing search engine relevance data between corpora
US8898152B1 (en) 2008-12-10 2014-11-25 Google Inc. Sharing search engine relevance data
US8595228B1 (en) 2009-01-09 2013-11-26 Google Inc. Preferred sites
US10025868B1 (en) 2009-01-09 2018-07-17 Google Llc Preferred sites
US9317563B1 (en) 2009-01-09 2016-04-19 Google Inc. Preferred sites
US9740780B1 (en) 2009-03-23 2017-08-22 Google Inc. Autocompletion using previously submitted query data
US8930350B1 (en) 2009-03-23 2015-01-06 Google Inc. Autocompletion using previously submitted query data
US9009146B1 (en) 2009-04-08 2015-04-14 Google Inc. Ranking search results based on similar queries
US8645367B1 (en) 2009-04-14 2014-02-04 Google Inc. Predicting data for document attributes based on aggregated data for repeated URL patterns
US8918417B1 (en) 2009-06-05 2014-12-23 Google Inc. Generating query refinements from user preference data
US8412727B1 (en) 2009-06-05 2013-04-02 Google Inc. Generating query refinements from user preference data
US9378247B1 (en) 2009-06-05 2016-06-28 Google Inc. Generating query refinements from user preference data
US8977612B1 (en) 2009-07-20 2015-03-10 Google Inc. Generating a related set of documents for an initial set of documents
US8447760B1 (en) 2009-07-20 2013-05-21 Google Inc. Generating a related set of documents for an initial set of documents
US8972394B1 (en) 2009-07-20 2015-03-03 Google Inc. Generating a related set of documents for an initial set of documents
US8583675B1 (en) * 2009-08-28 2013-11-12 Google Inc. Providing result-based query suggestions
US9092528B1 (en) 2009-08-28 2015-07-28 Google Inc. Providing result-based query suggestions
US10459989B1 (en) 2009-08-28 2019-10-29 Google Llc Providing result-based query suggestions
US9563692B1 (en) 2009-08-28 2017-02-07 Google Inc. Providing result-based query suggestions
US9697259B1 (en) 2009-08-31 2017-07-04 Google Inc. Refining search results
US8498974B1 (en) 2009-08-31 2013-07-30 Google Inc. Refining search results
US8738596B1 (en) 2009-08-31 2014-05-27 Google Inc. Refining search results
US9418104B1 (en) 2009-08-31 2016-08-16 Google Inc. Refining search results
US10181137B2 (en) 2009-09-08 2019-01-15 Primal Fusion Inc. Synthesizing messaging using context provided by consumers
US9292855B2 (en) 2009-09-08 2016-03-22 Primal Fusion Inc. Synthesizing messaging using context provided by consumers
US8972391B1 (en) 2009-10-02 2015-03-03 Google Inc. Recent interest based relevance scoring
US9390143B2 (en) 2009-10-02 2016-07-12 Google Inc. Recent interest based relevance scoring
US9672481B1 (en) * 2009-10-30 2017-06-06 Parasoft Corporation System and method for automatically monitoring the overall health of a software project
US9262520B2 (en) 2009-11-10 2016-02-16 Primal Fusion Inc. System, method and computer program for creating and manipulating data structures using an interactive graphical interface
US10146843B2 (en) 2009-11-10 2018-12-04 Primal Fusion Inc. System, method and computer program for creating and manipulating data structures using an interactive graphical interface
US8874555B1 (en) 2009-11-20 2014-10-28 Google Inc. Modifying scoring data based on historical changes
US8898153B1 (en) 2009-11-20 2014-11-25 Google Inc. Modifying scoring data based on historical changes
US10270791B1 (en) 2009-12-07 2019-04-23 Google Llc Search entity transition matrix and applications of the transition matrix
US9268824B1 (en) 2009-12-07 2016-02-23 Google Inc. Search entity transition matrix and applications of the transition matrix
US8515975B1 (en) 2009-12-07 2013-08-20 Google Inc. Search entity transition matrix and applications of the transition matrix
US8615514B1 (en) 2010-02-03 2013-12-24 Google Inc. Evaluating website properties by partitioning user feedback
US8924379B1 (en) 2010-03-05 2014-12-30 Google Inc. Temporal-based score adjustments
US8959093B1 (en) 2010-03-15 2015-02-17 Google Inc. Ranking search results based on anchors
US8930351B1 (en) 2010-03-31 2015-01-06 Google Inc. Grouping of users
US9659097B1 (en) 2010-04-19 2017-05-23 Google Inc. Propagating query classifications
US8838587B1 (en) 2010-04-19 2014-09-16 Google Inc. Propagating query classifications
US11474979B2 (en) 2010-06-22 2022-10-18 Primal Fusion Inc. Methods and devices for customizing knowledge representation systems
US9235806B2 (en) 2010-06-22 2016-01-12 Primal Fusion Inc. Methods and devices for customizing knowledge representation systems
US10248669B2 (en) 2010-06-22 2019-04-02 Primal Fusion Inc. Methods and devices for customizing knowledge representation systems
US10474647B2 (en) 2010-06-22 2019-11-12 Primal Fusion Inc. Methods and devices for customizing knowledge representation systems
US9576241B2 (en) 2010-06-22 2017-02-21 Primal Fusion Inc. Methods and devices for customizing knowledge representation systems
US9623119B1 (en) 2010-06-29 2017-04-18 Google Inc. Accentuating search results
US8832083B1 (en) 2010-07-23 2014-09-09 Google Inc. Combining user feedback
US8744989B1 (en) 2010-08-26 2014-06-03 Google Inc. Ranking and vote scheduling using statistical confidence intervals
US8346792B1 (en) 2010-11-09 2013-01-01 Google Inc. Query generation using structural similarity between documents
US9092479B1 (en) 2010-11-09 2015-07-28 Google Inc. Query generation using structural similarity between documents
US9436747B1 (en) 2010-11-09 2016-09-06 Google Inc. Query generation using structural similarity between documents
US9002867B1 (en) 2010-12-30 2015-04-07 Google Inc. Modifying ranking data based on document changes
US20120197979A1 (en) * 2011-01-24 2012-08-02 Palm Leon G Web-wide content quality crowd sourcing
US11294977B2 (en) 2011-06-20 2022-04-05 Primal Fusion Inc. Techniques for presenting content to a user based on the user's preferences
US10409880B2 (en) 2011-06-20 2019-09-10 Primal Fusion Inc. Techniques for presenting content to a user based on the user's preferences
US9092516B2 (en) 2011-06-20 2015-07-28 Primal Fusion Inc. Identifying information of interest based on user preferences
US9098575B2 (en) 2011-06-20 2015-08-04 Primal Fusion Inc. Preference-guided semantic processing
US9715552B2 (en) 2011-06-20 2017-07-25 Primal Fusion Inc. Techniques for presenting content to a user based on the user's preferences
US8965882B1 (en) 2011-07-13 2015-02-24 Google Inc. Click or skip evaluation of synonym rules
US8909627B1 (en) 2011-11-30 2014-12-09 Google Inc. Fake skip evaluation of synonym rules
US8965875B1 (en) 2012-01-03 2015-02-24 Google Inc. Removing substitution rules based on user interactions
US9152698B1 (en) 2012-01-03 2015-10-06 Google Inc. Substitute term identification based on over-represented terms identification
US9104759B1 (en) * 2012-01-13 2015-08-11 Google Inc. Identifying stem variants of search query terms
US9141672B1 (en) 2012-01-25 2015-09-22 Google Inc. Click or skip evaluation of query term optionalization rule
US8959103B1 (en) 2012-05-25 2015-02-17 Google Inc. Click or skip evaluation of reordering rules
US9020927B1 (en) 2012-06-01 2015-04-28 Google Inc. Determining resource quality based on resource competition
US10133788B1 (en) 2012-06-01 2018-11-20 Google Llc Determining resource quality based on resource competition
US9146966B1 (en) 2012-10-04 2015-09-29 Google Inc. Click or skip evaluation of proximity rules
US9916301B2 (en) * 2012-12-21 2018-03-13 Microsoft Technology Licensing, Llc Named entity variations for multimodal understanding systems
US20140180676A1 (en) * 2012-12-21 2014-06-26 Microsoft Corporation Named entity variations for multimodal understanding systems
US11080757B2 (en) 2013-03-04 2021-08-03 Mindports AI, Inc. System and method for cyclic recognition-primed notifications and responsive situational awareness in an advertising display network
US9053129B1 (en) 2013-03-14 2015-06-09 Google Inc. Content item relevance based on presentation data
US9183499B1 (en) 2013-04-19 2015-11-10 Google Inc. Evaluating quality based on neighbor features
US10079737B2 (en) * 2013-09-13 2018-09-18 Clicktale Ltd. Method and system for generating comparable visual maps for browsing activity analysis
US20150082135A1 (en) * 2013-09-13 2015-03-19 Clicktale Ltd. Method and system for generating comparable visual maps for browsing activity analysis
US20220207030A1 (en) * 2020-12-26 2022-06-30 International Business Machines Corporation Unsupervised discriminative facet generation for dynamic faceted search

Similar Documents

Publication Publication Date Title
US6006222A (en) Method for organizing information
US6014665A (en) Method for organizing information
US6078916A (en) Method for organizing information
Gauch et al. ProFusion*: Intelligent fusion from multiple, distributed search engines
US6182068B1 (en) Personalized search methods
US6496818B1 (en) Semi-automatic index term augmentation in document retrieval
US7881981B2 (en) Methods and computer readable media for determining a macro-context based on a micro-context of a user search
US7054870B2 (en) Apparatus and methods for organizing and/or presenting data
JP4990431B2 (en) Information retrieval from hierarchically duplicated documents
US7657555B2 (en) Method and apparatus for identifying related searches in a database search system
JP3562572B2 (en) Detect and track new items and new classes in database documents
US6385602B1 (en) Presentation of search results using dynamic categorization
US5924090A (en) Method and apparatus for searching a database of records
CA2513851C (en) Phrase-based generation of document descriptions
US20030212669A1 (en) System and method for context based searching of electronic catalog database, aided with graphical feedback to the user
US20010016846A1 (en) Method for interactively creating an information database including preferred information elements, such as, preferred-authority, world wide web pages
US20060167864A1 (en) Search engine system for locating web pages with product offerings
US20030014501A1 (en) Predicting the popularity of a text-based object
US20020107718A1 (en) "Host vendor driven multi-vendor search system for dynamic market preference tracking"
US8156096B2 (en) Supplier identification and locator system and method
US20030078928A1 (en) Network wide ad targeting
WO2007127676A1 (en) System and method for indexing web content using click-through features
EP1240605A4 (en) System and method for locating and displaying web-based product offerings
WO2006099626A2 (en) System and method for providing interactive feature selection for training a document classification system
US20050149473A1 (en) Dynamic grouping of content including captive data

Legal Events

Date Code Title Description
AS Assignment

Owner name: DIRECT HIT TECHNOLOGIES, INC., MASSACHUSETTS

Free format text: EXCLUSIVE LICENSE;ASSIGNOR:CULLISS, GARY;REEL/FRAME:010181/0794

Effective date: 19980522

STCF Information on status: patent grant

Free format text: PATENTED CASE

AS Assignment

Owner name: ASK JEEVES, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CULLISS, GARY A.;REEL/FRAME:010731/0774

Effective date: 20000323

FEPP Fee payment procedure

Free format text: PAT HOLDER NO LONGER CLAIMS SMALL ENTITY STATUS, ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: STOL); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

REFU Refund

Free format text: REFUND - SURCHARGE, PETITION TO ACCEPT PYMT AFTER EXP, UNINTENTIONAL (ORIGINAL EVENT CODE: R2551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: IAC SEARCH & MEDIA, INC., CALIFORNIA

Free format text: CHANGE OF NAME;ASSIGNOR:ASK JEEVES, INC.;REEL/FRAME:017892/0276

Effective date: 20060208

FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12