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

1. 发明授权

US06321220B1 Method and apparatus for preventing topic drift in queries in hyperlinked environments 有权
标题翻译：用于在超链接环境中的查询中防止主题漂移的方法和装置
公开(公告)号：US06321220B1
公开(公告)日：2001-11-20
申请号：US09207215
申请日：1998-12-07
申请人： Jeffrey Dean , Monika R. Henzinger , Krishna Asur Bharat
发明人： Jeffrey Dean , Monika R. Henzinger , Krishna Asur Bharat
IPC分类号： G06F1730
CPC分类号： G06F17/30882 , G06F17/30864 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935
摘要： A method and apparatus for preventing topic drift in queries in hyperlinked environments uses equivalence components for ranking pages containing information that is relevant to the topic of a user query input to a search engine. The method includes the step of providing a query to a search engine, where the query represents a predetermined topic; retrieving at least one page associated with the query; constructing a graph representing the pages in memory; creating at least one equivalence component representing a subset of the graph; processing each equivalence component; eliminating the equivalence component in accordance with whether it matches the predetermined topic; and ranking the remaining pages.
摘要翻译：用于防止在超链接环境中的查询中的主题漂移的方法和装置使用等价组件来排列包含与搜索引擎输入的用户查询的主题相关的信息的页面。该方法包括向搜索引擎提供查询的步骤，其中查询表示预定的主题; 检索与查询相关联的至少一个页面; 构建表示存储器中的页面的图形; 创建表示图的子集的至少一个等价分量; 处理每个等价分量; 根据是否匹配预定的主题来消除等价分量; 并排列剩下的页面。

2. 发明授权

US6112203A Method for ranking documents in a hyperlinked environment using connectivity and selective content analysis 失效
标题翻译：使用连接性和选择性内容分析在超链接环境中对文档进行排序的方法
公开(公告)号：US6112203A
公开(公告)日：2000-08-29
申请号：US58577
申请日：1998-04-09
申请人： Krishna Asur Bharat , Monika R. Henzinger
发明人： Krishna Asur Bharat , Monika R. Henzinger
IPC分类号： G06F17/21 , G06F17/30
CPC分类号： G06F17/30864 , G06F17/218 , Y10S707/99933 , Y10S707/99935 , Y10S707/99943
摘要： In a computerized method, a set of documents is ranked according to their content and their connectivity by using topic distillation. The documents include links that connect the documents to each other, either directly, or indirectly. A graph is constructed in a memory of a computer system. In the graph, nodes represent the documents, and directed edges represent the links. Based on the number of links connecting the various nodes, a subset of documents is selected to form a topic. A second subset of the documents is chosen based on the number of directed edges connecting the nodes. Nodes in the second subset are compared with the topic to determine similarity to the topic, and a relevance weight is correspondingly assigned to each node. Nodes in the second subset having a relevance weight less than a predetermined threshold are pruned from the graph. The documents represented by the remaining nodes in the graph are ranked by connectivity based ranking scheme.
摘要翻译：在计算机化方法中，通过使用主题蒸馏，根据其内容和连接性对一组文档进行排名。文档包括直接或间接地将文档相互连接的链接。在计算机系统的存储器中构建图形。在图中，节点表示文档，有向边代表链接。基于连接各种节点的链接的数量，选择文档的一部分以形成主题。基于连接节点的有向边的数量来选择文档的第二子集。将第二子集中的节点与主题进行比较以确定与主题的相似性，并且将相关权重相应地分配给每个节点。具有小于预定阈值的相关权重的第二子集中的节点从图中剪除。由图中的剩余节点表示的文档通过基于连接的排序方案进行排名。

3. 发明授权

US06738678B1 Method for ranking hyperlinked pages using content and connectivity analysis 失效
标题翻译：使用内容和连接性分析对超链接页进行排序的方法
公开(公告)号：US06738678B1
公开(公告)日：2004-05-18
申请号：US09007635
申请日：1998-01-15
申请人： Krishna Asur Bharat , Monika R. Henzinger
发明人： Krishna Asur Bharat , Monika R. Henzinger
IPC分类号： G05B1302
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99937 , Y10S707/99943
摘要： A computerized method determines the ranking of documents including information content. The present method uses both content and connectivity analysis. An input set of documents is represented as a neighborhood graph in a memory. In the graph, each node represents one document, and each directed edge connecting a pair of nodes represents a linkage between the pair of documents. The input set of documents represented in the graph is ranked according to the contents of the documents. A subset of documents is selected from the input set of documents if the content ranking of the selected documents is greater than a first predetermined threshold. Nodes representing any documents, other than the selected documents, are deleted from the graph. The selected subset of documents is ranked according the linkage of the documents, and an output set of documents exceeding a second predetermined threshold is selected for presentation to users.
摘要翻译：计算机化方法确定包括信息内容在内的文件的排名。本方法使用内容和连接性分析。输入的一组文档在存储器中表示为邻域图。在图中，每个节点表示一个文档，并且连接一对节点的每个有向边代表一对文档之间的链接。图中表示的输入文档集合根据文档的内容进行排序。如果所选择的文档的内容排序大于第一预定阈值，则从文档的输入集中选择文档的子集。代表所选文件以外的任何文件的节点从图中删除。所选择的文档子集根据文档的链接进行排序，并且选择超过第二预定阈值的文档的输出集合以呈现给用户。

