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

1. 发明授权

US07519613B2 Method and system for generating threads of documents 失效
标题翻译：用于生成文档线程的方法和系统
公开(公告)号：US07519613B2
公开(公告)日：2009-04-14
申请号：US11364038
申请日：2006-02-28
申请人： Ramanathan Vaidhyanath Guha , Shanmugasundaram Ravikumar , Dandapani Sivakumar
发明人： Ramanathan Vaidhyanath Guha , Shanmugasundaram Ravikumar , Dandapani Sivakumar
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30958 , G06F17/30716 , Y10S707/99937 , Y10S707/99943
摘要： A method and system for generating threads of documents from a collection C of documents containing terms. Each document of C has a timestamp and an associated timestamp index. The timestamp indexes are ordered in accordance with an ordering of the associated timestamps. A relevance graph G generated from C is an acyclic directed graph. Each node of G denotes a document of C. Each edge of G connects a pair of directed nodes pointing from a node having an earlier timestamp to a node having a later timestamp. At least one thread of G is determined by executing a matching-based algorithm or a dynamic programming algorithm. Each thread is a path through G originating at a first node and terminating at a second node and including one or more contiguous edges from the first node to the second node. The at least one thread is outputted.
摘要翻译：一种用于从包含术语的文档的集合C生成文档的线程的方法和系统。 C的每个文档都具有时间戳和关联的时间戳索引。时间戳索引根据相关联的时间戳的顺序进行排序。从C生成的相关性图G是非循环有向图。 G的每个节点表示C的文档.G的每个边缘将指向具有较早时间戳的节点的一对定向节点连接到具有稍后时间戳的节点。通过执行基于匹配的算法或动态规划算法来确定G的至少一个线程。每个线程是通过起始于第一节点并且终止于第二节点并且包括从第一节点到第二节点的一个或多个相邻边缘的G的路径。输出至少一个线程。

2. 发明申请

US20080306942A1 On the Role of Market Economics in Ranking Search Results 有权
标题翻译：关于市场经济学在排名搜索结果中的作用
公开(公告)号：US20080306942A1
公开(公告)日：2008-12-11
申请号：US12193819
申请日：2008-08-19
申请人： Shanmugasundaram Ravikumar , Daniel M. Shiffman , Dandapani Sivakumar
发明人： Shanmugasundaram Ravikumar , Daniel M. Shiffman , Dandapani Sivakumar
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30864 , G06F17/30696 , G06Q20/102 , G06Q40/04 , Y10S707/99935
摘要： The invention presents a method of and service for searching computerized networks, such as the internet, that first performs a search based on a user query to produce results that are ranked. The results comprise references to entities (addresses on the network, such as web sites). Before reporting the results to the user, the invention provides that the search entity contacts the entities listed in the search results to determine whether entities listed in the search results desire to change their rank when compared to other entities listed in the results. If some entities do desire to change their rank, the invention charges fees to entities that increase their rank and credits (pays fees) to entities that decrease their rank. A portion of the amount charged to entities that increase their rank can be paid to the entity performing the search (helping to support the high quality search engines), and a portion will go to the entities that voluntarily decrease their rank within the search results (helping to support high-content web sites).
摘要翻译：本发明提出了一种搜索计算机化网络（例如因特网）的方法和服务，其首先基于用户查询执行搜索以产生排名的结果。结果包括引用实体（网络上的地址，如网站）。在将结果报告给用户之前，本发明提供了搜索实体与搜索结果中列出的实体联系，以确定与结果中列出的其他实体相比，搜索结果中列出的实体是否希望改变其排名。如果一些实体希望改变他们的等级，那么这个发明会向降低排名的实体增加其排名和信用（支付费用）的实体收取费用。向提高其等级的实体收取的金额的一部分可以支付给执行搜索的实体（有助于支持高质量的搜索引擎），并且一部分将转到在搜索结果中自愿降低排名的实体（帮助支持高端网站）。

3. 发明授权

