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

1. 发明授权

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.
摘要翻译：在计算机化方法中，通过使用主题蒸馏，根据其内容和连接性对一组文档进行排名。文档包括直接或间接地将文档相互连接的链接。在计算机系统的存储器中构建图形。在图中，节点表示文档，有向边代表链接。基于连接各种节点的链接的数量，选择文档的一部分以形成主题。基于连接节点的有向边的数量来选择文档的第二子集。将第二子集中的节点与主题进行比较以确定与主题的相似性，并且将相关权重相应地分配给每个节点。具有小于预定阈值的相关权重的第二子集中的节点从图中剪除。由图中的剩余节点表示的文档通过基于连接的排序方案进行排名。

2. 发明授权

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.
摘要翻译：计算机化方法确定包括信息内容在内的文件的排名。本方法使用内容和连接性分析。输入的一组文档在存储器中表示为邻域图。在图中，每个节点表示一个文档，并且连接一对节点的每个有向边代表一对文档之间的链接。图中表示的输入文档集合根据文档的内容进行排序。如果所选择的文档的内容排序大于第一预定阈值，则从文档的输入集中选择文档的子集。代表所选文件以外的任何文件的节点从图中删除。所选择的文档子集根据文档的链接进行排序，并且选择超过第二预定阈值的文档的输出集合以呈现给用户。

3. 发明授权

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.
摘要翻译：用于防止在超链接环境中的查询中的主题漂移的方法和装置使用等价组件来排列包含与搜索引擎输入的用户查询的主题相关的信息的页面。该方法包括向搜索引擎提供查询的步骤，其中查询表示预定的主题; 检索与查询相关联的至少一个页面; 构建表示存储器中的页面的图形; 创建表示图的子集的至少一个等价分量; 处理每个等价分量; 根据是否匹配预定的主题来消除等价分量; 并排列剩下的页面。

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. 发明授权

US07308445B2 Method for estimating coverage of web search engines 有权
标题翻译：估计网页搜索引擎覆盖率的方法
公开(公告)号：US07308445B2
公开(公告)日：2007-12-11
申请号：US10761800
申请日：2004-01-21
申请人： Krishna Asur Bharat , Andrei Zary Broder
发明人： Krishna Asur Bharat , Andrei Zary Broder
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A computerized method is used to estimate the relative coverage of Web search engines. Each search engine maintains an index of words of pages located at specific URL addresses in a network. The method generates a random query. The random query is a logical combination of words found in a subset of the pages. The random query is submitted to a first search engine. In response a set of URLs of pages matching the query are received. Each URL identifies a page indexed by the first search engine that satisfies the random query. A particular URL identifying a sample page is randomly selected. A strong query corresponding to the sample page is generated, and the strong query is submitted to a second search engine. Result information received in response to the strong query is compared to determine if the second search engine has indexed the sample page, or a page substantially similar to the sample page. This procedure is repeated to gather statistical data which is used to estimate the relative sizes and amount of overlap of search engines.
摘要翻译：使用计算机化方法来估计Web搜索引擎的相对覆盖率。每个搜索引擎维护位于网络中特定URL地址处的页面的词的索引。该方法生成随机查询。随机查询是在页面的子集中找到的单词的逻辑组合。随机查询被提交给第一个搜索引擎。作为响应，接收到与查询匹配的页面的一组URL。每个URL标识由第一搜索引擎索引的满足随机查询的页面。随机选择标识样本页面的特定URL。生成与样本页面对应的强烈查询，并将强查询提交给第二个搜索引擎。比较响应于强查询而接收的结果信息，以确定第二搜索引擎是否已对样本页进行索引，或者与样本页基本相似的页面。重复该过程以收集用于估计搜索引擎的相对大小和重叠量的统计数据。

6. 发明授权

