← Back to Patent Explorer
US7177880B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Method of creating and displaying relationship chains between users of a computerized network

Assignee: GlobalFoundries US Inc
•
Filing: 2002-12-19
•
Granted: 2007-02-13
•
Expires: 2022-12-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and structure for identifying potential relationships between users of a computer network is disclosed. The invention extracts relationship information from databases in the computer network in order to establish multiple relationship chains of the users from the relationship information. More specifically, the invention evaluates network information and network communications between the users to produce metrics and processes the metrics to produce contact information. The contact information indicates whether a personal relationship exists between two users. In addition, the invention can produce relationship values representing strengths of social relationships between users of the computer network based on such relationship information.

Inventors

  • 👤 Joann Ruvolo
  • 👤 Andrew L. Schirmer
  • 👤 Marijane M. Zeller

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 03:14
CPC Classifications
G; G06; G06Q; G06Q30/00; G06Q30/02; G06Q10/00; G06Q10/40; G06Q10/48; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99944; Y10S707/99945; Y10S707/99948

Claims Analysis

Total Claims: 28
Claim 1
Independent Claim 167 words
A method of identifying relationships between users of a computer network, said method comprising: extracting information directly from data sources in personal information management systems of said users, wherein said data sources comprise at least one of a calendar, a to-do list, a journal, an address book, e-mails, and a phone log; processing said information to detect interactions between said users for detecting relationships between said users; producing sets of contacts for each of said users, wherein a set of contacts for a corresponding user comprises a list of other users having a relationship with said corresponding user; establishing multiple relationship chains between a first user of said computer network and a second user of said computer network, wherein each relationship chain comprises at least three users and wherein said establishing comprises finding intersections between a first set of contacts of said first user and a second set of contacts of said second user; and displaying said multiple relationship chains in an order based on a criteria.
Claim 2
Independent Claim 167 words
A method of identifying relationships between users of a computer network, said method comprising: extracting information directly from data sources in personal information management systems of said users, wherein said data sources comprise at least one of a calendar, a to-do list, a journal, an address book, e-mails, and a phone log; processing said information to detect interactions between said users for detecting relationships between said users; producing sets of contacts for each of said users, wherein a set of contacts for a corresponding user comprises a list of other users having a relationship with said corresponding user; establishing multiple relationship chains between a first user of said computer network and a second user of said computer network, wherein each relationship chain comprises at least three users and wherein said establishing comprises finding intersections between a first set of contacts of said first user and a second set of contacts of said second user; and displaying said multiple relationship chains in an order based on a criteria.
Claim 3
Dependent Claim 86 words
The method in claim 1 , wherein said establishing further comprises, if said finding process is unsuccessful, a second process of finding intersections between second order contacts of said first user of said computer network and second order contacts of said second user of said computer network, wherein said second order contacts of said first user comprise contacts of users contained in said first user's contacts; and wherein said second order contacts of said second user comprise contacts of users contained in said second user's contacts.
Claim 4
Dependent Claim 24 words
The method in claim 1 , wherein all of said multiple relationship chains begin with said first user and end with said second user.
Claim 5
Dependent Claim 27 words
The method in claim 1 , wherein a difference between said multiple relationship chains comprises different computer network users between said first user and said second user.
Claim 6
Dependent Claim 26 words
The method in claim 1 , further comprising selecting one of said multiple relationship chains as a most desirable relationship chain based upon first user input.
Claim 7
Dependent Claim 33 words
The method in claim 1 , wherein said criteria comprises chain length and wherein said displaying process displays said multiple relationship chains in said order from shortest relationship chain to longest relationship chain.
Claim 8
Independent Claim 191 words
A method of identifying relationships between users of a computer network, said method comprising: evaluating network information and network communications between said users to produce metrics, wherein said network information comprises data sources in personal information managements systems of said users and does not comprise entries made for said computer network and wherein said metrics comprise at least one of times and places of meetings, telephone records, email records, and address books; processing said metrics to produce contact information, wherein said contact information indicates whether personal relationships exists between said users; producing sets of contacts for each of said users, wherein a set of contacts for a corresponding user comprises a list of other users having a relationship with said corresponding user; establishing multiple relationship chains between a first user of said computer network and a second user of said computer network, wherein each relationship chain comprises at least three users and wherein said establishing comprises finding intersections between a first set of contacts of said first user and a second set of contacts of said second user; and displaying said multiple relationship chains in an order based on a criteria.
Claim 9
Independent Claim 191 words
A method of identifying relationships between users of a computer network, said method comprising: evaluating network information and network communications between said users to produce metrics, wherein said network information comprises data sources in personal information managements systems of said users and does not comprise entries made for said computer network and wherein said metrics comprise at least one of times and places of meetings, telephone records, email records, and address books; processing said metrics to produce contact information, wherein said contact information indicates whether personal relationships exists between said users; producing sets of contacts for each of said users, wherein a set of contacts for a corresponding user comprises a list of other users having a relationship with said corresponding user; establishing multiple relationship chains between a first user of said computer network and a second user of said computer network, wherein each relationship chain comprises at least three users and wherein said establishing comprises finding intersections between a first set of contacts of said first user and a second set of contacts of said second user; and displaying said multiple relationship chains in an order based on a criteria.
Claim 10
Dependent Claim 86 words
The method in claim 7 , wherein said establishing further comprises, if said finding process is unsuccessful, a second process of finding intersections between second order contacts of said first user of said computer network and second order contacts of said second user of said computer network, wherein said second order contacts of said first user comprise contacts of users contained in said first user's contacts; and wherein said second order contacts of said second user comprise contacts of users contained in said second user's contacts.
Claim 11
Dependent Claim 24 words
The method in claim 7 , wherein all of said multiple relationship chains begin with said first user and end with said second user.
Claim 12
Dependent Claim 27 words
The method in claim 7 , wherein a difference between said multiple relationship chains comprises different computer network users between said first user and said second user.
Claim 13
Dependent Claim 26 words
The method in claim 7 , further comprising selecting one of said multiple relationship chains as a most desirable relationship chain based upon first user input.
Claim 14
Dependent Claim 33 words
The method in claim 7 , wherein said criteria comprises chain length and wherein said displaying process displays said multiple relationship chains in said order from shortest relationship chain to longest relationship chain.
Claim 15
Independent Claim 220 words
A method of identifying relationships between users of a computer network, said method comprising: extracting information directly from data sources in personal information management systems of said users, wherein said data sources comprise at least one of a calendar, a to-do list, a journal, an address book, e-mails, and a phone log; processing said information to detect interactions between said users for detecting relationships between said users; producing sets of contacts for each of said users, wherein a set of contacts for a corresponding user comprises a list of other users having a relationship with said corresponding user; producing relationship values representing strengths of each of said relationships, wherein said relationship values are based on at least one of longevity, currency, frequency, exclusivity, complexity and reciprocity of said relationships; establishing multiple relationship chains between a first user of said computer network and a second user of said computer network, wherein each of said multiple relationship chains comprises a plurality of said relationships that link at least three users and wherein said establishing comprises finding intersections between a first set of contacts of said first user and a second set of contacts of said second user; and displaying said multiple relationship chains in an order that is based in part upon said strengths of said relationships in said multiple relationship chains.
Claim 16
Independent Claim 220 words
A method of identifying relationships between users of a computer network, said method comprising: extracting information directly from data sources in personal information management systems of said users, wherein said data sources comprise at least one of a calendar, a to-do list, a journal, an address book, e-mails, and a phone log; processing said information to detect interactions between said users for detecting relationships between said users; producing sets of contacts for each of said users, wherein a set of contacts for a corresponding user comprises a list of other users having a relationship with said corresponding user; producing relationship values representing strengths of each of said relationships, wherein said relationship values are based on at least one of longevity, currency, frequency, exclusivity, complexity and reciprocity of said relationships; establishing multiple relationship chains between a first user of said computer network and a second user of said computer network, wherein each of said multiple relationship chains comprises a plurality of said relationships that link at least three users and wherein said establishing comprises finding intersections between a first set of contacts of said first user and a second set of contacts of said second user; and displaying said multiple relationship chains in an order that is based in part upon said strengths of said relationships in said multiple relationship chains.
Claim 17
Dependent Claim 50 words
The method in claim 13 , wherein said displaying process displays said multiple relationship chains in an order from shortest relationship chain to longest relationship chain, and for relationship chains that have the same length, relationship chains are displayed in an order from highest relationship strength to lowest relationship strength.
Claim 18
Dependent Claim 86 words
The method in claim 13 , wherein said establishing further comprises, if said finding process is unsuccessful, a second process of finding intersections between second order contacts of said first user of said computer network and second order contacts of said second user of said computer network, wherein said second order contacts of said first user comprise contacts of users contained in said first user's contacts; and wherein said second order contacts of said second user comprise contacts of users contained in said second user's contacts.
Claim 19
Dependent Claim 24 words
The method in claim 13 , wherein all of said multiple relationship chains begin with said first user and end with said second user.
Claim 20
Dependent Claim 27 words
The method in claim 13 , wherein a difference between said multiple relationship chains comprises different computer network users between said first user and said second user.
Claim 21
Dependent Claim 26 words
The method in claim 13 , further comprising selecting one of said multiple relationship chains as a most desirable relationship chain based upon first user input.
Claim 22
Dependent Claim 185 words
A program storage device readable by machine, embodying a program of instructions executable by the machine to perform a method of identifying relationships between users of a computer network, said method comprising: extracting information directly from data sources in personal information management systems of said users, wherein said data sources comprise at least one of a calendar, a to-do list, a journal, an address book, e-mails, and a phone log; processing said information to detect interactions between said users for detecting relationships between said users; producing sets of contacts for each of said users, wherein a set of contacts for a corresponding user comprises a list of other users having a relationship with said corresponding user; establishing multiple relationship chains between a first user of said computer network and a second user of said computer network, wherein each relationship chain comprises at least three users and wherein said establishing comprises finding intersections between a first set of contacts of said first user and a second set of contacts of said second user; and displaying said multiple relationship chains in an order based on a criteria.
Claim 23
Dependent Claim 185 words
A program storage device readable by machine, embodying a program of instructions executable by the machine to perform a method of identifying relationships between users of a computer network, said method comprising: extracting information directly from data sources in personal information management systems of said users, wherein said data sources comprise at least one of a calendar, a to-do list, a journal, an address book, e-mails, and a phone log; processing said information to detect interactions between said users for detecting relationships between said users; producing sets of contacts for each of said users, wherein a set of contacts for a corresponding user comprises a list of other users having a relationship with said corresponding user; establishing multiple relationship chains between a first user of said computer network and a second user of said computer network, wherein each relationship chain comprises at least three users and wherein said establishing comprises finding intersections between a first set of contacts of said first user and a second set of contacts of said second user; and displaying said multiple relationship chains in an order based on a criteria.
Claim 24
Dependent Claim 88 words
The program storage device in claim 19 , wherein said establishing further comprises, if said finding process is unsuccessful, a second process of finding intersections between second order contacts of said first user of said computer network and second order contacts of said second user of said computer network, wherein said second order contacts of said first user comprise contacts of users contained in said first user's contacts; and wherein said second order contacts of said second user comprise contacts of users contained in said second user's contacts.
Claim 25
Dependent Claim 26 words
The program storage device in claim 19 , wherein all of said multiple relationship chains begin with said first user and end with said second user.
Claim 26
Dependent Claim 29 words
The program storage device in claim 19 , wherein a difference between said multiple relationship chains comprises different computer network users between said first user and said second user.
Claim 27
Dependent Claim 31 words
The program storage device in claim 19 , wherein said method further comprises selecting one of said multiple relationship chains as a most desirable relationship chain based upon first user input.
Claim 28
Dependent Claim 28 words
The program storage device in claim 19 , wherein said displaying process displays said multiple relationship chains in an order from shortest relationship chain to longest relationship chain.

References Cited (Backward Citations)

US6175831B1 Cited
US6052122A Cited
US5963951A Cited
US6061681A Cited
US6269369B1 Cited
US6735568B1 Cited
US20030220980A1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2010-02-12 2010-08-14 2011-02-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2014-02-12 2014-08-14 2015-02-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2018-02-12 2018-08-14 2019-02-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag