FINDING RELATIONSHIPS AND HIERARCHIES USING TAXONOMIES

• US 20130041920A1
• Filed: 08/08/2011
• Published: 02/14/2013
• Est. Priority Date: 08/08/2011
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Bufe, John P., Kaufmann, Samuel A., Webster, Ian W., Zagelow, Margaret A.
• Application Number:
  US13/205,456
• Publication Number:
  US 20130041920A1
• Time in Patent Office: Days
• US Class Current: 707/777
• CPC Class Codes: G06F 16/358 Browsing; Visualisation therefor

Abstract

Provided are techniques for creating a hierarchy of results. An unstructured result set is received. Each result in the unstructured result set is hashed into a preliminary result set. For each hashed result, one or more related concepts are obtained using one or more taxonomies; one or more matches between the one or more related concepts and other hashed results in the preliminary result set are found; a candidate group for the hashed result is formed, wherein the candidate group includes the hashed result and one or more other hashed results based on the one or more matches; in response to determining that a frequency associated with the hashed result exceeds a threshold, the candidate group associated with that hashed result is compared with pre-existing groups that are in use; and, based on the comparing, one or more suggestions regarding the candidate group are provided.

Claims

1. A method for creating a hierarchy of results, comprising:

receiving, using a processor of a computer device, an unstructured result set;

hashing each result in the unstructured result set into a preliminary result set; and

for each hashed result in the preliminary result set,

obtaining one or more related concepts using one or more taxonomies;

finding one or more matches between the one or more related concepts and other hashed results in the preliminary result set;

forming a candidate group for the hashed result, wherein the candidate group includes the hashed result and one or more other hashed results based on the one or more matches;

in response to determining that a frequency associated with the hashed result exceeds a threshold, comparing the candidate group associated with that hashed result with pre-existing groups that are in use; and

based on the comparing, providing one or more suggestions regarding the candidate group.

2. The method of claim 1, further comprising:

providing grouped result sets with a hierarchical structure.

3. The method of claim 1, wherein the suggestion comprises one of:

a suggestion that the candidate group should be created as a new group independent of other groups, a suggestion that the candidate group be created as a sub-group of another group, a suggestion that the candidate group be created as a super-group that includes at least one other group, a suggestion that the candidate group be ignored, and a suggestion that the hashed result be added to an existing group without forming a new group.

4. The method of claim 1, wherein the comparison takes into account a percentage that the candidate and pre-existing groups match and a status of each preexisting group to determine the suggestion.

5. The method of claim 1, further comprising:

receiving input selecting a suggestion from the one or more suggestions;

processing the selected suggestion; and

associating a category with the candidate group.

6. The method of claim 5, wherein the category comprises one of active, suggested, and ignored.

7. The method of claim 1, wherein the taxonomies include at least one of external taxonomies and customized taxonomies.

8. A computing device for creating a hierarchy of results, comprising:

a processor; and

a storage device connected to the processor,

wherein the storage device has stored thereon a program, and

wherein the processor is configured to execute instructions of the program to perform operations, wherein the operations comprise;

receiving an unstructured result set;

hashing each result in the unstructured result set into a preliminary result set; and

for each hashed result in the preliminary result set,

obtaining one or more related concepts using one or more taxonomies;

finding one or more matches between the one or more related concepts and other hashed results in the preliminary result set;

forming a candidate group for the hashed result, wherein the candidate group includes the hashed result and one or more other hashed results based on the one or more matches;

in response to determining that a frequency associated with the hashed result exceeds a threshold, comparing the candidate group associated with that hashed result with pre-existing groups that are in use; and

based on the comparing, providing one or more suggestions regarding the candidate group.

9. The system of claim 8, wherein the operations further comprise:

providing grouped result sets with a hierarchical structure.

10. The system of claim 8, wherein the suggestion comprises one of:

a suggestion that the candidate group should be created as a new group independent of other groups, a suggestion that the candidate group be created as a sub-group of another group, a suggestion that the candidate group be created as a super-group that includes at least one other group, a suggestion that the candidate group be ignored, and a suggestion that the hashed result be added to an existing group without forming a new group.

11. The system of claim 8, wherein the comparison takes into account a percentage that the candidate and pre-existing groups match and a status of each preexisting group to determine the suggestion.

12. The system of claim 8, wherein the operations further comprise:

receiving input selecting a suggestion from the one or more suggestions;

processing the selected suggestion; and

associating a category with the candidate group.

13. The system of claim 12, wherein the category comprises one of active, suggested, and ignored.

14. The system of claim 8, wherein the taxonomies include at least one of external taxonomies and customized taxonomies.

15. A computer program product for creating a hierarchy of results, the computer program product comprising:

a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising;

computer readable program code, when executed by a processor of a computing device, configured to perform;

receiving an unstructured result set;

hashing each result in the unstructured result set into a preliminary result set; and

for each hashed result in the preliminary result set,

obtaining one or more related concepts using one or more taxonomies;

finding one or more matches between the one or more related concepts and other hashed results in the preliminary result set;

forming a candidate group for the hashed result, wherein the candidate group includes the hashed result and one or more other hashed results based on the one or more matches;

in response to determining that a frequency associated with the hashed result exceeds a threshold, comparing the candidate group associated with that hashed result with pre-existing groups that are in use; and

based on the comparing, providing one or more suggestions regarding the candidate group.

16. The computer program product of claim 15, wherein the computer readable program code, when executed by the processor of the computing device, is configured to perform:

providing grouped result sets with a hierarchical structure.

17. The computer program product of claim 15, wherein the suggestion comprises one of:

a suggestion that the candidate group should be created as a new group independent of other groups, a suggestion that the candidate group be created as a sub-group of another group, a suggestion that the candidate group be created as a super-group that includes at least one other group, a suggestion that the candidate group be ignored, and a suggestion that the hashed result be added to an existing group without forming a new group.

18. The computer program product of claim 15, wherein the comparison takes into account a percentage that the candidate and pre-existing groups match and a status of each preexisting group to determine the suggestion.

19. The computer program product of claim 15, wherein the computer readable program code, when executed by the processor of the computing device, is configured to perform:

receiving input selecting a suggestion from the one or more suggestions;

processing the selected suggestion; and

associating a category with the candidate group.

20. The computer program product of claim 19, wherein the category comprises one of active, suggested, and ignored.