专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20110202846A1 ESTIMATING SHORTEST DISTANCES IN GRAPHS 有权
标题翻译：评估格局中的最短距离
公开(公告)号：US20110202846A1
公开(公告)日：2011-08-18
申请号：US12705630
申请日：2010-02-15
申请人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F15/16 , G06F3/048
CPC分类号： G06N5/04 , G01C21/3446
摘要： Sketches are generated for each node in a graph. For undirected graphs, each sketch for a node may include an indicator of a node from a seed set of nodes and the shortest distance between the node and the indicated node. When a request is received for the shortest distance between two nodes of the graph, the sketches for each of the two nodes are retrieved, and nodes that are indicated in both of the sketches are determined. The distances between each of the two nodes and a determined node as indicated in the sketches is summed for each of the determined nodes, and the sum having the least distance is selected as the estimated shortest distance between the two nodes.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

2. 发明授权

US08666920B2 Estimating shortest distances in graphs using sketches 有权
标题翻译：使用草图估计图中的最短距离
公开(公告)号：US08666920B2
公开(公告)日：2014-03-04
申请号：US12705630
申请日：2010-02-15
申请人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/00 , G06N5/04
CPC分类号： G06N5/04 , G01C21/3446
摘要： Sketches are generated for each node in a graph. For undirected graphs, each sketch for a node may include an indicator of a node from a seed set of nodes and the shortest distance between the node and the indicated node. When a request is received for the shortest distance between two nodes of the graph, the sketches for each of the two nodes are retrieved, and nodes that are indicated in both of the sketches are determined. The distances between each of the two nodes and a determined node as indicated in the sketches is summed for each of the determined nodes, and the sum having the least distance is selected as the estimated shortest distance between the two nodes.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

3. 发明申请

US20100281022A1 ESTIMATING RANK ON GRAPH STREAMS 有权
标题翻译：估计图表的排名
公开(公告)号：US20100281022A1
公开(公告)日：2010-11-04
申请号：US12434691
申请日：2009-05-04
申请人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/30 , G06N5/04
CPC分类号： G06F17/30958
摘要： The rank of nodes in a graph may be inferred from a calculated probability that each node in the graph appears in a single random walk of the graph. Short random walks may be generated for each node in the graph. The generated random walks may be combined to form a longer single random walk. Multiple single random walks may be generated in this fashion. The probability of each node appearing in a single random may be calculated from the generated single random walks. The rank of each node may then be inferred from the calculated probabilities.
摘要翻译：图中节点的等级可以从图中的每个节点出现在图的单个随机游走中的计算概率推断。可以为图中的每个节点生成短随机散步。所产生的随机散步可以组合以形成更长的单次随机游走。可以以这种方式产生多个单个随机散步。可以从生成的单个随机游走中计算每个节点出现在单个随机中的概率。然后可以从计算的概率推断每个节点的等级。

4. 发明授权

US08073832B2 Estimating rank on graph streams 有权
标题翻译：估计图流的排名
公开(公告)号：US08073832B2
公开(公告)日：2011-12-06
申请号：US12434691
申请日：2009-05-04
申请人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： The rank of nodes in a graph may be inferred from a calculated probability that each node in the graph appears in a single random walk of the graph. Short random walks may be generated for each node in the graph. The generated random walks may be combined to form a longer single random walk. Multiple single random walks may be generated in this fashion. The probability of each node appearing in a single random may be calculated from the generated single random walks. The rank of each node may then be inferred from the calculated probabilities.
摘要翻译：图中节点的等级可以从图中的每个节点出现在图的单个随机游走中的计算概率推断。可以为图中的每个节点生成短随机散步。所产生的随机散步可以组合以形成更长的单次随机游走。可以以这种方式产生多个单个随机散步。可以从生成的单个随机游走中计算每个节点出现在单个随机中的概率。然后可以从计算的概率推断每个节点的等级。

5. 发明申请

