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

1. 发明授权

US09424342B1 Geographically local query detection 有权
标题翻译：地理位置查询检测
公开(公告)号：US09424342B1
公开(公告)日：2016-08-23
申请号：US12708583
申请日：2010-02-19
申请人： Deepak Ravichandran , Dandapani Sivakumar , Rohan Seth , Shumeet Baluja
发明人： Deepak Ravichandran , Dandapani Sivakumar , Rohan Seth , Shumeet Baluja
IPC分类号： G06F17/30
CPC分类号： G06F17/30637 , G06F17/3087
摘要： Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for detecting local search queries. In one aspect, a method includes accessing a search query log that includes data specifying search queries corresponding to particular geographic regions and for at least one of the search queries corresponding to the particular geographic region generating a geo-query count that represents a total number of times that the search query was received over a specified period. The geo-query count is compared to a corresponding expected query count for the search query, where the expected query count is a baseline number of times that the query is expected to be received. In response to determining that the search query has a geo-query count that exceeds the corresponding expected query count by at least a threshold amount, the particular query is classified as a local query for the particular geographic region.
摘要翻译：方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于检测本地搜索查询。一方面，一种方法包括访问包括指定与特定地理区域相对应的搜索查询的数据的搜索查询日志，以及对应于特定地理区域的搜索查询中的至少一个生成地理查询计数，所述地理查询计数表示总数在指定时间段内收到搜索查询的时间。将地理查询计数与搜索查询的相应预期查询计数进行比较，其中预期查询计数是希望接收查询的基准次数。响应于确定搜索查询具有超过相应的预期查询计数至少阈值量的地理查询计数，特定查询被分类为特定地理区域的本地查询。

2. 发明授权

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的路径。输出至少一个线程。

3. 发明申请

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).
摘要翻译：本发明提出了一种搜索计算机化网络（例如因特网）的方法和服务，其首先基于用户查询执行搜索以产生排名的结果。结果包括引用实体（网络上的地址，如网站）。在将结果报告给用户之前，本发明提供了搜索实体与搜索结果中列出的实体联系，以确定与结果中列出的其他实体相比，搜索结果中列出的实体是否希望改变其排名。如果一些实体希望改变他们的等级，那么这个发明会向降低排名的实体增加其排名和信用（支付费用）的实体收取费用。向提高其等级的实体收取的金额的一部分可以支付给执行搜索的实体（有助于支持高质量的搜索引擎），并且一部分将转到在搜索结果中自愿降低排名的实体（帮助支持高端网站）。

4. 发明授权

US08572096B1 Selecting keywords using co-visitation information 有权
标题翻译：使用共同访问信息选择关键字
公开(公告)号：US08572096B1
公开(公告)日：2013-10-29
申请号：US13297544
申请日：2011-11-16
申请人： Rohan Seth , Shumeet Baluja , Dandapani Sivakumar , Deepak Ravichandran
发明人： Rohan Seth , Shumeet Baluja , Dandapani Sivakumar , Deepak Ravichandran
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06Q10/10
摘要： Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting keywords for resources. In one aspect, a method includes identifying a particular online resource that includes non-text content. Co-visitation data are obtained for the particular resource. The co-visitation data specify one or more co-requested online resources for the particular online resource. Each of the co-requested online resources were requested by a user device within a threshold period of the request for the particular online resource by the user device. Keywords are identified for each of the co-requested online resources, and can include keywords that were selected based on text content of the co-requested online resource. One or more of the identified keywords are selected as keywords for the particular resource.
摘要翻译：方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于选择资源的关键字。一方面，一种方法包括识别包括非文本内容的特定在线资源。获取特定资源的共访问数据。共同访问数据指定特定在线资源的一个或多个共同请求的在线资源。在用户设备对特定在线资源的请求的阈值期间内，由用户设备请求每个共同请求的在线资源。针对每个共同请求的在线资源标识关键字，并且可以包括基于共同请求的在线资源的文本内容而选择的关键字。选择一个或多个所识别的关键词作为特定资源的关键字。

5. 发明授权

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).
摘要翻译：用于搜索诸如因特网的计算机化网络的方法和服务，其首先基于用户查询执行搜索以产生被排序的结果。结果包括引用实体（网络上的地址，如网站）。在将结果报告给用户之前，本发明提供了搜索实体与搜索结果中列出的实体联系，以确定与结果中列出的其他实体相比，搜索结果中列出的实体是否希望改变其排名。如果一些实体希望改变他们的等级，那么这个发明会向降低排名的实体增加其排名和信用（支付费用）的实体收取费用。向提高其等级的实体收取的金额的一部分可以支付给执行搜索的实体（有助于支持高质量的搜索引擎），并且一部分将转到在搜索结果中自愿降低排名的实体（帮助支持高端网站）。

