公开(公告)号：US20120259915A1

公开(公告)日：2012-10-11

申请号：US13080661

申请日：2011-04-06

申请人： Rushi Prafull Bhatt ,  Rajeev Rastogi ,  Vineet Shashikant Chaoji ,  Sayan Ranu

发明人： Rushi Prafull Bhatt ,  Rajeev Rastogi ,  Vineet Shashikant Chaoji ,  Sayan Ranu

IPC分类号： G06F15/16

CPC分类号： G06Q50/01

摘要： A method, a system and a computer program product for maximizing content spread in a social network are provided. Samples of edges are generated from an initial candidate set of edges. Each edge of the samples of edges has a probability value for content flow. Further, a subset of edges is determined from the samples of edges based on gain corresponding to each edge. Also, each node of the subset of edges is having at least one of less than ‘K’ or equal to ‘K’ incoming edges. Further, the probability of each edge, of the subset of edges, may be incremented. Furthermore, a final set of edges may be determined by ensuring ‘K’ incoming edges. The ‘K’ incoming edges may be ensured by removing one or more incoming edges when a number of the incoming edges for a node of the final set is greater than ‘K’ incoming edge.

摘要翻译： 提供了一种用于最大化社交网络中的内容传播的方法，系统和计算机程序产品。 边缘样本从初始候选边缘集合生成。 边缘样本的每个边缘都具有内容流的概率值。 此外，基于与每个边缘相对应的增益，从边缘样本确定边缘子集。 此外，边缘子集的每个节点具有小于K或等于K个入口边缘中的至少一个。 此外，可以增加边缘子集中的每个边缘的概率。 此外，可以通过确保K个进入边缘来确定最终的边缘集合。 当最终集合的节点的进入边缘的数量大于K个进入边缘时，可以通过去除一个或多个进入边缘来确保K个进入边缘。

公开(公告)号：US08751618B2

公开(公告)日：2014-06-10

申请号：US13080661

申请日：2011-04-06

申请人： Rushi Prafull Bhatt ,  Rajeev Rastogi ,  Vineet Shashikant Chaoji ,  Sayan Ranu

发明人： Rushi Prafull Bhatt ,  Rajeev Rastogi ,  Vineet Shashikant Chaoji ,  Sayan Ranu

IPC分类号： G06F15/173

CPC分类号： G06Q50/01

摘要： A method, a system and a computer program product for maximizing content spread in a social network are provided. Samples of edges are generated from an initial candidate set of edges. Each edge of the samples of edges has a probability value for content flow. Further, a subset of edges is determined from the samples of edges based on gain corresponding to each edge. Also, each node of the subset of edges is having at least one of less than ‘K’ or equal to ‘K’ incoming edges. Further, the probability of each edge, of the subset of edges, may be incremented. Furthermore, a final set of edges may be determined by ensuring ‘K’ incoming edges. The ‘K’ incoming edges may be ensured by removing one or more incoming edges when a number of the incoming edges for a node of the final set is greater than ‘K’ incoming edge.

摘要翻译： 提供了一种用于最大化社交网络中的内容传播的方法，系统和计算机程序产品。 边缘样本从初始候选边缘集合生成。 边缘样本的每个边缘都具有内容流的概率值。 此外，基于与每个边缘相对应的增益，从边缘样本确定边缘子集。 此外，边缘子集的每个节点具有小于“K”或等于“K”个入口边缘中的至少一个。 此外，可以增加边缘子集中的每个边缘的概率。 此外，可以通过确保“K”进入边缘来确定最终的边缘集合。 当最终集合的节点的进入边缘的数量大于'K'的进入边缘时，可以通过去除一个或多个进入边缘来确保“K”个进入边缘。