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

1. 发明申请

US20050033742A1 Methods for ranking nodes in large directed graphs 有权
标题翻译：大型定向图中节点排序的方法
公开(公告)号：US20050033742A1
公开(公告)日：2005-02-10
申请号：US10646331
申请日：2003-08-22
申请人： Sepandar Kamvar , Taher Haveliwala , Glen Jeh , Gene Golub
发明人： Sepandar Kamvar , Taher Haveliwala , Glen Jeh , Gene Golub
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99935 , Y10S707/99937
摘要： Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include block-level weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.
摘要翻译：将等级分配给大型链接数据库（例如万维网或任何其他超媒体数据库）中的节点的技术对节点进行分区，使得链路矩阵具有主要的块对角线形式。在每个块内，可以通过分布式计算环境中的不同计算机为块中的节点计算局部秩。然后，对于每个块作为整体估计块等级，并且可以可选地包括块级权重以实现定制排名。然后组合本地队列和块队列以形成全局等级，可用于对节点进行排序。或者，可以将数据库的全局秩向量用作基于迭代链路的排序方案中的初始向量，以获得节点的更准确的全局等级。全局秩矢量可以被划分以提供用于该方法的随后应用的局部秩矢量。

2. 发明授权

US07216123B2 Methods for ranking nodes in large directed graphs 有权
标题翻译：大型定向图中节点排序的方法
公开(公告)号：US07216123B2
公开(公告)日：2007-05-08
申请号：US10646331
申请日：2003-08-22
申请人： Sepandar D. Kamvar , Taher H. Haveliwala , Glen Jeh , Gene Golub
发明人： Sepandar D. Kamvar , Taher H. Haveliwala , Glen Jeh , Gene Golub
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99935 , Y10S707/99937
摘要： Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include block-level weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.
摘要翻译：将等级分配给大型链接数据库（例如万维网或任何其他超媒体数据库）中的节点的技术对节点进行分区，使得链路矩阵具有主要的块对角线形式。在每个块内，可以通过分布式计算环境中的不同计算机为块中的节点计算局部秩。然后，对于每个块作为整体估计块等级，并且可以可选地包括块级权重以实现定制排名。然后组合本地队列和块队列以形成全局等级，可用于对节点进行排序。或者，可以将数据库的全局秩向量用作基于迭代链路的排序方案中的初始向量，以获得节点的更准确的全局等级。全局秩矢量可以被划分以提供用于该方法的随后应用的局部秩矢量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式