US20140149510A1 SOCIAL SHARING SYSTEM 审中-公开
标题翻译：社会共享系统
公开(公告)号：US20140149510A1
公开(公告)日：2014-05-29
申请号：US13945772
申请日：2013-07-18
申请人： Neelakantan Sundaresan , Atish Das Sarma , Si Si , Elizabeth Churchill
发明人： Neelakantan Sundaresan , Atish Das Sarma , Si Si , Elizabeth Churchill
IPC分类号： H04L29/06
CPC分类号： H04L65/403 , G06Q30/0255 , G06Q30/0271 , G06Q50/01
摘要： A system, computer-readable storage medium storing at least one program, and computer-implemented method for providing recommendations based on social network sharing activity. Sharing activity relating to the sharing of the content item on a social network by a first user is accessed. Consumption information related to the consumption of the content item. A correlation between the sharing activity and the consumption information is determined. A recommendation is then generated based on the correlation.
摘要翻译：存储至少一个程序的系统，计算机可读存储介质和用于基于社交网络共享活动提供建议的计算机实现的方法。访问与第一用户在社交网络上共享内容项目有关的共享活动。与消费内容项相关的消费信息。确定共享活动与消费信息之间的相关性。然后基于相关性生成推荐。

6. 发明申请

US20160092426A1 GENERATIVE GRAMMAR MODELS FOR EFFECTIVE PROMOTION AND ADVERTISING 有权
标题翻译：用于有效促进和广告的一般灰度模型
公开(公告)号：US20160092426A1
公开(公告)日：2016-03-31
申请号：US14500727
申请日：2014-09-29
申请人： Elizabeth Churchill , Atish Das Sarma , Corinne Elizabeth Sherman , Gyanit Singh
发明人： Elizabeth Churchill , Atish Das Sarma , Corinne Elizabeth Sherman , Gyanit Singh
IPC分类号： G06F17/27 , G06Q30/02 , H04L12/58
CPC分类号： G06F17/2881 , G06Q30/0239 , G06Q30/0276 , H04L51/066 , H04L51/32 , H04L51/38
摘要： A system comprising a computer-readable storage medium storing at least one program and a computer-implemented method for creating messages using generative grammar models is presented. Consistent with some embodiments, the method may include receiving a request to generate a message, which in an example embodiment is to be published to a social network platform. In response to receiving the request, a generative grammar model defining the structure of the message is accessed. The generative grammar model may include a number of blanks and may specify a source along with a grammatical constraint for a term to populate each blank. The method may further include generating the message in accordance with the generative grammar model, and causing the generated message to be published.
摘要翻译：提出了一种包括存储至少一个程序的计算机可读存储介质和用于使用生成语法模型创建消息的计算机实现的方法的系统。与一些实施例一致，该方法可以包括接收生成消息的请求，在示例实施例中将其发布到社交网络平台。响应于接收到请求，访问定义消息结构的生成语法模型。生成语法模型可以包括多个空格，并且可以指定源以及用于填充每个空白的术语的语法约束。该方法还可以包括根据生成语法模型生成消息，并且使得生成的消息被发布。

7. 发明申请

US20150348099A1 PREDICTING PURCHASE SESSION BEHAVIOR USING THE SHOPPING FUNNEL MODEL STAGES 审中-公开
标题翻译：使用SHOPPING FUNNEL模型阶段预测购买会议行为
公开(公告)号：US20150348099A1
公开(公告)日：2015-12-03
申请号：US14290637
申请日：2014-05-29
申请人： Elizabeth Churchill , Atish Das Sarma , Shuo Chang
发明人： Elizabeth Churchill , Atish Das Sarma , Shuo Chang
IPC分类号： G06Q30/02
CPC分类号： G06Q30/0253
摘要： A user activity detection engine monitors user activity during user sessions on a publication system, and detects a change in the level of the activity of the user that predicts that the user is about to execute a transaction. The change may be an increase in the level of activity. When the user activity detection engine detects such a change, the system may make an intervention to provide personalized marketing content for display to the user in an effort to improve the probability that the user will execute a transaction, and/or also to motive the user to execute the transaction on the system site instead of moving to a competitor site in search of a different transaction.
摘要翻译：用户活动检测引擎在发布系统上的用户会话期间监视用户活动，并且检测预测用户将要执行交易的用户的活动级别的变化。这种变化可能是活动水平的提高。当用户活动检测引擎检测到这种变化时，系统可以进行干预以提供个性化的营销内容以供用户显示，以努力提高用户执行交易的可能性和/或动员用户在系统站点上执行交易，而不是移动到竞争对手站点以寻找不同的事务。