4. 发明授权

US07117206B1 Method for ranking hyperlinked pages using content and connectivity analysis 有权
标题翻译：使用内容和连接性分析对超链接页进行排序的方法
公开(公告)号：US07117206B1
公开(公告)日：2006-10-03
申请号：US10429237
申请日：2003-05-05
申请人： Krishna Asur Bharat , Monika R. Henzinger
发明人： Krishna Asur Bharat , Monika R. Henzinger
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99937 , Y10S707/99943
摘要： A computerized method determines the ranking of documents including information content. The present method uses both content and connectivity analysis. An input set of documents is represented as a neighborhood graph in a memory. In the graph, each node represents one document, and each directed edge connecting a pair of nodes represents a linkage between the pair of documents. The input set of documents represented in the graph is ranked according to the contents of the documents. A subset of documents is selected from the input set of documents if the content ranking of the selected documents is greater than a first predetermined threshold. Nodes representing any documents, other than the selected documents, are deleted from the graph. The selected subset of documents is ranked according the linkage of the documents, and an output set of documents exceeding a second predetermined threshold is selected for presentation to users.
摘要翻译：计算机化方法确定包括信息内容在内的文件的排名。本方法使用内容和连接性分析。输入的一组文档在存储器中表示为邻域图。在图中，每个节点表示一个文档，并且连接一对节点的每个有向边代表一对文档之间的链接。图中表示的输入文档集合根据文档的内容进行排序。如果所选择的文档的内容排序大于第一预定阈值，则从文档的输入集中选择文档的子集。代表所选文件以外的任何文件的节点从图中删除。所选择的文档子集根据文档的链接进行排序，并且选择超过第二预定阈值的文档的输出集合以呈现给用户。

5. 发明授权

US06665837B1 Method for identifying related pages in a hyperlinked database 有权
公开(公告)号：US06665837B1
公开(公告)日：2003-12-16
申请号：US09131473
申请日：1998-08-10
申请人： Jeffrey Dean , Monika R. Henzinger , Andrei Z. Broder
发明人： Jeffrey Dean , Monika R. Henzinger , Andrei Z. Broder
IPC分类号： G06F1500
CPC分类号： G06F17/30958 , G06F17/30864 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99945
摘要： A method is described for identifying related pages among a plurality of pages in a linked database such as the World Wide Web. An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory. The pages represented in the graph are scored on content, and a set of pages is selected, the selected set of pages having scores greater than a first predetermined threshold. The selected set of pages is scored on connectivity, and a subset of the set of pages that have scores greater than a second predetermined threshold are selected as related pages.

6. 发明授权

US06286006B1 Method and apparatus for finding mirrored hosts by analyzing urls 有权
标题翻译：通过分析网址查找镜像主机的方法和设备
公开(公告)号：US06286006B1
公开(公告)日：2001-09-04
申请号：US09307320
申请日：1999-05-07
申请人： Krishna A. Bharat , Andrei Broder , Steven C. Glassman , Jeffrey Dean , Monika R. Henzinger
发明人： Krishna A. Bharat , Andrei Broder , Steven C. Glassman , Jeffrey Dean , Monika R. Henzinger
IPC分类号： G06F1730
CPC分类号： G06F17/30902 , Y10S707/99935
摘要： A method and apparatus that detects mirrored host pairs using information about a large set of pages, including URLs. The identities of the detected mirrored hosts are then saved so that browsers, crawlers, proxy servers, or the like can correctly identify mirrored web sites. The described embodiments of the present invention look at the URLs of pages hosts to determine whether the hosts are potentially mirrored.
摘要翻译：使用关于包含URL的大量页面的信息检测镜像主机对的方法和装置。然后保存检测到的镜像主机的身份，以便浏览器，爬网程序，代理服务器等可以正确识别镜像的网站。所描述的本发明的实施例查看页面主机的URL以确定主机是否被潜在地镜像。

7. 发明授权