6. 发明申请

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的路径。输出至少一个线程。

7. 发明授权

US07257577B2 System, method and service for ranking search results using a modular scoring system 有权
标题翻译：使用模块化评分系统对搜索结果进行排名的系统，方法和服务
公开(公告)号：US07257577B2
公开(公告)日：2007-08-14
申请号：US10841391
申请日：2004-05-07
申请人： Ronald Fagin , Kevin Snow McCurley , Jasmine Novak , Shanmugasundram Ravikumar , Dandapani Sivakumar , John Anthony Tomlin , David Paul Williamson
发明人： Ronald Fagin , Kevin Snow McCurley , Jasmine Novak , Shanmugasundram Ravikumar , Dandapani Sivakumar , John Anthony Tomlin , David Paul Williamson
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99945
摘要： A modular scoring system using rank aggregation merges search results into an ordered list of results using many different features of documents. The ranking functions of the present system can easily be customized to the needs of a particular corpus or collection of users such as an intranet. Rank aggregation is independent of the underlying score distributions between the different factors, and can be applied to merge any set of ranking functions. Rank aggregation holds the advantage of combining the influence of many different heuristic factors in a robust way to produce high-quality results for queries. The modular scoring system combines factors such as indegree, page ranking, URL length, proximity to the root server of an intranet, etc, to form a single ordering on web pages that closely obeys the individual orderings, but also mediates between the collective wisdom of individual heuristics.
摘要翻译：使用秩聚合的模块评分系统将搜索结果合并到使用许多不同文档特征的结果的有序列表中。本系统的排名功能可以根据特定语料库或诸如内部网的用户集合的需要进行定制。排名聚合独立于不同因素之间的底层分数分布，可以应用于合并任何一组排名函数。排名聚合具有将许多不同启发式因素的影响结合在一起的优势，可以为查询产生高质量的结果。模块化评分系统结合诸如不分级，页面排序，URL长度，与内部网的根服务器的接近度等因素，在严格遵循单个排序的网页上形成单一排序，而且还在集体智慧之间进行调解个人启发式

8. 发明申请

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.

9. 发明授权

US08145679B1 Video-related recommendations using link structure 有权
公开(公告)号：US08145679B1
公开(公告)日：2012-03-27
申请号：US12966747
申请日：2010-12-13
申请人： Shumeet Baluja , Yushi Jing , Dandapani Sivakumar , Jay Yagnik
发明人： Shumeet Baluja , Yushi Jing , Dandapani Sivakumar , Jay Yagnik
IPC分类号： G06F17/30
CPC分类号： G06F17/30035 , G06F17/30828 , G06Q30/02 , Y10S707/99942 , Y10S707/99945
摘要： The subject matter of this specification can be embodied in, among other things, a method that includes inferring labels for videos, users, advertisements, groups of users, and other entities included in a social network system. The inferred labels can be used to generate recommendations such as videos or advertisements in which a user may be interested. Inferred labels can be generated based on social or other relationships derived from, for example, profiles or activities of social network users. Inferred labels can be advantageous when explicit information about these entities is not available. For example, a particular user may not have clicked on any online advertisements, so the user is not explicitly linked to any advertisements.

10. 发明授权

US08055664B2 Inferring user interests 有权
标题翻译：推荐用户兴趣
公开(公告)号：US08055664B2
公开(公告)日：2011-11-08
申请号：US11742995
申请日：2007-05-01
申请人： Shumeet Baluja , Yushi Jing , Dandapani Sivakumar , Jay Yagnik
发明人： Shumeet Baluja , Yushi Jing , Dandapani Sivakumar , Jay Yagnik
IPC分类号： G06F17/30 , G06Q30/00
CPC分类号： G06N5/02 , G06N99/005 , G06Q30/0274
摘要： The subject matter of this specification can be embodied in, among other things, a method that includes determining, for a portion of users of a social network, label values each comprising an inferred interest level of a user in a subject indicated by a label, associating a first user with one or more second users based on one or more relationships specified by the first user, and outputting a first label value for the first user based on one or more second label values of the one or more second users.
摘要翻译：本说明书的主题可以包括一种方法，其包括为社交网络的用户的一部分确定每个包括由标签指示的对象中的用户的推定的兴趣级别的标签值，基于由第一用户指定的一个或多个关系将第一用户与一个或多个第二用户相关联，并且基于一个或多个第二用户的一个或多个第二标签值输出第一用户的第一标签值。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式