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

1. 发明授权

US08099417B2 Semi-supervised part-of-speech tagging 有权
标题翻译：半监督的词性标签
公开(公告)号：US08099417B2
公开(公告)日：2012-01-17
申请号：US11954216
申请日：2007-12-12
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.
摘要翻译：给定查询的相关搜索结果可以使用查询的点击数据和查询发布到搜索引擎的次数来确定。结果为给定查询获得的点击次数可以向搜索引擎提供关于给定查询的结果的相关性的反馈机制。查询的频率以及相关的点击次数为搜索引擎提供了生成相关结果时查询的有效性。可以根据点击数据和提供给用户的搜索结果的效率来加权查询与结果图表中的边。

2. 发明申请

US20090157643A1 SEMI-SUPERVISED PART-OF-SPEECH TAGGING 有权
标题翻译：半监督的部分话题标签
公开(公告)号：US20090157643A1
公开(公告)日：2009-06-18
申请号：US11954216
申请日：2007-12-12
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.
摘要翻译：给定查询的相关搜索结果可以使用查询的点击数据和查询发布到搜索引擎的次数来确定。结果为给定查询获得的点击次数可以向搜索引擎提供关于给定查询的结果的相关性的反馈机制。查询的频率以及相关的点击次数为搜索引擎提供了生成相关结果时查询的有效性。可以根据点击数据和提供给用户的搜索结果的效率来加权查询与结果图表中的边。

3. 发明申请

US20110258033A1 EFFECTIVE AD PLACEMENT 审中-公开
标题翻译：有效的放置
公开(公告)号：US20110258033A1
公开(公告)日：2011-10-20
申请号：US12760572
申请日：2010-04-15
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06Q30/00 , G06F17/30
CPC分类号： G06Q30/0244 , G06F16/972 , G06Q30/02 , G06Q30/0243
摘要： Search results and ads that satisfy a query may be formatted into a search results page where an initial placement of ads may result in an estimated click through rate for the presented ads. An adjustment factor may be determined based on parameters associated with the search results, such as the clicks on the search results themselves. The adjustment factor may be applied to a particular ad to determine if an estimated click through rate of the particular ad will change with respect to a position when there are a first number of mainline ads and a second number of side bar ads. Mainline exclusivity may be appropriate for an ad to increase the click through rate of the ad. The increase may be determined in accordance with the adjustment factor to decide whether to present the ad with mainline exclusivity.
摘要翻译：满足查询的搜索结果和广告可能格式化为搜索结果页面，其中初始展示位置可能会导致展示广告的估算点击率。可以基于与搜索结果相关联的参数（例如搜索结果本身的点击）来确定调整因子。调整因子可以应用于特定广告，以确定当存在第一数量的主线广告和第二数量的边栏广告时，特定广告的估计点击率是否相对于该位置而改变。主线排他性可能适合于增加广告点击率的广告。该增加可以根据调整因素来确定是否呈现具有主线排他性的广告。

4. 发明申请

US20110202846A1 ESTIMATING SHORTEST DISTANCES IN GRAPHS 有权
标题翻译：评估格局中的最短距离
公开(公告)号：US20110202846A1
公开(公告)日：2011-08-18
申请号：US12705630
申请日：2010-02-15
申请人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F15/16 , G06F3/048
CPC分类号： G06N5/04 , G01C21/3446
摘要： Sketches are generated for each node in a graph. For undirected graphs, each sketch for a node may include an indicator of a node from a seed set of nodes and the shortest distance between the node and the indicated node. When a request is received for the shortest distance between two nodes of the graph, the sketches for each of the two nodes are retrieved, and nodes that are indicated in both of the sketches are determined. The distances between each of the two nodes and a determined node as indicated in the sketches is summed for each of the determined nodes, and the sum having the least distance is selected as the estimated shortest distance between the two nodes.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

5. 发明申请