US08005824B2 On the role of market economics in ranking search results 有权
标题翻译：关于市场经济学在排名搜索结果中的作用
公开(公告)号：US08005824B2
公开(公告)日：2011-08-23
申请号：US12193819
申请日：2008-08-19
申请人： Shanmugasundaram Ravikumar , Daniel M. Shiffman , Dandapani Sivakumar
发明人： Shanmugasundaram Ravikumar , Daniel M. Shiffman , Dandapani Sivakumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/30696 , G06Q20/102 , G06Q40/04 , Y10S707/99935
摘要： A method of and service for searching computerized networks, such as the internet, that first performs a search based on a user query to produce results that are ranked. The results comprise references to entities (addresses on the network, such as web sites). Before reporting the results to the user, the invention provides that the search entity contacts the entities listed in the search results to determine whether entities listed in the search results desire to change their rank when compared to other entities listed in the results. If some entities do desire to change their rank, the invention charges fees to entities that increase their rank and credits (pays fees) to entities that decrease their rank. A portion of the amount charged to entities that increase their rank can be paid to the entity performing the search (helping to support the high quality search engines), and a portion will go to the entities that voluntarily decrease their rank within the search results (helping to support high-content web sites).
摘要翻译：用于搜索诸如因特网的计算机化网络的方法和服务，其首先基于用户查询执行搜索以产生被排序的结果。结果包括引用实体（网络上的地址，如网站）。在将结果报告给用户之前，本发明提供了搜索实体与搜索结果中列出的实体联系，以确定与结果中列出的其他实体相比，搜索结果中列出的实体是否希望改变其排名。如果一些实体希望改变他们的等级，那么这个发明会向降低排名的实体增加其排名和信用（支付费用）的实体收取费用。向提高其等级的实体收取的金额的一部分可以支付给执行搜索的实体（有助于支持高质量的搜索引擎），并且一部分将转到在搜索结果中自愿降低排名的实体（帮助支持高端网站）。

4. 发明申请

US20070203924A1 Method and system for generating threads of documents 失效
标题翻译：用于生成文档线程的方法和系统
公开(公告)号：US20070203924A1
公开(公告)日：2007-08-30
申请号：US11364038
申请日：2006-02-28
申请人： Ramanathan Guha , Shanmugasundaram Ravikumar , Dandapani Sivakumar
发明人： Ramanathan Guha , Shanmugasundaram Ravikumar , Dandapani Sivakumar
IPC分类号： G06F7/00
CPC分类号： G06F17/30958 , G06F17/30716 , Y10S707/99937 , Y10S707/99943
摘要： A method and system for generating threads of documents from a collection C of documents containing terms. Each document of C has a timestamp and an associated timestamp index. The timestamp indexes are ordered in accordance with an ordering of the associated timestamps. A relevance graph G generated from C is an acyclic directed graph. Each node of G denotes a document of C. Each edge of G connects a pair of directed nodes pointing from a node having an earlier timestamp to a node having a later timestamp. At least one thread of G is determined by executing a matching-based algorithm or a dynamic programming algorithm. Each thread is a path through G originating at a first node and terminating at a second node and including one or more contiguous edges from the first node to the second node. The at least one thread is outputted.
摘要翻译：一种用于从包含术语的文档的集合C生成文档的线程的方法和系统。 C的每个文档都具有时间戳和关联的时间戳索引。时间戳索引根据相关联的时间戳的顺序进行排序。从C生成的相关性图G是非循环有向图。 G的每个节点表示C的文档.G的每个边缘将指向具有较早时间戳的节点的一对定向节点连接到具有稍后时间戳的节点。通过执行基于匹配的算法或动态规划算法来确定G的至少一个线程。每个线程是通过起始于第一节点并且终止于第二节点并且包括从第一节点到第二节点的一个或多个相邻边缘的G的路径。输出至少一个线程。

5. 发明申请

US20060282411A1 System and method for performing a high-level multi-dimensional query on a multi-structural database 失效
公开(公告)号：US20060282411A1
公开(公告)日：2006-12-14
申请号：US11151056
申请日：2005-06-13
申请人： Ronald Fagin , Ramanathan Guha , Phokion Kolaitis , Jasmine Novak , Shanmugasundaram Ravikumar , Dandapani Sivakumar , Andrew Tomkins
发明人： Ronald Fagin , Ramanathan Guha , Phokion Kolaitis , Jasmine Novak , Shanmugasundaram Ravikumar , Dandapani Sivakumar , Andrew Tomkins
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , Y10S707/99933
摘要： A multi-structural query system performs a high-level multi-dimensional query on a multi-structural database. The query system enables a user to navigate a search by adding restrictions incrementally. The query system uses a schema to discover structure in a multi-structural database. The query system leaves a choice of nodes to return in response to a query as a constrained set of choices available to the algorithm. The query system further casts the selection of a set of nodes as an optimization. The query system uses pairwise-disjoint collections to capture a concise set of highlights of a data set within the allowed schema. The query system further comprises efficient algorithms that yield approximately optimal solutions for several classes of objective functions.