US06577735B1 System and method for backing-up data stored on a portable audio player 失效
标题翻译：用于备份存储在便携式音频播放器上的数据的系统和方法
公开(公告)号：US06577735B1
公开(公告)日：2003-06-10
申请号：US09327998
申请日：1999-06-08
申请人： Krishna Asur Bharat
发明人： Krishna Asur Bharat
IPC分类号： G06F1130
CPC分类号： G11B27/034 , G11B20/0021 , G11B27/11 , G11B2220/213 , G11B2220/2545 , G11B2220/61
摘要： A system creates an encrypted backup copy of the compressed audio data downloaded onto a portable audio player. When a user loads a portable audio player with audio data from a CD inserted into a computer's CD-ROM drive, the system creates an encrypted copy of the compressed audio data and stores the encrypted copy on the computer's hard disk. The encrypted copy cannot be used without a cryptographic key, but the system discards the cryptographic key once the encrypted copy of the audio data is stored. To extract usable audio data from the encrypted backup copy, it is necessary to re-insert the original CD and regenerate the cryptographic key. Once the cryptographic key is regenerated, the encrypted audio data can be decrypted and re-loaded onto the portable audio player.
摘要翻译：系统创建被压缩的音频数据的加密备份副本下载到便携式音频播放器上。当用户从插入到计算机的CD-ROM驱动器中的CD加载具有音频数据的便携式音频播放器时，系统创建压缩音频数据的加密副本并将加密的副本存储在计算机的硬盘上。加密副本不能在没有加密密钥的情况下使用，但是一旦存储了音频数据的加密副本，系统将丢弃加密密钥。要从加密的备份副本中提取可用的音频数据，需要重新插入原始CD并重新生成加密密钥。一旦加密密钥被重新生成，加密的音频数据就可被解密并重新加载到便携式音频播放器上。

7. 发明授权

US06411952B1 Method for learning character patterns to interactively control the scope of a web crawler 失效
标题翻译：用于学习字符模式以交互地控制网络爬虫的范围的方法
公开(公告)号：US06411952B1
公开(公告)日：2002-06-25
申请号：US09103904
申请日：1998-06-24
申请人： Krishna Asur Bharat , Robert Chisolm Miller
发明人： Krishna Asur Bharat , Robert Chisolm Miller
IPC分类号： G06F1730
CPC分类号： G06F17/30864 , Y10S707/99935
摘要： A method controls a Web search for server computer resources by an end-user Web crawler. Each resource, such as a Web page, is located by a resource address specified as a character string. The end-user defines a scope for an initial Web search by settings. The settings are used to search the Web for resources limited by the scope. The set of resources located during the search are rendered on output device, and positive and negative examples are selected from the set of resources to infer a rule. The rule is displayed, as well as a subset of resources that match on the rule. The selecting, inferring, and rendering steps are repeated while searching until a final rule is obtained. The rule matches resources that the crawler should process and does not match resource that it should avoid.
摘要翻译：一种方法控制由最终用户Web爬网程序对服务器计算机资源的Web搜索。每个资源（如Web页面）由指定为字符串的资源地址定位。最终用户通过设置定义初始Web搜索的范围。这些设置用于在Web上搜索受范围限制的资源。在搜索期间设置的资源集合在输出设备上呈现，并且从资源集中选择正和负的示例来推断规则。显示规则，以及与规则匹配的资源的一部分。在搜索期间重复选择，推断和呈现步骤，直到获得最终规则。该规则匹配爬网程序应该处理的资源，并且不符合应避免的资源。

8. 发明授权

US06711568B1 Method for estimating coverage of web search engines 有权
标题翻译：估计网页搜索引擎覆盖率的方法
公开(公告)号：US06711568B1
公开(公告)日：2004-03-23
申请号：US09709003
申请日：2000-11-08
申请人： Krishna Asur Bharat , Andrei Zary Broder
发明人： Krishna Asur Bharat , Andrei Zary Broder
IPC分类号： G06F1730
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A computerized method is used to estimate the relative coverage of Web search engines. Each search engine maintains an index of words of pages located at specific URL addresses in a network. The method generates a random query. The random query is a logical combination of words found in a subset of the pages. The random query is submitted to a first search engine. In response a set of URLs of pages matching the query are received. Each URL identifies a page indexed by the first search engine that satisfies the random query. A particular URL identifying a sample page is randomly selected. A strong query corresponding to the sample page is generated, and the strong query is submitted to a second search engine. Result information received in response to the strong query is compared to determine if the second search engine has indexed the sample page, or a page substantially similar to the sample page. This procedure is repeated to gather statistical data which is used to estimate the relative sizes and amount of overlap of search engines.
摘要翻译：使用计算机化方法来估计Web搜索引擎的相对覆盖率。每个搜索引擎维护位于网络中特定URL地址处的页面的词的索引。该方法生成随机查询。随机查询是在页面的子集中找到的单词的逻辑组合。随机查询被提交给第一个搜索引擎。作为响应，接收到与查询匹配的页面的一组URL。每个URL标识由第一搜索引擎索引的满足随机查询的页面。随机选择标识样本页面的特定URL。生成与样本页面对应的强烈查询，并将强查询提交给第二个搜索引擎。比较响应于强查询而接收的结果信息，以确定第二搜索引擎是否已对样本页进行索引，或者与样本页基本相似的页面。重复该过程以收集用于估计搜索引擎的相对大小和重叠量的统计数据。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式