Method and apparatus for identifying data of interest in a database

• US 20070112754A1
• Filed: 11/15/2005
• Published: 05/17/2007
• Est. Priority Date: 11/15/2005
• Status: Abandoned Application

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Guralnik, Valerie, Foslien, Wendy, Haigh, Karen
• Application Number:
  US11/274,110
• Publication Number:
  US 20070112754A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/3322 using system suggestions G06F16/3325 takes precedence

Abstract

Templates for use in searching for data segments of interest in stores of data are defined and/or refined by analyzing related matches, extracting common or key elements, and/or generalizing or modifying the templates. This process can involve calculating the similarity between matches, clustering matches, and identifying key elements for defining and/or refining templates and/or search parameters. A user may interact with a software tool for refining templates.

Claims

1. A computer assisted method, comprising:

providing a collection of two or more templates each for use in identifying matching data in a database; and

identifying a relationship between at least two of the templates to at least partially characterize the collection of templates.

2. The computer assisted method of claim 1 wherein the relationship identified by the identifying step is established, at least in part, by a measure of similarity between at least two of the templates.

3. The computer assisted method of claim 1 wherein the relationship identified by the identifying step is established, at least in part, by one or more elements of at least two of the templates.

4. The computer assisted method of claim 2 wherein the relationship identified by the identifying step is established, at least in part, by a measure of similarity between each of two or more pairs of the templates.

5. The computer assisted method of claim 4 further comprising constructing a similarity matrix that includes at least a measure of similarity between each of the two or more pairs of the templates.

6. The computer assisted method of claim 4 further comprising using at least two measures of similarity to construct a dendrogram data structure that defines, at least in part, the relationship between each of two or more pairs of the templates.

7. The computer assisted method of claim 4 further comprising using at least one measure of similarity to define one or more clusters of the two or more templates.

8. The computer assisted method of claim 1, further comprising:

defining one or more refinements to at least one of the templates based at least in part on the identified relationship between at least two of the templates.

9. The computer assisted method of claim 8, further comprising:

refining at least one of the templates based on at least one of the defined refinements.

10. The computer assisted method of claim 9, wherein at least some of the templates include a number of template elements, and the one or more defined refinements includes adding, removing and/or changing one or more of the template elements.

11. The computer assisted method of claim 9, wherein at least some of the templates include a number of search parameters, and the one or more defined refinements includes adding, removing and/or changing one or more of the search parameters.

12. The computer assisted method of claim 9, wherein the one or more defined refinements include pruning one or more of the templates.

13. The computer assisted method of claim 9, wherein the one or more defined refinements include extending one or more of the templates.

14. The computer assisted method of claim 9, wherein the one or more defined refinements include averaging and/or concatenating two or more of the templates.

15. The computer assisted method of claim 9, wherein the one or more defined refinements include ceasing to use a template.

16. The computer assisted method of claim 9, wherein the one or more defined refinements include splitting a template into two or more templates.

17. The computer assisted method of claim 9, wherein the database includes a series of numerical data and the one or more templates also include a series of numerical data, and wherein the one or more defined refinements includes differencing the series of numerical data of two or more of the templates.

18. The computer assisted method of claim 9, wherein the database includes a series of numerical data and the one or more templates also include a series of numerical data, and wherein the one or more defined refinements includes averaging the series of numerical data of two or more of the templates.

19. The computer assisted method of claim 9, wherein the database includes a series of numerical data and the one or more templates also include a series of numerical data, and wherein the one or more defined refinements includes removing noise from the series of numerical data of one or more of the templates.

20. The computer assisted method of claim 9, wherein the database includes a series of numerical data, and wherein the one or more defined refinements includes changing the shape of one or more of the templates.

21. The computer assisted method of claim 20, wherein the one or more defined refinements includes smoothing the shape of one or more of the templates.

22. The computer assisted method of claim 9, wherein the database includes one or more text elements, and two or more of the templates include one or more search words, where at least some of the search words have an associated weighting factor, wherein the one or more defined refinements includes averaging one or more of the weighting factors of two or more of the templates.

23. The computer assisted method of claim 9, wherein the one or more defined refinements include identifying template groupings of the templates.

24. The computer assisted method of claim 1 wherein the identifying step includes running each of two or more of the templates against the database to identify matching data, and identifying a relationship between at least two of the templates by identifying a relationship between the matching data identified by the corresponding two or more templates.