Identification of new sources for topics
    1.
    发明授权
    Identification of new sources for topics 有权
    确定主题的新来源

    公开(公告)号:US08949228B2

    公开(公告)日:2015-02-03

    申请号:US13742109

    申请日:2013-01-15

    Applicant: Google Inc.

    CPC classification number: G06F17/30867

    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for collecting user interaction data of a plurality of users for each of a first plurality of document-text pairs, wherein the user interaction data is collected for the document-text pair from a respective service for which the respective text of the document-text pair was selected. A respective weight is calculated for each of the first plurality of document-text pairs based on, at least, the collected user interaction data for the document-text pair. One or more topics are associated with one or more of the sources based on, at least, the respective weights associated with a plurality of first document-text pairs that are associated with the source.

    Abstract translation: 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于收集用于多个文档对中的每一个的多个用户的用户交互数据,其中为文档文本收集用户交互数据 从对应于其中选择文档 - 文本对的相应文本的服务对。 至少基于用于文档 - 文本对的收集的用户交互数据,针对第一多个文档 - 文本对中的每一个计算相应的权重。 基于至少与与源相关联的多个第一文档 - 文本对相关联的相应权重,一个或多个主题与一个或多个源相关联。

    Scalable system for determining short paths within web link network
    3.
    发明授权
    Scalable system for determining short paths within web link network 有权
    用于确定网络链路网络内的短路径的可扩展系统

    公开(公告)号:US09400849B1

    公开(公告)日:2016-07-26

    申请号:US14473563

    申请日:2014-08-29

    Applicant: Google Inc.

    Abstract: Systems and methods for finding multiple shortest paths. A directed graph representing web resources and links are divided into shards, each shard comprising a portion of the graph representing multiple web resources. Each of the shards is assigned to a server, and a distance table is calculated in parallel for each of the web resources in each shard using a nearest seed computation in the server to which the shard was assigned.

    Abstract translation: 查找多条最短路径的系统和方法。 表示网页资源和链接的有向图被划分成分片,每个分片包括表示多个网页资源的图表的一部分。 将每个分片分配给服务器,并且使用分配了分片的服务器中的最近的种子计算,并行计算每个分片中的每个网页资源的距离表。

    Asynchronous message passing for large graph clustering

    公开(公告)号:US09852230B2

    公开(公告)日:2017-12-26

    申请号:US14145127

    申请日:2013-12-31

    Applicant: GOOGLE INC.

    CPC classification number: G06F17/30958 G06F9/546 G06F2209/548 G06Q10/06

    Abstract: Systems and methods for sending asynchronous messages include receiving, using at least one processor, at a node in a distributed graph, a message with a first value and determining, at the node, that the first value replaces a current value for the node. In response to determining that the first value replaces the current value, the method also includes setting a status of the node to active and sending messages including the first value to neighboring nodes. The method may also include receiving the messages to the neighboring nodes at a priority queue. The priority queue propagates messages in an intelligently asynchronous manner, and the priority queue propagates the messages to the neighboring nodes, the status of the node is set to inactive. The first value may be a cluster identifier or a shortest path identifier.

    Identification of New Sources for Topics
    6.
    发明申请
    Identification of New Sources for Topics 有权
    确定主题的新来源

    公开(公告)号:US20140201199A1

    公开(公告)日:2014-07-17

    申请号:US13742109

    申请日:2013-01-15

    Applicant: Google Inc.

    CPC classification number: G06F17/30867

    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for collecting user interaction data of a plurality of users for each of a first plurality of document-text pairs, wherein the user interaction data is collected for the document-text pair from a respective service for which the respective text of the document-text pair was selected. A respective weight is calculated for each of the first plurality of document-text pairs based on, at least, the collected user interaction data for the document-text pair. One or more topics are associated with one or more of the sources based on, at least, the respective weights associated with a plurality of first document-text pairs that are associated with the source.

    Abstract translation: 方法,系统和装置,包括在计算机存储介质上编码的计算机程序,用于收集用于多个文档对中的每一个的多个用户的用户交互数据,其中为文档文本收集用户交互数据 从对应于其中选择文档 - 文本对的相应文本的服务对。 至少基于用于文档 - 文本对的收集的用户交互数据,针对第一多个文档 - 文本对中的每一个计算相应的权重。 基于至少与与源相关联的多个第一文档 - 文本对相关联的相应权重,一个或多个主题与一个或多个源相关联。

    ASYNCHRONOUS MESSAGE PASSING FOR LARGE GRAPH CLUSTERING
    7.
    发明申请
    ASYNCHRONOUS MESSAGE PASSING FOR LARGE GRAPH CLUSTERING 有权
    用于大量图形聚类的异步消息传递

    公开(公告)号:US20150006606A1

    公开(公告)日:2015-01-01

    申请号:US14145127

    申请日:2013-12-31

    Applicant: GOOGLE INC.

    CPC classification number: G06F17/30958 G06F9/546 G06F2209/548 G06Q10/06

    Abstract: Systems and methods for sending asynchronous messages include receiving, using at least one processor, at a node in a distributed graph, a message with a first value and determining, at the node, that the first value replaces a current value for the node. In response to determining that the first value replaces the current value, the method also includes setting a status of the node to active and sending messages including the first value to neighboring nodes. The method may also include receiving the messages to the neighboring nodes at a priority queue. The priority queue propagates messages in an intelligently asynchronous manner, and the priority queue propagates the messages to the neighboring nodes, the status of the node is set to inactive. The first value may be a cluster identifier or a shortest path identifier.

    Abstract translation: 用于发送异步消息的系统和方法包括:使用至少一个处理器在分布式图中的节点处接收具有第一值的消息,并在该节点处确定第一值替换该节点的当前值。 响应于确定第一值替换当前值,该方法还包括将节点的状态设置为活动,并将包括第一值的消息发送到相邻节点。 该方法还可以包括在优先级队列处接收消息到相邻节点。 优先级队列以智能异步方式传播消息,优先级队列将消息传播到相邻节点,节点的状态设置为非活动状态。 第一个值可以是集群标识符或最短路径标识符。

    ESTIMATING RATE OF CHANGE OF DOCUMENTS
    8.
    发明申请
    ESTIMATING RATE OF CHANGE OF DOCUMENTS 审中-公开
    估计文件变更率

    公开(公告)号:US20130212100A1

    公开(公告)日:2013-08-15

    申请号:US13726951

    申请日:2012-12-26

    Applicant: Google Inc.

    CPC classification number: G06F16/93 G06F16/38 G06F16/951

    Abstract: One aspect of the disclosure can be embodied in a method that includes obtaining a first document from a corpus and obtaining metadata for the first document. The method also includes obtaining existing change rates for second documents selected based on the metadata, and calculating an estimated change rate for the first document based on the change rates for the second documents.

    Abstract translation: 本公开的一个方面可以以包括从语料库获得第一文档并获得第一文档的元数据的方法来实现。 该方法还包括获得基于元数据选择的第二文档的现有变化率,以及基于第二文档的变化率来计算第一文档的估计变化率。

Patent Agency Ranking