US07630973B2 Method for identifying related pages in a hyperlinked database 有权
标题翻译：用于识别超链接数据库中的相关页面的方法
公开(公告)号：US07630973B2
公开(公告)日：2009-12-08
申请号：US10702116
申请日：2003-11-03
申请人： Jeffrey Dean Black , Monika R. Henzinger , Andrei Z. Broder
发明人： Jeffrey Dean Black , Monika R. Henzinger , Andrei Z. Broder
IPC分类号： G06F17/30
CPC分类号： G06F17/30958 , G06F17/30864 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99945
摘要： A method is described for identifying related pages among a plurality of pages in a linked database such as the World Wide Web. An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory. The pages represented in the graph are scored on content, and a set of pages is selected, the selected set of pages having scores greater than a first predetermined threshold. The selected set of pages is scored on connectivity, and a subset of the set of pages that have scores greater than a second predetermined threshold are selected as related pages.
摘要翻译：描述了用于识别诸如万维网的链接数据库中的多个页面中的相关页面的方法。从多个页面中选择初始页面。链接到初始页面的页面在内存中表示为图形。在图中表示的页面对内容进行评分，并且选择一组页面，所选择的页面集合具有大于第一预定阈值的分数。所选择的页面集合在连通性上得分，并且选择具有大于第二预定阈值的分数的一组页面的子集作为相关页面。

8. 发明授权

US06487555B1 Method and apparatus for finding mirrored hosts by analyzing connectivity and IP addresses 有权
标题翻译：通过分析连接和IP地址查找镜像主机的方法和设备
公开(公告)号：US06487555B1
公开(公告)日：2002-11-26
申请号：US09307153
申请日：1999-05-07
申请人： Krishna A. Bharat , Andrei Z. Broder , Steven C. Glassman , Jeffrey Dean , Monika R. Henzinger
发明人： Krishna A. Bharat , Andrei Z. Broder , Steven C. Glassman , Jeffrey Dean , Monika R. Henzinger
IPC分类号： G06F1730
CPC分类号： G06F17/30864
摘要： A method and system that detects mirrored host pairs using information about a large set of pages, including one or more of: URLs, IP addresses, and connectivity information. The identities of the detected mirrored hosts are then saved so that browsers, crawlers, proxy servers, or the like can correctly identify mirrored web sites. The described embodiments of the present invention use one or a combination of techniques to identify mirrors. A first group of techniques involves determining mirrors based on URLs and information about connectivity (i.e., hyperlinks) between pages. A second group of techniques looks at connectivity information at a higher granularity, considering all links from all pages on a host as one group and ignoring the target of each link beyond the host level.
摘要翻译：使用关于大量页面的信息来检测镜像主机对的方法和系统，包括以下一个或多个：URL，IP地址和连接信息。然后保存检测到的镜像主机的身份，以便浏览器，爬网程序，代理服务器等可以正确识别镜像的网站。所描述的本发明的实施例使用一种或技术的组合来识别反射镜。第一组技术涉及基于URL和关于页面之间的连接性（即，超链接）的信息来确定镜像。第二组技术以更高的粒度来考虑连接信息，考虑到主机上所有页面的所有链接为一个组，并忽略超出主机级别的每个链接的目标。

9. 发明授权

US6138113A Method for identifying near duplicate pages in a hyperlinked database 有权
标题翻译：在超链接数据库中识别近重复页面的方法
公开(公告)号：US6138113A
公开(公告)日：2000-10-24
申请号：US131469
申请日：1998-08-10
申请人： Jeffrey Dean , Monika R. Henzinger
发明人： Jeffrey Dean , Monika R. Henzinger
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99932
摘要： A method is described for identifying pages that are near duplicates in a linked database. In the linked database, pages can have incoming links and outgoing links. Two pages are selected, a first page and a second page. For each selected page, the number of outgoing links is determined. The two pages are marked as near duplicates based on the number of common outgoing links for the two pages.
摘要翻译：描述了一种用于识别链接数据库中几乎重复的页面的方法。在链接的数据库中，页面可以具有传入链接和传出链接。选择两页，第一页和第二页。对于每个所选页面，确定输出链接的数量。这两个页面根据两页的通用传出链接的数量被标记为近似的重复。

10. 发明授权

US07451388B1 Ranking search engine results 有权
标题翻译：排名搜索引擎结果
公开(公告)号：US07451388B1
公开(公告)日：2008-11-11
申请号：US09392170
申请日：1999-09-08
申请人： Monika R. Henzinger , Michael D. Mitzenmacher
发明人： Monika R. Henzinger , Michael D. Mitzenmacher
IPC分类号： G06F17/00
CPC分类号： G06F17/30864 , Y10S707/99933
摘要： A method, system, and computer program product for determining relative quality of search engine indexes and search results include performing a two-level random walk through a hypertext-linked document set. Search engine index quality is measured based on the number of encountered documents that are indexed by the search engine index. Search result quality is measured based on the number and quality of documents that link to the result document.
摘要翻译：用于确定搜索引擎索引和搜索结果的相对质量的方法，系统和计算机程序产品包括通过超文本链接的文档集执行两级随机游走。搜索引擎索引质量是根据搜索引擎索引索引的遇到文档的数量来测量的。搜索结果质量是根据链接到结果文档的文档的数量和质量来衡量的。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式