System and method for generating refinement categories for a set of search results

• US 7,523,095 B2
• Filed: 04/29/2003
• Issued: 04/21/2009
• Est. Priority Date: 04/29/2003
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Holt, Alexander W., Moran, Michael E., Gates, Stephen C., Velderman, Pat
• Primary Examiner(s): Mofiz; Apu M
• Assistant Examiner(s): LU, CHARLES EDWARD
• Application Number:
  US10/426,166
• Publication Number:
  US 20040220902A1
• Time in Patent Office: 2,184 Days
• Field of Search: 707/1, 707/100, 707/3, 707/5
• US Class Current: 1/1
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9538 Presentation of query results
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

A system for enhancing search results generated in response to a search query. The system comprises: a category identifier system that analyzes each search result and identifies at least one category from a hierarchy of categories for each search result, thereby providing a list of identified categories; a ranking system that ranks each category in the list of identified categories; and a selection system that selects a predetermined number of the highest ranking categories from the list of identified categories to generate the set of refinement categories, wherein the selection system eliminates categories from the set of refinement categories if the category has a parent in the set of refinement categories.

Claims

1. A method executed by a computer for generating a set of categories in response to a search query, comprising:

generating a plurality of search results in response to a query;

identifying at least one category from a hierarchy of categories for each search result;

rank-ordering each identified category in descending order based on a number of times the category was identified for the plurality of search results;

selecting an initial set of refinement categories based on the rank-ordering of the identified categories, wherein the initial set of refinement categories contains a plurality of categories, and wherein the number of categories in the initial set of refinement categories is less than the total number of categories identified in the identifying step;

eliminating all categories from the initial set of refinement categories that meet an elimination criterion, wherein the eliminating generates a resulting set of refinement categories, wherein the eliminating further includes eliminating all categories from the initial set of refinement categories that have a hierarchical ancestor in the initial set of refinement categories, wherein, after the eliminating step, generating a final set of refinement categories by adding a new category for each category eliminated during the eliminating step to the resulting set of refinement categories, and wherein the new category is a next highest-ranking category in the rank-ordering of the identified categories that was not in the initial set of refinement categories based on the rank-ordering of the identified categories;

appending a supplementary category to the final set of refinement categories, wherein the supplementary category provides access to identified categories not in the final set of refinement categories, and wherein selection of the supplementary category causes a new search to be executed using the same search query but with the final set of refinement categories and their children and grandchildren excluded and removing all the children and grandchildren from a current category list; and

displaying the final set of refinement categories and the supplementary category.

2. The method of claim 1, wherein the identifying step includes examining metadata in each search result.

3. The method of claim 1, wherein the initial set of refinement categories comprises a predetermined number of the most frequently identified categories.

4. The method of claim 1, further comprising providing an interface to allow an end user to select a category from the resulting set of refinement categories to narrow the search query.

5. The method of claim 1, wherein the elimination criterion eliminates categories that have a hierarchical parent in the set of refinement categories.

6. The method of claim 1, where the elimination criterion is based on hierarchical relationship between nodes of a taxonomy in the initial set of refinement categories.

7. The method of claim 1, wherein the elimination criterion is based on a user profile of interests.

8. The method of claim 1, wherein the identifying step includes using an automated categorization system to determine the category to which a document belongs.