Network-aware Product Rollout in Online Social Networks

US2015019639A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2015019639-A1
Application numberUS-201313939093-A
CountryUS
Kind codeA1
Filing dateJul 10, 2013
Priority dateJul 10, 2013
Publication dateJan 15, 2015
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each node corresponding to a user of an online social network, identifying a plurality of clusters in the social graph using graph clustering, providing a treatment to a first set of users based on the clusters, and determining a treatment effect treatment for the users in the first set based on a network exposure to the treatment for each user.

First claim

Opening claim text (preview).

1 . A method comprising, by one or more processors associated with one or more computing devices: accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the plurality of nodes corresponding to a plurality of users associated with an online social network, respectively; identifying a plurality of clusters in the social graph using graph clustering, each cluster comprising a discrete set of nodes from the plurality of nodes; providing a treatment to a first set of users corresponding to a first set of clusters of the plurality of clusters; and determining a treatment effect of the treatment on the users of the first set of users based on a network exposure to the treatment for each user, wherein, for each cluster, the network exposure of the nodes in the cluster is absolute k-neighborhood exposure, absolute k-core exposure, fractional q-neighborhood exposure, or fractional q-core exposure. 2 . The method of claim 1 , wherein the treatment effect is a function of a network effect of the treatment for the users and an individual effect of the treatment for the users. 3 . The method of claim 1 , further comprising modifying the treatment based on the determined treatment effect of the treatment. 4 . The method of claim 1 , further comprising applying the treatment to a second set of users corresponding to a second set of clusters of the plurality of clusters, the second set of clusters being discrete from the first set of clusters. 5 . The method of claim 1 , wherein, for each cluster, the network exposure of the nodes in the cluster has a specified distribution ranging from a threshold level of network exposure to a maximum level of network exposure. 6 . The method of claim 5 , wherein determining the treatment effect of the treatment comprises determining the treatment effect of the treatment for different levels of network exposure of the specified distribution range. 7 . The method of claim 1 , wherein, for each cluster, the network exposure of the nodes in the cluster is full neighborhood exposure or component exposure. 8 . (canceled) 9 . (canceled) 10 . The method of claim 1 , wherein, for each cluster, the social-graph affinity of the nodes in the cluster with respect to the other nodes in the cluster is greater than a threshold social-graph affinity. 11 . The method of claim 1 , wherein a node in a particular cluster is network exposed if a threshold fractions of nodes within one degree of separation of the node are in the same treatment condition. 12 . The method of claim 1 , wherein the threshold number of nodes is all nodes. 13 . The method of claim 1 , wherein providing the treatment comprises randomizing between treatment and control to the clusters of the plurality of clusters. 14 . The method of claim 1 , wherein the treatment is a particular advertisement. 15 . The method of claim 1 , wherein the treatment is a particular product or feature of a third-party system. 16 . The method of claim 1 , wherein the treatment is a particular product or feature of the online social network. 17 . The method of claim 1 , wherein identifying the plurality of clusters comprises identifying clusters such that a threshold number of nodes in each cluster is network exposed with respect to the other nodes in the cluster. 18 . One or more computer-readable non-transitory storage media embodying software that is operable when executed to: access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the plurality of nodes corresponding to a plurality of users associated with an online social network, respectively; identify a plurality of clusters in the social graph using graph clustering, each cluster comprising a discrete set of nodes from the plurality of nodes; provide a treatment to a first set of users corresponding to a first set of clusters of the plurality of clusters; and determine a treatment effect of the treatment on the users of the first set of users based on a network exposure to the treatment for each user, wherein, for each cluster, the network exposure of the nodes in the cluster is absolute k-neighborhood exposure, absolute k-core exposure, fractional q-neighborhood exposure, or fractional q-core exposure. 19 . A system 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 social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the plurality of nodes corresponding to a plurality of users associated with an online social network, respectively; identify a plurality of clusters in the social graph using graph clustering, each cluster comprising a discrete set of nodes from the plurality of nodes; provide a treatment to a first set of users corresponding to a first set of clusters of the plurality of clusters; and determine a treatment effect of the treatment on the users of the first set of users based on a network exposure to the treatment for each user, wherein, for each cluster, the network exposure of the nodes in the cluster is absolute k-neighborhood exposure, absolute k-core exposure, fractional q-neighborhood exposure, or fractional q-core exposure.

Assignees

Inventors

Classifications

  • G06Q10/40Primary

    Business processes related to social networking or social networking services · CPC title

  • for social networking applications · CPC title

  • Optimization · CPC title

  • in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46) · CPC title

  • User profiles · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2015019639A1 cover?
In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each node corresponding to a user of an online social network, identifying a plurality of clusters in the social graph using graph clustering, providing a treatment to a first set of users based on the clusters, and determining a treatment effect treatment…
Who is the assignee on this patent?
Facebook Inc
What technology area does this patent fall under?
Primary CPC classification G06Q10/40. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Jan 15 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).