8. 发明申请

US20150341304A1 PERSONALIZED SHARING AT THE USER LEVEL 审中-公开
标题翻译：在用户层面进行个性化分享
公开(公告)号：US20150341304A1
公开(公告)日：2015-11-26
申请号：US14285211
申请日：2014-05-22
申请人： Corinne Elizabeth Sherman , Elizabeth Churchill , Atish Das Sarma
发明人： Corinne Elizabeth Sherman , Elizabeth Churchill , Atish Das Sarma
IPC分类号： H04L12/58 , H04L29/08
CPC分类号： H04L51/32 , H04L51/063 , H04L67/306
摘要： A system comprising a computer-readable storage medium storing at least one program and a computer-implemented method for generating and provisioning personalized messages is presented. Consistent with some embodiments, the method may include receiving a request from a user to share content with one or more other users. In response to receiving the request, user profile data about the user may be accessed, and a portion of the user profile data may be selected. The method may further include generating a personalized message based on the selected portion of the user profile data, and communicating the personalized message to the one or more other users.
摘要翻译：提出了一种包括存储至少一个程序的计算机可读存储介质和用于生成和提供个性化消息的计算机实现的方法的系统。与一些实施例一致，该方法可以包括从用户接收与一个或多个其他用户共享内容的请求。响应于接收到请求，可以访问关于用户的用户简档数据，并且可以选择一部分用户简档数据。该方法还可以包括基于用户简档数据的所选部分生成个性化消息，以及将个性化消息传送给一个或多个其他用户。

9. 发明授权

US08909646B1 Pre-processing of social network structures for fast discovery of cohesive groups 有权
标题翻译：预处理社交网络结构，快速发现凝聚力群体
公开(公告)号：US08909646B1
公开(公告)日：2014-12-09
申请号：US13731505
申请日：2012-12-31
申请人： Alexander Fabrikant , Atish Das Sarma
发明人： Alexander Fabrikant , Atish Das Sarma
IPC分类号： G06F17/30
CPC分类号： G06F17/30601 , G06Q50/01
摘要： Aspects and implementations of the present disclosure are directed to methods and systems of pre-processing a social network structure for fast discovery of cohesive groups. In general, in some implementations, a data processing system identifies a cohesive user group in a social network for delivery of a tailored content item. Generally, the data processing system identifies an affinity criteria; generates a set of user identifiers having characteristics that satisfy the affinity criteria; and generates graphs of users with at least one direct or indirect social network user connection with other user identifiers in the graph. The data processing system returns or stores the graph on computer readable media for later use. A graph may be generated with edges representing connections between user identifiers; edges may be weighted for the number and lengths of connection paths for indirect connections, and for similarities between users.
摘要翻译：本公开的方面和实现涉及预处理社交网络结构以快速发现粘性组的方法和系统。通常，在一些实施方式中，数据处理系统识别社交网络中用于传送定制内容项目的一致性用户组。通常，数据处理系统识别亲和度标准; 生成具有满足亲和度准则的特征的一组用户标识符; 并且生成具有与图中的其他用户标识符的至少一个直接或间接的社交网络用户连接的用户的图形。数据处理系统将图形返回或存储在计算机可读介质上供以后使用。可以生成具有表示用户标识符之间的连接的边的图; 边缘可以对于间接连接的连接路径的数量和长度以及用户之间的相似性进行加权。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式