System and method for automatically grouping items

• US 7,441,186 B2
• Filed: 10/04/2004
• Issued: 10/21/2008
• Est. Priority Date: 01/23/2004
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Brodie, Alexander S., Yuan, Po, Parlin, David R., Kasperkiewicz, Tomasz S. M., Dart, Scott E., Xu, Jingyang, Frigon, Kathleen M.
• Primary Examiner(s): Hutton; Doug
• Assistant Examiner(s): Blackwell; James H
• Application Number:
  US10/957,966
• Publication Number:
  US 20050165841A1
• Time in Patent Office: 1,478 Days
• Field of Search: 715/200, 715/234, 715243-247, 707/5, 707/100, 707/104, 707/202, 382/159, 382/218, 382/225
• US Class Current: 715/243
• CPC Class Codes: G06F 16/51 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G11B 27/105 of operating discs
• CPC Class Codes: G11B 27/34 Indicating arrangements indicating means incorporated in magazine or cassette G11B23/046 and G11B23/0875; indicating measured values in general G01D
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

A system and method for automatically grouping items, e.g., digital photographs, by analyzing the statistical distributions of at least one piece of information associated with each of the items, for instance, creation time, are provided. In one embodiment, the creation time may be converted into a numeric value and the numeric values placed in ascending order such that gaps between adjacent numeric values may be determined. Subsequently, a median difference may be determined as well as an optimum difference. The items may then be organized into groups such that an additional group is created each time the difference between the numeric value for an item and the numeric value for the adjacent item located therebelow in the ascending array is greater than the optimum difference.

Claims

1. A method for organizing a plurality of items into at least one group, comprising:

receiving at least one piece of information associated with each of the plurality of items, the at least one piece of information being stored in metadata;

converting the at least one piece of information for each of the plurality of items into a numeric value;

sorting the numeric values for each of the plurality of items into an ascending array;

determining a gap between each adjacent numeric value in the ascending array;

determining a median gap for the ascending array;

determining an optimum gap for the ascending array based upon the median gap; and

organizing the items into at least one group using the optimum gap.

2. The method of claim 1, wherein receiving at least one piece of information associated with each of the plurality of items comprises receiving at least one time parameter associated with each of the plurality of items.

3. The method of claim 2, wherein receiving at least one time parameter associated with each of the plurality of items comprises receiving a time of creation for each of the plurality of items.

4. The method of claim 1, wherein determining an optimum gap for the ascending array comprises determining a low threshold gap and a high threshold gap.

5. The method of claim 4, wherein determining the low threshold gap comprises determining a largest gap between adjacent numeric values in the ascending array that is smaller than a sum of log(median gap) and log(22).

6. The method of claim 4, wherein determining the high threshold gap comprises determining a smallest gap between adjacent numeric values in the ascending array that is larger than a sum of log(median gap) and log(326).

7. The method of claim 4, wherein determining an optimum gap for the ascending array further comprises determining a largest gap between adjacent numeric values in the ascending array that is between the low threshold gap and the high threshold gap.

8. The method of claim 4, wherein determining an optimum gap for the ascending array further comprises determining the optimum gap such that log(optimum gap) is equal to one-half of the largest gap between adjacent numeric values in the ascending array that is between the low threshold gap and the high threshold gap.

9. The method of claim 8, wherein organizing the items into at least one group comprises creating an additional group each time the gap between the numeric value for an item and the numeric value for the adjacent item located therebelow in the ascending array is greater than the optimum gap.

10. The method of claim 1, wherein determining an optimum gap for the ascending array comprises determining the optimum gap such that log(optimum gap) is equal to the sum of log(median gap and log(40).

11. The method of claim 10, wherein organizing the items into at least one group comprises creating a new group each time the gap between the numeric value for an item and the numeric value for the adjacent item located therebelow in the ascending array is greater than the optimum gap.

13. The method of claim 1, wherein the third determining component determines the optimum gap for the ascending array by determining a low threshold gap and a high threshold gap.

14. The method of claim 13, wherein the third determining component determines the low threshold gap by determining a largest gap between adjacent numeric values in the ascending array that is smaller than a sum of log(median gap) and log(22).

15. The method of claim 13, wherein the third determining component determines the high threshold gap by determining a smallest gap between adjacent numeric values in the ascending array that is larger than a sum of log(median gap ) and log(326).

16. The method of claim 13, wherein the third determining component further determines the optimum gap for the ascending by determining a largest gap between adjacent numeric values in the ascending array that is between the low threshold gap and the high threshold gap.

12. A computer system having a processor and memory for organizing a plurality of items into at least one group, comprising:

a receiving component for receiving a creation time for each of the plurality of items, the creation time being stored in metadata;

a conversion component for converting the creation time for each of the plurality of items into a numeric value;

a sorting component for sorting the numeric values for each of the plurality of items into an ascending array;

a first determining component for determining a gap between each adjacent numeric value in the ascending array;

a second determining component for determining a median gap for the ascending array;

a third determining component for determining an optimum gap for the ascending array based upon the median gap; and

an organizing component for organizing the items into at least one group using the optimum gap.

17. The computer system of claim 12, wherein the organizing component organizes the items into at least one group by creating an additional group each time the gap between the numeric value for an item and the numeric value for the adjacent item located therebelow in the ascending array is greater than the optimum gap.

18. One or more computer-readable storage media having computer-executable instructions for performing a method, the method comprising:

receiving a creation time for each of the plurality of items, the creation time being stored in metadata;

converting the creation time for each of the plurality of items into a numeric value, wherein the numeric value is a period of time that has passed since a particular time;

sorting the numeric values for each of the plurality of items into an ascending array;

determining a gap between each adjacent numeric value in the ascending array;

determining a median gap for the ascending array;

determining an optimum gap for the ascending array based upon the median gap;

organizing the items into at least one group using the optimum gap; and

creating a new group each time the gap between the numeric value for an item and the numeric value for the adjacent item located therebelow in the ascending array is greater than the optimum gap.

19. A computer system having a processor and memory for organizing a plurality of items into at least one group, the computer system comprising:

receiving means for receiving a creation time for each of the plurality of items, the creation time being stored in metadata;

converting means for converting the creation time for each of the plurality of items into a numeric value;

sorting means for sorting the numeric values for each of the plurality of items into an ascending array;

first determining means for determining a gap between each adjacent numeric value in the ascending array;

second determining means for determining a median gap for the ascending array;

third determining means for determining an optimum difference for the ascending array based upon the median gap; and

organizing means for organizing the items into at least one group using the optimum gap.