US20100281022A1 ESTIMATING RANK ON GRAPH STREAMS 有权
标题翻译：估计图表的排名
公开(公告)号：US20100281022A1
公开(公告)日：2010-11-04
申请号：US12434691
申请日：2009-05-04
申请人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/30 , G06N5/04
CPC分类号： G06F17/30958
摘要： The rank of nodes in a graph may be inferred from a calculated probability that each node in the graph appears in a single random walk of the graph. Short random walks may be generated for each node in the graph. The generated random walks may be combined to form a longer single random walk. Multiple single random walks may be generated in this fashion. The probability of each node appearing in a single random may be calculated from the generated single random walks. The rank of each node may then be inferred from the calculated probabilities.
摘要翻译：图中节点的等级可以从图中的每个节点出现在图的单个随机游走中的计算概率推断。可以为图中的每个节点生成短随机散步。所产生的随机散步可以组合以形成更长的单次随机游走。可以以这种方式产生多个单个随机散步。可以从生成的单个随机游走中计算每个节点出现在单个随机中的概率。然后可以从计算的概率推断每个节点的等级。

6. 发明授权

US07765204B2 Method of finding candidate sub-queries from longer queries 失效
标题翻译：从较长查询中查找候选子查询的方法
公开(公告)号：US07765204B2
公开(公告)日：2010-07-27
申请号：US11863045
申请日：2007-09-27
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F17/30693 , G06F17/30457
摘要： A method is disclosed for identifying queries stored in a log which are semantically related to an input query that may include a large number of terms. A set of one or more subsequences are generated for each query stored in the log, and these sets of subsequences are stored in a lookup table. A set of one or more subsequences are also generated for the input query. The subsequences in the lookup table and of the input query are generated by hashing of the respective query terms to a value between 0 and 1 using a known technique of min-hashing. The present system then constructs the subsequences of the query using the k-min hashes of the query, where k is an integer based on the number of terms in the query.
摘要翻译：公开了一种用于识别存储在日志中的查询与可能包括大量项目的输入查询语义相关的查询的方法。为存储在日志中的每个查询生成一组或多个子序列，并将这些子序列存储在查找表中。还为输入查询生成一组或多个子序列。查询表和输入查询中的子序列通过使用最小哈希算法的已知技术将相应的查询项散列为0到1之间的值来生成。本系统然后使用查询的k-min哈希构建查询的子序列，其中k是基于查询中的项数的整数。

7. 发明申请

US20090234734A1 BIDDING ON RELATED KEYWORDS 审中-公开
标题翻译：投标相关关键字
公开(公告)号：US20090234734A1
公开(公告)日：2009-09-17
申请号：US12049384
申请日：2008-03-17
申请人： Sreenivas Gollapudi , Frank McSherry , Rina Panigrahy , Kunal Talwar
发明人： Sreenivas Gollapudi , Frank McSherry , Rina Panigrahy , Kunal Talwar
IPC分类号： G06Q30/00 , G06F7/06
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0256
摘要： Advertising slots on a search engine results page may be determined based on keywords and/or results to a user query. Advertisers may use the keywords and/or the results to the query to place their ads into the advertising slots. Rules may be applied to determine how ads are displayed or not displayed. For example, a larger set of keywords may be inferred from the initial set of keywords on which the ad provider placed her bids. This greatly increases the potential reach of an advertiser's ad campaign or a search engine provider's revenue from ad placement.
摘要翻译：搜索引擎结果页面上的广告位可以基于用户查询的关键字和/或结果来确定。广告商可以使用查询的关键字和/或结果将广告投放到广告位。可以应用规则来确定广告的显示方式或不显示。例如，可以从广告提供商将其出价的关键字的初始集合推断出一组较大的关键字。这大大增加了广告客户广告系列或搜索引擎提供商的广告展示位置的收入潜力。

8. 发明申请

