Adaptive ranking system for information retrieval

• US 5,321,833 A
• Filed: 08/29/1990
• Issued: 06/14/1994
• Est. Priority Date: 08/29/1990
• Status: Expired due to Term

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: GTE Laboratories Incorporated (Lumen Technologies, Inc.)
• Inventors: Du, Min-Wen, Chow, Anita, Chang, Shih-Chio
• Primary Examiner(s): Kriess, Kevin A.
• Application Number:
  US07/574,828
• Time in Patent Office: 1,385 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 395/600, 395/650, 395/700
• US Class Current: 1/1
• CPC Class Codes: G06F 16/3338 Query expansion
• CPC Class Codes: G06F 16/3347 using vector based model
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

An adaptive record ranking method for full text information retrieval, which quantifies the relevance of retrieved records to query terms occurring in said record. The method utilizes a multilevel weighting technique which permits user input to affect record weighting at each level of the ranking process. The method utilizes weighted attributes of properties of terms occurring in the records of the data base and compensates for the distance between adjacent words of complex terms. The method has been implemented on large full text data bases and the resulting rankings achieve a relatively high level of precision in ranking the relevance of retrieved records to a user query.

Claims

1. A method for adaptive, multilevel record ranking by a computer system having a monitor for output display of record responses to a query directed to a full-text data base whereby retrieved records are quantitatively ranked with respect to their relevance to the terms of a query, comprising the computer implemented steps of:

receiving a set Q of query terms t, wherein a term t may include more than one word, to form a query full-text searching;

receiving a plurality of ordered relevance factors to modify said query terms onto a number of levels;

receiving, for each relevance factor F, assigned values for attributes of properties of said query terms t which affect the relevance value of any record r to query terms t for each level;

searching a full text data base to retrieve records containing said query terms t;

calculating, for each query term t, a first relevance weight for each retrieved record r as a function of its occurrence in record r and, for a term having more than one word, the distance between the nearest occurrences of words of said term t in record r;

calculating, for each query term t and for each of said attributes, a second relevance weight value for each retrieved record r as a function of said first relevance weight value and said attributes affecting said relevance factor;

calculating, for each retrieved record r, a third relevance weight as a function of all of said second relevance weight values for all of said query terms t appearing in said record r;

using said third relevance weight as the weight of record r to determine its rank at each level;

ranking all retrieved records according to the quantitative values of said third relevance weights at each level with respect to all query terms in said query Q; and

displaying retrieved records in ranked order.

2. The method of claim 1 further comprising the steps of:

receiving for each relevance factor F, at least one different reassigned value for at least one attribute of properties of said query terms t which affect the relevance value of any record r to query terms t for each level;

searching a full text data base to retrieve records containing said query terms t;

recalculating successively said first, second and third relevance weights for each level; and

ranking all retrieved records according to the quantitative values of said recalculated third relevance weights at each level, where a successive level gives precedence to a prior level.

3. The method of claim 1 wherein the step of calculating a first relevance weight further comprises the steps of:

counting each occurrence of t as 1, if t is a single word;

counting each occurrence of t plus each occurrence of each word in t, where t contains s words, s>

1, by counting adjacency occurrences of consecutive pairs of words in term t, where the distance d between occurrences of words in said pairs is 1+ the number of words in between said occurrences, according to the formula;

##EQU6## summing the counts of the s words within term t and the adjacency counts; and

multiplying said sum by ##EQU7##

4. The method of claim 1 wherein the step of calculating a second relevance weight further comprises the steps of:

receiving a set of attributes A for each query term t which impact the relevance of that term t for a record r at a level i;

receiving, for each attribute a, a coefficient to multiply its value relative to other attributes;

receiving, for each attribute a of each term t in record r, a value indicating whether the impact of said attribute is positive, neutral or negative; and

multiplying said first calculated relevance weight of each term t in record r by said relevance impact factor of each of said attributes of t, resulting in said second calculated relevance weight.

5. The method of claim 1 wherein the step of calculating said third relevance weight further comprises the steps of:

summing the individual second calculated relevance weights for each attribute of each query term t appearing in record r to obtain the weighted relevance of record r for each level.

6. The method of claim 3 wherein said set of attributes received as relevance weight functions to quantify a record term includes:

importance, the relative weight of term t assigned by the user;

popularity, the number of records in the text base having term t;

frequency, the number of occurrences of term t in a record r;

record id, the identification number of record r;

word location, the average position of the occurrences of a word of term t in a record r.

7. The method of claim 4 wherein the step of assigning values to the impact of an attribute of the occurrence of a term t in a record r comprises:

assigning a value A_j.sbsb.tr if attribute A_j.sbsb.tr has a positive impact on level i;

assigning a value 1/A_j.sbsb.tr if attribute A_j.sbsb.tr has a negative impact on level i; and

assigning a value 1 otherwise.

8. The method of claim 1 wherein the relevance of a record r to a query Q is ##EQU8##