6. 发明授权

US07519586B2 Method of searching 有权
标题翻译：搜索方法
公开(公告)号：US07519586B2
公开(公告)日：2009-04-14
申请号：US10835989
申请日：2004-04-30
申请人： Shanmugasundaram Ravikumar , Daniel M. Shiffman , Dandapani Sivakumar
发明人： Shanmugasundaram Ravikumar , Daniel M. Shiffman , Dandapani Sivakumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/30696 , G06Q20/102 , G06Q40/04 , Y10S707/99935
摘要： A method of searching that comprises receiving a user query from a user. After receiving the user query, the method performs a search based on the user query to produce results that are ranked. The results comprise references to entities. The method contacts the entities to determine whether entities in the results desire to change their rank in the results, and charges entities that increase their rank. After charging the entities and changing rankings of the results, the method reports the results with changed rankings to the user, and credits entities that decrease their rank.
摘要翻译：一种搜索方法，包括从用户接收用户查询。在接收到用户查询之后，该方法基于用户查询执行搜索以产生排名的结果。结果包括对实体的引用。该方法与实体联系，以确定结果中的实体是否希望在结果中更改其排名，并对增加其排名的实体进行收费。在对实体收取费用并更改结果排名后，该方法会将用户的排名更改结果和降低排名的积分实体进行报告。

7. 发明授权

US07188106B2 System and method for aggregating ranking results from various sources to improve the results of web searching 有权
标题翻译：用于聚合来自各种来源的排名结果的系统和方法，以改进网络搜索的结果
公开(公告)号：US07188106B2
公开(公告)日：2007-03-06
申请号：US10136911
申请日：2002-04-30
申请人： Cynthia Dwork , Simeon Naor , Shanmugasundaram Ravikumar , Dandapani Sivakumar
发明人： Cynthia Dwork , Simeon Naor , Shanmugasundaram Ravikumar , Dandapani Sivakumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A system and method for aggregating rankings from a plurality of ranking sources to generate a maximally consistent ranking by minimizing a distance measure. The ranking sources may be search engines executing queries on web pages that have been deliberately modified to cause an incorrect estimate of their relevance. The invention supports combining partial rankings.
摘要翻译：一种用于聚合来自多个排序源的排名以通过最小化距离度量来生成最大一致排名的系统和方法。排名来源可能是搜索引擎在网页上执行查询，这些查询已被故意修改，导致其相关性的错误估计。本发明支持组合部分排名。

8. 发明授权

US07895196B2 Computer system for identifying storylines that emerge from highly ranked web search results 失效
标题翻译：用于识别从高排名网页搜索结果中出现的故事情节的计算机系统
公开(公告)号：US07895196B2
公开(公告)日：2011-02-22
申请号：US10835983
申请日：2004-04-30
申请人： Uma Mahadevan , Shanmugasundaram Ravikumar , Dandapani Sivakumar
发明人： Uma Mahadevan , Shanmugasundaram Ravikumar , Dandapani Sivakumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： This disclosure provides a method of and service for searching for locations (e.g., web sites) on a network (e.g., the internet). The method begins by inputting a query from a user and searching the internet based on the query to produce search results (comprising web sites) in an order of relevance, where more relevant results are ordered ahead of less relevant results. However, rather than directly reporting the search results to the user as conventional search methodologies do, the invention reorganizes the search results into storylines. More specifically, the invention identifies focused vocabularies from the search results, where each focused vocabulary forms a separate storyline. In addition, the invention maximizes the number of search results that are included in each storyline, minimizes the number of search results that are included in multiple storylines; and also minimizes the number of storylines. Then the invention reports the storylines to the user.
摘要翻译：本公开提供了用于搜索网络（例如，互联网）上的位置（例如，网站）的方法和服务。该方法通过从用户输入查询并基于查询搜索互联网，以相关性的顺序产生搜索结果（包括网站），其中在相关结果较少的情况下排序更相关的结果。然而，传统的搜索方法不是将搜索结果直接报告给用户，而是将搜索结果重新组织成故事情节。更具体地，本发明从搜索结果中识别重点词汇，其中每个聚焦词汇形成单独的故事情节。此外，本发明使包含在每个故事情节中的搜索结果的数量最大化，使包含在多个故事情节中的搜索结果的数量最小化; 并最大程度地减少故事情节的数量。然后，本发明向用户报告故事情节。

