Method for searching a collection of libraries

• US 7,117,205 B2
• Filed: 10/23/2001
• Issued: 10/03/2006
• Est. Priority Date: 10/24/2000
• Status: Expired due to Fees

• Current Assignee: Robert Pisani
• Original Assignee: Robert Pisani
• Inventors: Pisani, Robert
• Primary Examiner(s): Robinson, Greta
• Assistant Examiner(s): Lu, Kuen S.
• Application Number:
  US10/052,849
• Publication Number:
  US 20020062318A1
• Time in Patent Office: 1,806 Days
• Field of Search: 707/5, 707/2, 707/10, 707/104.1, 707/100, 707/202, 707/3, 707/101, 707/1
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

A method for searching identifying data in a library or a collection of libraries. The method includes the steps of compiling a master library of data and determining the overlap of data from an independent library to sub-library within the master library. The purpose is to determine the range of overlapping data between two libraries, and make recommendations of data omitted from one of the libraries if the libraries are determined to be closely related. In determining the proximity of the libraries, a comparison of names between the libraries is conducted based upon a factor. Thereafter, the libraries are assigned a rank based upon a criteria and a score is assigned to the library based upon the closeness of the rank of the data in the library to the data in the master library.

Claims

1. A computer implemented method for searching identifying data, comprising:

(a) compiling a master library of data from users of a network, wherein said master library includes a collection of individual user libraries;

(b) measuring proximity of a first library to a second library, including assigning a standard of proximity between a ranking of names in said first library to a ranking of names in said second library as (1/n)Σ

abs(r_i−

s_i), where r is a ranking of names in said first library, s is a ranking of names in said second library, i is a coefficient for a current ranking of names in one of said libraries, and n is the quantity of names in said libraries, wherein the step of measuring proximity includes comparing, a list of names within said libraries that are common within a predetermined factor; and

(c) compiling a list of common names within a collection of said libraries based upon said measured proximity factor.

2. The method of claim 1, further comprising forwarding data from one of said libraries to a list based upon a user defined proximity value.

3. The method of claim 1, wherein said master library includes a collection of individual user libraries.

4. The method of claim 1, wherein said user libraries are a collection of lists of said identifying data.

5. The method of claim 1, wherein the step of measuring proximity includes comparing a list of names within said libraries that are common within a predetermined factor.

6. The method of claim 4, further comprising the step of assigning a rank to a sub-library based upon a criterion.

7. The method of claim 6, wherein said criteria is selected from the group consisting of:

frequency of appearance in said master library, intensity of use by third parties, cost of use, ease of use, difficulty of use, and frequency of occurrence in selected portions of said master library.

8. The method of claim 6, further comprising the step of assigning a score to said identifying data based upon proximity of said rank of identifying data in said sub-library to said lists of identifying data in said master library.

9. The method of claim 8, wherein said score is based upon a quantity of redundancy between said scoring library and said sub-library.

10. The method of claim 6, further comprising the step of viewing sub-libraries within said master library.

11. The method of claim 10, further comprising the step of searching for said sub-library with a common subject mailer to said independent library.

12. The method of claim 1, further comprising forwarding data from said libraries to a list based upon a user defined proximity value.

13. The method of claim 1, wherein said master library includes a collection of individual user libraries.

14. The method of claim 1, wherein said user libraries are a collection of lists of said identifying data.

15. The method of claim 1, wherein the step of measuring proximity includes comparing a list of names within said libraries that are common within a predetermined factor.

16. The method of claim 1, further comprising the step of assigning a rank to a sub-library based upon a criterion.

17. The method of claim 16, wherein said criteria is selected from the group consisting of:

frequency of appearance in said master library, intensity of use by third parties, cost of use, ease of use, difficulty of use, and frequency of occurrence in selected portions of said master library.

18. The method of claim 16, further comprising the step of assigning a score to said identifying data based upon proximity of said rank of identifying data in said sub-library to said lists of identifying data in said master library.

19. The method of claim 18, wherein said score is based upon a quantity of redundancy between said scoring library and said sub-library.

20. The method of claim 16, further comprising the step of viewing sub-libraries within said master library.

21. The method of claim 20, further comprising the step of searching for said sub-library with a common subject matter to said independent library.