Computer-implemented information reuse

• US 8,768,921 B2
• Filed: 10/20/2011
• Issued: 07/01/2014
• Est. Priority Date: 10/20/2011
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Ghosal, Sugata, Ghosh, Anup K., Kambhatla, Nandakishore, Kanjirathinkal, Rose C., Lahiri, Asidhara, Majumdar, Debapriyo, Mohamed, Shajith I., Visweswariah, Karthik
• Primary Examiner(s): Fleurantin, Jean B
• Assistant Examiner(s): Ly, Anh
• Application Number:
  US13/277,307
• Publication Number:
  US 20130103682A1
• Time in Patent Office: 985 Days
• Field of Search: 707/748, 707/723, 707/735, 707/796, 707/728, 707/731, 707/759, 707/769, 707/682, 707/E17.014, 707/E17.063, 707/803, 707/E17.005, 707/E17.044, 707/E17.009, 707/776, 717/167, 717/168, 717/172, 717/128, 717/124, 717/126, 717/141, 714/38, 714/39, 714/25, 714/45, 714/E11.145, 709/224, 709/229, 709/206, 713/152, 713/160, 713/165, 713/193, 715/709, 706/11, 706/12, 706/13, 706/50
• US Class Current: 707/731
• CPC Class Codes: G06F 11/0781 Error filtering or prioritizing based on a policy defined by the user or on a policy defined by a hardware/software module, e.g. according to a severity level
• CPC Class Codes: G06F 16/215 Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/3349 Reuse of stored results of previous queries

Abstract

Embodiments of the present invention relate to an approach for reusing information/knowledge. Specifically, embodiments of the present invention provide an approach for retrieving previously stored data to satisfy queries (e.g., jobs/tickets) for solutions to problems while maintaining privacy/security of the data as well as ensuring the quality of the results. In a typical embodiment, a query for a solution to a problem is received and details are extracted therefrom. Using the details, a search is performed on a set of data stored in at least one computer storage device. Based on the search, a set of results will be generated and classified into a set of categories. In any event, the quality of each of the set of results will be assessed based on the usefulness of the set of results.

Claims

1. A computer-implemented method for reusing information, comprising:

one or more processors;

one or more memories;

receiving a query for a solution to a problem;

extracting details from the query;

performing a search on a set of data stored in at least one computer storage device using the details;

generating a set of results based on the search;

determining at least one domain of the set of results;

sanitizing the set of results prior to the classifying;

removing private details from the set of results;

classifying the set of results of the at least one domain into a set of domain-specific categories;

assessing a quality of each of the set of results based on a usefulness of the set of results, the usefulness being determined using language derived from a problem statement of the query; and

ranking the set of results within the domain-specific categories based on the quality as assessed.

2. The computer-implemented method of claim 1, the details extracted from the query comprising at least one of the following:

a program name, a module name, or a keyword from the query.

3. The computer-implemented method of claim 1, the usefulness being further determined by deriving structural and content level features from text of the query.

4. The computer-implemented method of claim 1, the usefulness being further determined based on a best match of the set of results to the query.

5. A system for reusing information, comprising:

a memory medium comprising instructions;

a bus coupled to the memory medium; and

a processor coupled to the bus that when executing the instructions causes the system to;

receive a query for a solution to a problem;

extract details from the query;

perform a search on a set of data stored in at least one computer storage device using the details;

generate a set of results based on the search;

determine a plurality of domains of the set of results;

sanitize the set of results prior to the classification;

remove private details from the set of results;

classify the set of results of the plurality of domains into a set of domain-specific categories;

assess a quality of each of the set of results based on a usefulness of the set of results, the usefulness being determined using language derived from a problem statement of the query; and

rank the set of results within the domain-specific categories based on the quality as assessed.

6. The system of claim 5, the details extracted from the query comprising at least one of the following:

a program name, a module name, or a keyword from the query.

7. The system of claim 5, the usefulness being further determined by deriving structural and content level features from text of the query.

8. The system of claim 5, the usefulness being further determined based on a best match of the set of results to the query.

9. A computer program product for reusing information, the computer program product comprising a non-transitory computer readable storage media, and

program instructions stored on the non-transitory computer readable storage device, to:

receive a query for a solution to a problem;

extract details from the query;

perform a search on a set of data stored in at least one computer storage device using the details;

generate a set of results based on the search;

determine a set of domains of the set of results;

sanitize the set of results prior to the classification;

remove private details from the set of results;

classify the set of results of the set of domains into a set of domain-specific categories;

assess a quality of each of the set of results based on a usefulness of the set of results, the usefulness being determined using language derived from a problem statement of the query; and

rank the set of results within the domain-specific categories based on the quality as assessed.

10. The computer program product of claim 9, the details extracted from the query comprising at least one of the following:

a program name, a module name, or a keyword from the query.

11. The computer program product of claim 9, the usefulness being further determined by deriving structural and content level features from text of the query.