US20090234829A1 LINK BASED RANKING OF SEARCH RESULTS USING SUMMARIES OF RESULT NEIGHBORHOODS 审中-公开
标题翻译：基于链接的搜索结果排序使用结果相邻的概要
公开(公告)号：US20090234829A1
公开(公告)日：2009-09-17
申请号：US12045716
申请日：2008-03-11
申请人： Sreenivas Gollapudi , Marc A. Najork , Rina Panigrahy
发明人： Sreenivas Gollapudi , Marc A. Najork , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F16/951
摘要： A summary of the neighborhood of a page may be determined offline and used at query time to approximate the neighborhood graph of the result set and to compute scores using the approximate neighborhood graph. The summary of the neighborhood graph may include a Bloom filter containing a limited size subset of ancestors or descendants of the page. A web page identifier may also be included in the summary. Consistent sampling is used, where a consistent unbiased sample of a number of elements from the set is determined. At query time, given a result set, the summaries for all the results may be used to create a cover set. An approximate neighborhood graph consisting of the vertices in the cover set is created. Ranking technique scores may be determined based on the approximate neighborhood graph.
摘要翻译：可以离线确定页面邻域的摘要，并在查询时使用，以近似结果集的邻域图，并使用近似邻域图计算得分。邻域图的摘要可以包括包含页面的祖先或后代的有限大小子集的布隆过滤器。摘要中也可以包括网页标识符。使用一致的采样，其中确定来自集合的多个元素的一致的无偏样本。在查询时，给定结果集，可以使用所有结果的摘要来创建一个封面。创建由封面集合中的顶点组成的近似邻域图。排名技术得分可以基于近似邻域图来确定。

9. 发明申请

US20090089266A1 METHOD OF FINDING CANDIDATE SUB-QUERIES FROM LONGER QUERIES 失效
标题翻译：从长期查询中查找候选子问题的方法
公开(公告)号：US20090089266A1
公开(公告)日：2009-04-02
申请号：US11863045
申请日：2007-09-27
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F17/30693 , G06F17/30457
摘要： A method is disclosed for identifying queries stored in a log which are semantically related to an input query that may include a large number of terms. A set of one or more subsequences are generated for each query stored in the log, and these sets of subsequences are stored in a lookup table. A set of one or more subsequences are also generated for the input query. The subsequences in the lookup table and of the input query are generated by hashing of the respective query terms to a value between 0 and 1 using a known technique of min-hashing. The present system then constructs the subsequences of the query using the k-min hashes of the query, where k is an integer based on the number of terms in the query.
摘要翻译：公开了一种用于识别存储在日志中的查询与可能包括大量项目的输入查询语义相关的查询的方法。为存储在日志中的每个查询生成一组或多个子序列，并将这些子序列存储在查找表中。还为输入查询生成一组或多个子序列。查询表和输入查询中的子序列通过使用最小哈希算法的已知技术将相应的查询项散列为0到1之间的值来生成。本系统然后使用查询的k-min哈希构建查询的子序列，其中k是基于查询中的项数的整数。

10. 发明授权

US08666920B2 Estimating shortest distances in graphs using sketches 有权
标题翻译：使用草图估计图中的最短距离
公开(公告)号：US08666920B2
公开(公告)日：2014-03-04
申请号：US12705630
申请日：2010-02-15
申请人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
发明人： Marc A. Najork , Sreenivas Gollapudi , Rina Panigrahy , Atish Das Sarma
IPC分类号： G06F17/00 , G06N5/04
CPC分类号： G06N5/04 , G01C21/3446
摘要： Sketches are generated for each node in a graph. For undirected graphs, each sketch for a node may include an indicator of a node from a seed set of nodes and the shortest distance between the node and the indicated node. When a request is received for the shortest distance between two nodes of the graph, the sketches for each of the two nodes are retrieved, and nodes that are indicated in both of the sketches are determined. The distances between each of the two nodes and a determined node as indicated in the sketches is summed for each of the determined nodes, and the sum having the least distance is selected as the estimated shortest distance between the two nodes.
摘要翻译：为图中的每个节点生成草图。对于无向图，节点的每个草图可以包括来自节点的种子集合的节点的指示符以及节点和指示节点之间的最短距离。当接收到图形的两个节点之间的最短距离的请求时，检索两个节点中的每个节点的草图，并且确定在两个草图中指示的节点。两个节点中的每一个之间的距离和如草图中所示的确定的节点之间的距离对于每个确定的节点相加，并且具有最小距离的和被选择为两个节点之间的估计的最短距离。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式