IP Library Granted Patent US 11,188,839
Granted Patent B2
US 11,188,839 · App. 15/228,128 · Granted Nov 30, 2021

Node bootstrapping in a social graph

Inventors: Thomas Pinckney (New York, NY); Christopher Dixon (New York, NY); Matthew Ryan Gattis (New York, NY)
Assignee: eBay Inc.
G06N5/048G06F16/2457G06F16/9535G06N20/00G06Q30/02
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,188,839
App. No.
15/228,128
Granted
Nov 30, 2021
Kind
B2
Abstract

A method includes identifying a graph of a social network, the graph including nodes and edges, each edge connects two nodes, some of the plurality of nodes represent members of the social network, some edges of the plurality of edges represent a relationship between two associated nodes, creating a first taste profile for a first member node, the taste profile identifying a first entity of interest to the first member, identifying a second member node based on an absence of a second taste profile for the second member node, the second member node is connected to the first member node, determining that the second member node is connected to the first member node, creating a second taste profile for the second member node using the first taste profile, and providing a recommendation to a member associated with the second member node based on the created second taste profile.

Claims (50)

1. A system comprising:

one or more hardware processors in networked communication with a social network; and

memory storing computer executable instructions that, when executed by the one or more hardware processors, cause the one or more hardware processors to perform a method comprising:

identifying a first graph associated with the social network, the first graph includes a plurality of nodes and a plurality of edges, each edge of the plurality of edges connects two nodes of the plurality of nodes, at least some of the plurality of nodes represent members of the social network, at least some edges of the plurality of edges represent a relationship between two associated nodes;

identifying a first taste profile for a first member node of the first graph, the taste profile identifying an entity of interest to the first member;

identifying a second member node of the first graph based on an absence of a second taste profile for the second member node, the second member node is connected to the first member node by an edge;

determining that the second member node is connected to the first member node by the edge;

based on the determining, creating a second taste profile for the second member node based at least in part on the first taste profile; and

providing a recommendation to a member associated with the second member node based on the created second taste profile.

2. The system of claim 1 , wherein the method further comprises:

identifying a second graph, the second graph includes the second member node;

adding the second member node to the first graph; and

connecting the second member node to the first member node with the edge.

3. The system of claim 2 , the method further comprises:

merging the second graph into the first graph.

4. The system of claim 1 , wherein the first graph includes an entity node associated with the entity of interest, the entity node represents one or more of a product, a service, and a business entity, wherein the entity node is connected to the first member by a second edge, wherein the first taste profile is constructed based at least in part on the second edge between the first member and the entity node.

5. The system of claim 4 , wherein the second edge is a relationship edge representing a past relationship between the first member and the entity of interest.

6. The system of claim 5 , wherein the past relationship between the first member and the entity of interest includes one or more of the first member browsing a web site associated with the entity of interest and the first member purchasing the entity of interest.

7. The system of claim 4 , wherein the second edge is a preference edge representing a degree to which the first member prefers the entity of interest.

8. A method comprising:

identifying a graph of a social network, the graph including a plurality of nodes and a plurality of edges, each edge of the plurality of edges connects two nodes of the plurality of nodes, at least some of the plurality of nodes represent members of the social network, at least some edges of the plurality of edges represent a relationship between two associated nodes;

creating a first taste profile for a first member node of the graph, the taste profile identifying a first entity of interest to the first member;

identifying a second member node of the graph based on an absence of a second taste profile for the second member node, the second member node is connected to the first member node by an edge;

determining that the second member node is connected to the first member node by the edge;

based on the determining, creating a second taste profile for the second member node using the first taste profile; and

providing a recommendation to a member associated with the second member node based on the created second taste profile.

9. The method of claim 8 , further comprising:

identifying a second graph, the second graph includes the second member node;

adding the second member node to the first graph; and

connecting the second member node to the first member node with the edge.

10. The method of claim 9 , further comprising:

merging the second graph into the first graph.

11. The method of claim 8 , wherein the first graph includes an entity node associated with the entity of interest, the entity node represents one or more of a product, a service, and a business entity, wherein the entity node is connected to the first member by a second edge, wherein the first taste profile is constructed based at least in part on the second edge between the first member and the entity node.

12. The method of claim 11 , wherein the second edge is a relationship edge representing a past relationship between the first member and the entity of interest.

13. The method of claim 12 , wherein the past relationship between the first member and the entity of interest includes one or more of the first member browsing a web site associated with the entity of interest and the first member purchasing the entity of interest.

14. The method of claim 11 , wherein the second edge is a preference edge representing a degree to which the first member prefers the entity of interest.

15. A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:

identifying a graph of a social network, the graph including a plurality of nodes and a plurality of edges, each edge of the plurality of edges connects two nodes of the plurality of nodes, at least some of the plurality of nodes represent members of the social network, at least some edges of the plurality of edges represent a relationship between two associated nodes;

creating a first taste profile for a first member node of the graph, the taste profile identifying a first entity of interest to the first member;

identifying a second member node of the graph based on an absence of a second taste profile for the second member node, the second member node is connected to the first member node by an edge;

determining that the second member node is connected to the first member node by the edge;

based on the determining, creating a second taste profile for the second member node using the first taste profile; and

providing a recommendation to a member associated with the second member node based on the created second taste profile.

16. The storage medium of claim 15 , wherein the instructions further cause the machine to perform operations comprising identifying a second graph, the second graph includes the second member node;

adding the second member node to the first graph; and

connecting the second member node to the first member node with the edge.

17. The storage medium of claim 16 , wherein the instructions farther cause the machine to perform operations comprising merging the second graph into the first graph.

18. The storage medium of claim 15 , wherein the first graph includes an entity node associated with the entity of interest, the entity node represents one or more of a product, a service, and a business entity, wherein the entity node is connected to the first member by a second edge, wherein the first taste profile is constructed based at least in part on the second edge between the first member and the entity node.

19. The storage medium of claim 18 , wherein the second edge is a relationship edge representing a past relationship between the first member and the entity of interest, wherein the past relationship between the first member and the entity of interest includes one or more of the first member browsing a web site associated with the entity of interest and the first member purchasing the entity of interest.

20. The storage medium of claim 18 , wherein the second edge is a preference edge representing a degree to which the first member prefers the entity of interest.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 4, 2016
From: PINCKNEY, THOMAS; DIXON, CHRISTOPHER; GATTIS, MATTHEW RYAN
To: HUNCH INC.
Reel/Frame 039341/0146 →
MERGER Recorded Aug 4, 2016
From: HUNCH INC.
To: EBAY INC.
Reel/Frame 039341/0184 →
Continuity (16)
Continuation 14609267 · Jan 29, 2015
Continuation 14195479 · Mar 3, 2014
Continuation 13155917 · Jun 8, 2011
Continuation In Part 12813715 · Jun 11, 2010
Continuation In Part 12813738 · Jun 11, 2010
Continuation In Part 12483768 · Jun 12, 2009
Continuation In Part 12483768 · Jun 12, 2009
Continuation In Part 12262862 · Oct 31, 2008
Provisional Application 61430318 · Jan 6, 2011
Provisional Application 61438684 · Feb 2, 2011
Provisional Application 61233326 · Aug 12, 2009
Provisional Application 61300511 · Feb 2, 2010
Provisional Application 61097394 · Sep 16, 2008
Provisional Application 60984948 · Nov 2, 2007
Provisional Application 61060226 · Jun 10, 2008
Related Publication 20160342902A1 · Nov 24, 2016