9. 发明授权

US07519582B2 System and method for performing a high-level multi-dimensional query on a multi-structural database 失效
标题翻译：用于在多结构数据库上执行高级多维查询的系统和方法
公开(公告)号：US07519582B2
公开(公告)日：2009-04-14
申请号：US11151056
申请日：2005-06-13
申请人： Ronald Fagin , Ramanathan V. Guha , Phokion Gerasimos Kolaitis , Jasmine Gina Novak , Shanmugasundaram Ravikumar , Dandapani Sivakumar , Andrew Stephen Tomkins
发明人： Ronald Fagin , Ramanathan V. Guha , Phokion Gerasimos Kolaitis , Jasmine Gina Novak , Shanmugasundaram Ravikumar , Dandapani Sivakumar , Andrew Stephen Tomkins
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , Y10S707/99933
摘要： A multi-structural query system performs a high-level multi-dimensional query on a multi-structural database. The query system enables a user to navigate a search by adding restrictions incrementally. The query system uses a schema to discover structure in a multi-structural database. The query system leaves a choice of nodes to return in response to a query as a constrained set of choices available to the algorithm. The query system further casts the selection of a set of nodes as an optimization. The query system uses pairwise-disjoint collections to capture a concise set of highlights of a data set within the allowed schema. The query system further comprises efficient algorithms that yield approximately optimal solutions for several classes of objective functions.
摘要翻译：多结构查询系统在多结构数据库上执行高级多维查询。查询系统使用户能够逐步添加限制来导航搜索。查询系统使用模式来发现多结构数据库中的结构。查询系统使得响应于查询返回的节点的选择作为算法可用的约束的选择集合。查询系统进一步将一组节点的选择作为优化。查询系统使用成对不相交的集合来捕获允许的模式中数据集的一组精简集。该查询系统还包括对几类目标函数产生近似最优解的有效算法。

10. 发明申请

US20050246322A1 On the role of market economics in ranking search results 有权
标题翻译：关于市场经济学在排名搜索结果中的作用
公开(公告)号：US20050246322A1
公开(公告)日：2005-11-03
申请号：US10835989
申请日：2004-04-30
申请人： Shanmugasundaram Ravikumar , Daniel Shiffman , Dandapani Sivakumar
发明人： Shanmugasundaram Ravikumar , Daniel Shiffman , Dandapani Sivakumar
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864 , G06F17/30696 , G06Q20/102 , G06Q40/04 , Y10S707/99935
摘要： The invention presents a method of and service for searching computerized networks, such as the internet, that first performs a search based on a user query to produce results that are ranked. The results comprise references to entities (addresses on the network, such as web sites). Before reporting the results to the user, the invention provides that the search entity contacts the entities listed in the search results to determine whether entities listed in the search results desire to change their rank when compared to other entities listed in the results. If some entities do desire to change their rank, the invention charges fees to entities that increase their rank and credits (pays fees) to entities that decrease their rank. A portion of the amount charged to entities that increase their rank can be paid to the entity performing the search (helping to support the high quality search engines), and a portion will go to the entities that voluntarily decrease their rank within the search results (helping to support high-content web sites).
摘要翻译：本发明提出了一种搜索计算机化网络（例如因特网）的方法和服务，其首先基于用户查询执行搜索以产生排名的结果。结果包括引用实体（网络上的地址，如网站）。在将结果报告给用户之前，本发明提供了搜索实体与搜索结果中列出的实体联系，以确定与结果中列出的其他实体相比，搜索结果中列出的实体是否希望改变其排名。如果一些实体希望改变他们的等级，那么这个发明会向降低排名的实体增加其排名和信用（支付费用）的实体收取费用。向提高其等级的实体收取的金额的一部分可以支付给执行搜索的实体（有助于支持高质量的搜索引擎），并且一部分将转到在搜索结果中自愿降低排名的实体（帮助支持高端网站）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式