METHOD AND SYSTEM FOR CREATING A PROFILED SOCIAL NETWORK

• US 20100281044A1
• Filed: 07/01/2009
• Published: 11/04/2010
• Est. Priority Date: 04/29/2009
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: GUPTA, Ajay, Ramanathan, Krishnan, Banerjee, Somnath
• Application Number:
  US12/495,825
• Publication Number:
  US 20100281044A1
• Time in Patent Office: Days
• US Class Current: 707/765
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0224 based on user history

Abstract

Presented is a computer implemented method and system for creating a profiled social network. The method includes mapping at least one identity to each node in the plurality of nodes, defining a profile for each node in the plurality of nodes, identifying a relationship between the at least two nodes in the plurality of nodes, defining a profile for the relationship between the at least two nodes in the plurality of nodes, and forming a collection of profiles defined for all relationships between the plurality of nodes.

Claims

1. A computer implemented method for creating a profiled social network having a plurality of nodes, the method comprising:

mapping at least one identity to each node in the plurality of nodes;

defining a profile for each node in the plurality of nodes;

identifying a relationship between the at least two nodes in the plurality of nodes;

defining a profile of the relationship between the at least two nodes in the plurality of nodes; and

forming a collection of profiles defined for all relationships between the plurality of nodes.

2. The method of claim 1, further comprising:

analyzing at least one communication between at least two nodes in the plurality of nodes to detect if a relationship exists between the at least two nodes;

analyzing strength of relationship between the at least two nodes; and

analyzing content of at least one communication between the at least two nodes to determine a profile of the communication between the at least two nodes.

3. The method of claim 2, wherein the strength of the relationship is indicated by nature of communication between the at least two nodes.

4. The method of claim 2, wherein the strength of the relationship is indicated by frequency of communication between the at least two nodes.

5. The method of claim 1, wherein the plurality of nodes in the network include at least one of a person, a location, a company, a business, a community and an entity.

6. The method of claim 1, wherein the at least one identity includes an email address, a phone number, a chat ID and a login ID.

7. The method of claim 1, wherein the at least one identity is from at least one other social network.

8. The method of claim 1, wherein the at least one identity is mapped to a node on a client computer system.

9. The method of claim 1, wherein the at least one identity is mapped to a node with an input received from the node.

10. A method for searching profiled social network of claim 1, the method comprising:

adding a profile of a node to a query to form an extended query, wherein the query is requested by the node;

sending the extended query to a plurality of nodes, wherein the plurality of nodes has at least one relationship with the node requesting the query;

evaluating the extended query at each node of the plurality of nodes to determine whether a profile of a node is capable of addressing the query; and

sending a response to the node that requested the query if the profile of at least one node is capable of addressing the query.

11. A method of claim 10, wherein evaluating the extended query at each node of the plurality of nodes to determine whether a profile of a node is capable of addressing the query includes further sending the query to a set of nodes connected to each node of the plurality of nodes.

14. A computer program comprising computer program means adapted to perform all of the steps of claim 1 when said program is run on a computer.

15. A computer program according to claim 14 embodied on a computer readable medium.

12. A system for creating a profiled social network, the system comprising:

means for mapping at least one identity to each node in the plurality of nodes;

means for defining a profile for each node in the plurality of nodes;

means for identifying a relationship between the at least two nodes in the plurality of nodes;

means for defining a profile for the relationship between the at least two nodes in the plurality of nodes; and

means for forming a collection of profiles defined for all relationships between the plurality of nodes.

13. A system of claim 12, further comprising:

means for analyzing at least one communication between at least two nodes in the plurality of nodes to detect if a relationship exists between the at least two nodes;

means for analyzing strength of relationship between the at least two nodes; and

means for analyzing content of at least one communication between the at least two nodes to determine a profile of the communication between the at least two nodes.