Interest-Based Social Recommendations for Event Ticket Network Systems

• US 20130227011A1
• Filed: 02/29/2012
• Published: 08/29/2013
• Est. Priority Date: 02/29/2012
• Status: Abandoned Application

• Current Assignee: Eventbrite Incorporated (Eventbrite)
• Original Assignee: Eventbrite Incorporated (Eventbrite)
• Inventors: Sharma, Vipul, Reuveni, Eyal, Zambrano, Brian Richard, Groesbeck, Luke O'Daniel
• Application Number:
  US13/408,776
• Publication Number:
  US 20130227011A1
• Time in Patent Office: Days
• US Class Current: 709/204
• CPC Class Codes: G06Q 30/0241 Advertisements
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

In one embodiment, a method includes accessing a graph structure comprising a plurality of nodes and edges connecting the nodes, determining a similarity score for each node with respect to a first node, ranking each of the nodes based on their respective similarity score, selecting a set of nodes based on the ranking of each node, and identifying one or more event associated with the selected set of nodes.

Claims

1. A method comprising:

accessing, using one or more processors associated with one or more computing devices, a graph structure comprising a plurality of nodes and a plurality of edges connecting the nodes, each edge between two nodes representing a single degree of separation between the two nodes, the plurality of nodes comprising;

a first node corresponding to a first user, the first node being associated with one or more first event categories; and

a plurality of second nodes corresponding to a plurality of second users, respectively, each second node being associated with one or more second event categories, each second node being separated from the first node by one or more degrees of separation;

determining, using the one or more processors, for each second node of the plurality of second nodes, a similarity score of the second node with respect to the first node;

ranking, using the one or more processors, each of the second nodes based on the respective similarity score;

selecting, using the one or more processors, a set of second nodes based on the ranking of each second node; and

identifying, using the one or more processors, one or more first events associated with the selected set of second nodes.

2. The method of claim 1, further comprising:

generating, using the one or more processors, one or more advertisements for the first user comprising information corresponding to the one or more first events.

3. The method of claim 1, wherein determining the similarity score of a second node comprises:

determining a degree of separation between the second node and the first node; and

determining the similarity score of the second node with respect to the first node based on the degree of separation.

4. The method of claim 1, wherein determining the similarity score of a second node comprises:

determining a number of events the second user associated with the second node has attended in common with the first user;

determining the similarity score of the second node with respect to the first node based on the number of events.

5. The method of claim 1, wherein determining the similarity score of a second node comprises:

determining a number of nodes in the graph structure that are connected to both the second node and the first node;

determining the similarity score of the second node with respect to the first node based on the number of nodes.

6. The method of claim 1, wherein determining the similarity score of a second node comprises:

determining how many of the second event categories associated with the second node match the first event categories; and

determining the similarity score of the second node with respect to the first node based on the number of matching event categories.

7. The method of claim 1, wherein ranking each of the second nodes based on the respective similarity score comprises:

scoring each second node based on the similarity score of the second node to the first node; and

ordering the second nodes based on the scoring.

8. The method of claim 1, wherein the first events are pending events that one or more of the second users corresponding to the selected set of second nodes are registered to attend.

9. The method of claim 1, wherein the first events are pending events that have been recommended to one or more of the second users corresponding to the selected set of second nodes.

10. The method of claim 1, wherein the graph structure is based at least in part on a third-party social graph.

11. The method of claim 1, wherein the graph structure is based at least in part on the event history associated with each node, wherein an edge connecting two nodes indicates that the users associated with each of the two nodes attended the same event.

12. The method of claim 1, wherein each of the second nodes is within a threshold degree of separation from the first node.

13. The method of claim 1, wherein each of the second nodes is associated with at least one event category that matches one of the first event categories.

14. The method of claim 1, wherein the graph structure is a sub-graph of parent graph structure, the sub-graph comprising only nodes associated with pre-selected event categories.

15. The method of claim 1, wherein:

the first event categories are based on the event categories of one or more events the first user has attended; and

for each second node, the second event categories are based on the event categories of one or more events the second user has attended.

16. An apparatus comprising:

one or more processors; and

a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to;

access a graph structure comprising a plurality of nodes and a plurality of edges connecting the nodes, each edge between two nodes representing a single degree of separation between the two nodes, the plurality of nodes comprising;

a first node corresponding to a first user, the first node being associated with one or more first event categories; and

a plurality of second nodes corresponding to a plurality of second users, respectively, each second node being associated with one or more second event categories, each second node being separated from the first node by one or more degrees of separation;

determine for each second node of the plurality of second nodes, a similarity score of the second node with respect to the first node;

rank each of the second nodes based on the respective similarity score;

select a set of second nodes based on the ranking of each second node; and

identify one or more first events associated with the selected set of second nodes.

17. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:

access a graph structure comprising a plurality of nodes and a plurality of edges connecting the nodes, each edge between two nodes representing a single degree of separation between the two nodes, the plurality of nodes comprising;

a first node corresponding to a first user, the first node being associated with one or more first event categories; and

a plurality of second nodes corresponding to a plurality of second users, respectively, each second node being associated with one or more second event categories, each second node being separated from the first node by one or more degrees of separation;

determine for each second node of the plurality of second nodes, a similarity score of the second node with respect to the first node;

rank each of the second nodes based on the respective similarity score;

select a set of second nodes based on the ranking of each second node; and

identify one or more first events associated with the selected set of second nodes.