利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

12 条记录 (耗时 0.034 秒)

    LOCAL COMPUTATION OF RANK CONTRIBUTIONS
    4.
    发明申请
    LOCAL COMPUTATION OF RANK CONTRIBUTIONS 有权
    排名贡献的本地计算

    公开(公告)号：US20090030916A1

    公开(公告)日：2009-01-29

    申请号：US12124239

    申请日：2008-05-21

    申请人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    发明人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864

    摘要： The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.

    摘要翻译： 所要求保护的主题涉及可以识别，存储和/或输出有向图中的顶点等级的局部贡献的架构。 架构可以接收有向图和参数，并检查顶点的局部子集（例如，给定顶点的局部），以便确定本地支持集。 本地支持集可以包括一组局部顶点，每个顶点将参数的最小部分贡献给顶点的等级。 本地支持集可以作为对整个图的顶点的支持集和/或等级的估计的基础，并且可以用作检测链接或网络垃圾邮件以及其他基于影响的社交网络应用的手段。

    Local computation of rank contributions
    5.
    发明授权
    Local computation of rank contributions 有权
    地方计算等级的贡献

    公开(公告)号：US08438189B2

    公开(公告)日：2013-05-07

    申请号：US12124239

    申请日：2008-05-21

    申请人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    发明人： Reid Marlow Andersen ,  Christian Herwarth Borgs ,  Jennifer Tour Chayes ,  Krishna C. Gade ,  John E. Hopcroft ,  Vahab Mirrokni ,  Shang-Hua Teng

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30864

    摘要： The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.

    摘要翻译： 所要求保护的主题涉及可以识别，存储和/或输出有向图中的顶点等级的局部贡献的架构。 架构可以接收有向图和参数，并检查顶点的局部子集（例如，给定顶点的局部），以便确定本地支持集。 本地支持集可以包括一组局部顶点，每个顶点将参数的最小部分贡献给顶点的等级。 本地支持集可以作为对整个图的顶点的支持集和/或等级的估计的基础，并且可以用作检测链接或网络垃圾邮件以及其他基于影响的社交网络应用的手段。

    System and method for identifying web communities from seed sets of web pages
    6.
    发明申请
    System and method for identifying web communities from seed sets of web pages 有权
    用于从种子网页识别网络社区的系统和方法

    公开(公告)号：US20080052263A1

    公开(公告)日：2008-02-28

    申请号：US11510412

    申请日：2006-08-24

    申请人： Reid Marlow Andersen ,  Kevin John Lang

    发明人： Reid Marlow Andersen ,  Kevin John Lang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30873 ,  G06F17/30882

    摘要： An improved system and method is provided for identifying web communities from seed sets of web pages. A seed set of web pages may be represented as a set of seed vertices of a graph representing a collection of web pages. An initial probability distribution may be constructed on vertices of the graph by assigning a nonzero value to the vertices belonging to the seed set. Then a sequence of probability distributions may be produced on the vertices of the graph by modifying the probability distribution over a series of one-step walks of the probability distribution over the vertices of the graph. For each probability distribution produced in the sequence, level sets of vertices may be generated, and a level set with minimal conductance may be selected for each probability distribution. The level set with the least conductance may then be output representing a community of web pages.

    摘要翻译： 提供了一种改进的系统和方法，用于从网页的种子集识别网络社区。 网页的种子集可以表示为表示网页集合的图的一组种子顶点。 可以通过向属性集合的顶点分配非零值来在图的顶点上构建初始概率分布。 然后，可以通过在图的顶点上的概率分布的一系列一步走路上修改概率分布来在图的顶点上产生概率分布序列。 对于在序列中产生的每个概率分布，可以生成顶点的级集合，并且可以针对每个概率分布选择具有最小导数的级别。 然后可以输出表示网页社区的电导最小的级别。

    LOCATING DENSE AND ISOLATED SUB-GRAPHS
    7.
    发明申请
    LOCATING DENSE AND ISOLATED SUB-GRAPHS 有权
    位置渗透和分离的子图

    公开(公告)号：US20090106184A1

    公开(公告)日：2009-04-23

    申请号：US11875752

    申请日：2007-10-19

    申请人： Kevin John Lang ,  Reid Marlow Andersen

    发明人： Kevin John Lang ,  Reid Marlow Andersen

    IPC分类号： G06N5/02

    CPC分类号： G06N5/02 ,  G06Q30/02

    摘要： Methods and apparatus for locating a dense and isolated sub-graph from a weighted graph having multiple nodes and multiple weighted edges are described. Each node in the weighted graph represents an object. Each weighted edge in the weighted graph connects two nodes and represents the relationship between the two objects represented by the two corresponding nodes. To located the sub-graph, first, an auxiliary weighted graph is constructed using the weighted graph and three coefficients: α, β, and γ, where α, β, and γ are greater than 0, α influences the number of nodes inside the sub-graph, β influences the sum of the weights associated with the edges connecting a node inside the sub-graph and a node outside the sub-graph, and γ influences the sum of the weights associated with the edges connecting two nodes both inside the sub-graph, and by adding a source node s and a sink node t. Next, the auxiliary weighted graph is partitioned into two parts using the s-t minimum cut algorithm. The sub-graph is the part associated with the sink node t in its original form, with the original undirected edges and unmodified edge weights and excluding the sink node t and all the new edges added during the construction of the auxiliary weighted graph.

    摘要翻译： 描述了从具有多个节点和多个加权边缘的加权图中定位密集且隔离的子图的方法和装置。 加权图中的每个节点表示一个对象。 加权图中的每个加权边连接两个节点，并表示由两个相应节点表示的两个对象之间的关系。 为了定位子图，首先，使用加权图和三个系数α，β和γ构建辅助加权图，其中α，β和γ大于0，α影响内部节点的数量 子图，β影响与连接子图中的节点和子图之外的节点的边缘相关联的权重之和，并且gamma影响与连接两个节点内部的两个节点的边缘相关联的权重之和 子图，并通过添加源节点s和汇聚节点t。 接下来，使用s-t最小切割算法将辅助加权图分割成两部分。 子图是与其原始形式的汇聚节点t相关联的部分，具有原始无向边和未修改边权，并且不包括汇点节点t以及在辅助加权图的构造期间添加的所有新边。

    Local graph partitioning using evolving sets
    8.
    发明授权
    Local graph partitioning using evolving sets 有权
    使用演进集的本地图分割

    公开(公告)号：US08364615B2

    公开(公告)日：2013-01-29

    申请号：US12367404

    申请日：2009-02-06

    申请人： Reid Marlow Andersen ,  Yuval Peres

    发明人： Reid Marlow Andersen ,  Yuval Peres

    IPC分类号： G06F15/18 ,  G06F17/50 ,  G06F7/00

    CPC分类号： G06F17/10 ,  H04L41/145 ,  H04L41/16

    摘要： Providing for local graph partitioning using an evolving set process is disclosed herein. By way of example, a computer processor can be configured to execute local partitioning based on evolving set instructions. The instructions can be employed to transition a set of analyzed vertices of a graph until a segment of the graph with small conductance is identified. A transitioning algorithm can expand or contract the analyzed set of vertices based on characteristics of vertices at a boundary of the analyzed set. Accordingly, as the set of analyzed vertices becomes large, significant processing efficiency is gained by employing the characteristics of boundary vertices to transition the set or determine conductance, rather than all vertices of the analyzed set.

    摘要翻译： 本文公开了使用演进集合过程提供局部图分割。 作为示例，计算机处理器可以被配置为基于演进的设置指令来执行本地分区。 可以使用这些指令来转换图的一组经分析的顶点，直到识别出具有小电导的图形的一段。 转换算法可以基于分析集合的边界处的顶点的特征来扩展或收缩分析的顶点集合。 因此，当分析的顶点集合变大时，通过采用边界顶点的特征来转换集合或确定电导而不是分析集合的所有顶点，可以获得显着的处理效率。

    HEIRARCHICAL ERASURE CODING
    9.
    发明申请
    HEIRARCHICAL ERASURE CODING 审中-公开
    HEIRARCHICAL ERASURE编码

    公开(公告)号：US20100174968A1

    公开(公告)日：2010-07-08

    申请号：US12348072

    申请日：2009-01-02

    申请人： Denis X. Charles ,  Siddhartha Puri ,  Reid Marlow Andersen

    发明人： Denis X. Charles ,  Siddhartha Puri ,  Reid Marlow Andersen

    IPC分类号： H03M13/15 ,  G06F15/16 ,  G06F11/10

    CPC分类号： H03M13/3761 ,  H03M13/373 ,  H04L67/104 ,  H04L67/108

    摘要： Arrangements are provided for efficient erasure coding of files to be distributed and later retrieved from a peer-to-peer network, where such files are broken up into many fragments and stored at peer systems. The arrangements further provide a routine to determine the probability that the file can be reconstructed. The arrangements further provide a method of performing the erasure coding in an optimized fashion, allowing fewer occurrences of disk seeks.

    摘要翻译： 提供了用于有效地擦除对待分发的文件进行擦除编码并随后从对等网络检索的文件，其中这些文件被分解成许多片段并存储在对等系统中。 这种安排进一步提供了一个程序来确定可以重构文件的概率。 该方案进一步提供了以优化的方式执行擦除编码的方法，允许更少的盘寻找出现。

    System and method for identifying web communities from seed sets of web pages
    10.
    发明授权
    System and method for identifying web communities from seed sets of web pages 有权
    用于从种子网页识别网络社区的系统和方法

    公开(公告)号：US07949661B2

    公开(公告)日：2011-05-24

    申请号：US11510412

    申请日：2006-08-24

    申请人： Reid Marlow Andersen ,  Kevin John Lang

    发明人： Reid Marlow Andersen ,  Kevin John Lang

    IPC分类号： G06F17/00

    CPC分类号： G06F17/30873 ,  G06F17/30882

    摘要： An improved system and method is provided for identifying web communities from seed sets of web pages. A seed set of web pages may be represented as a set of seed vertices of a graph representing a collection of web pages. An initial probability distribution may be constructed on vertices of the graph by assigning a nonzero value to the vertices belonging to the seed set. Then a sequence of probability distributions may be produced on the vertices of the graph by modifying the probability distribution over a series of one-step walks of the probability distribution over the vertices of the graph. For each probability distribution produced in the sequence, level sets of vertices may be generated, and a level set with minimal conductance may be selected for each probability distribution. The level set with the least conductance may then be output representing a community of web pages.

    摘要翻译： 提供了一种改进的系统和方法，用于从网页的种子集识别网络社区。 网页的种子集可以表示为表示网页集合的图的一组种子顶点。 可以通过向属性集合的顶点分配非零值来在图的顶点上构建初始概率分布。 然后，可以通过在图的顶点上的概率分布的一系列一步走路上修改概率分布来在图的顶点上产生概率分布序列。 对于在序列中产生的每个概率分布，可以生成顶点的级集合，并且可以针对每个概率分布选择具有最小导数的级别。 然后可以输出表示网页社区的电导最小的级别。