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

1. 发明申请

US20100191758A1 SYSTEM AND METHOD FOR IMPROVED SEARCH RELEVANCE USING PROXIMITY BOOSTING 审中-公开
标题翻译：使用接近推进来改进搜索相关性的系统和方法
公开(公告)号：US20100191758A1
公开(公告)日：2010-07-29
申请号：US12360008
申请日：2009-01-26
申请人： Fuchun Peng , Xing Wei , Yumao Lu , Xin Li , Donald Metzler , Hang Cui , Benoit Dumoulin
发明人： Fuchun Peng , Xing Wei , Yumao Lu , Xin Li , Donald Metzler , Hang Cui , Benoit Dumoulin
IPC分类号： G06F17/30
CPC分类号： G06F16/951 , G06F16/353
摘要： A system and method for improved search relevance using proximity boosting. A query for a web search is received from a user, via a network, wherein the query comprises a plurality of query tokens. One or more concepts are identified in the query wherein each of concepts comprises at least two query tokens. A relative concept strength is determined for each of the identified concepts. The query is then rewritten for submission to a search engine wherein for each of the one or more concepts, a syntax rule associated with the respective relative concept strength of the concept is applied to the query tokens comprising the concept such that the rewritten query represents the one or more concepts whereby the proximity of the one or more concepts in a search result returned by the search engine to the user in response to the rewritten query is boosted.
摘要翻译：一种使用邻近度增强来提高搜索相关性的系统和方法。从用户经由网络接收到针对web搜索的查询，其中所述查询包括多个查询令牌。在查询中识别一个或多个概念，其中每个概念包括至少两个查询令牌。确定每个识别的概念的相对概念强度。然后，该查询被重写以提交给搜索引擎，其中对于一个或多个概念中的每一个，与概念的相应相对概念强度相关联的语法规则被应用于包括概念的查询令牌，使得重写的查询表示提高了一个或多个概念，由此响应于重写的查询，搜索引擎向用户返回的搜索结果中的一个或多个概念的接近度被提升。

2. 发明申请

US20100131538A1 IDENTIFYING AND EXPANDING IMPLICITLY TEMPORALLY QUALIFIED QUERIES 有权
标题翻译：识别和扩展隐含的临时合格查询
公开(公告)号：US20100131538A1
公开(公告)日：2010-05-27
申请号：US12277059
申请日：2008-11-24
申请人： Rosie Jones , Donald Metzler , Fuchun Peng
发明人： Rosie Jones , Donald Metzler , Fuchun Peng
IPC分类号： G06F7/06 , G06F17/30 , G06F7/00
CPC分类号： G06F17/30672 , G06F17/30864
摘要： Methods and apparatus are described for identifying implicitly temporally qualified queries, i.e., queries for which a time period is implied but not explicitly stated, and for expanding such queries to include one or more temporal references.
摘要翻译：描述了用于识别隐式时间限定的查询的方法和装置，即，暗示时间段但未明确陈述的查询，以及用于扩展这样的查询以包括一个或多个时间参考。

3. 发明授权

US08156111B2 Identifying and expanding implicitly temporally qualified queries 有权
标题翻译：识别和扩展隐含的临时资格查询
公开(公告)号：US08156111B2
公开(公告)日：2012-04-10
申请号：US12277059
申请日：2008-11-24
申请人： Rosie Jones , Donald Metzler , Fuchun Peng
发明人： Rosie Jones , Donald Metzler , Fuchun Peng
IPC分类号： G06F17/30
CPC分类号： G06F17/30672 , G06F17/30864
摘要： Methods and apparatus are described for identifying implicitly temporally qualified queries, i.e., queries for which a time period is implied but not explicitly stated, and for expanding such queries to include one or more temporal references.
摘要翻译：描述了用于识别隐式时间限定的查询的方法和装置，即，暗示时间段但未明确陈述的查询，以及用于扩展这样的查询以包括一个或多个时间参考。

4. 发明申请

US20100318533A1 ENRICHED DOCUMENT REPRESENTATIONS USING AGGREGATED ANCHOR TEXT 审中-公开
标题翻译：使用聚集的锚固文本增强文档表示
公开(公告)号：US20100318533A1
公开(公告)日：2010-12-16
申请号：US12482377
申请日：2009-06-10
申请人： Jasmine Novak , Donald Metzler , Hang Cui , Srihari Reddy , Emre Velipasaoglu
发明人： Jasmine Novak , Donald Metzler , Hang Cui , Srihari Reddy , Emre Velipasaoglu
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F16/958
摘要： A system and method for aggregating anchor text over the web graph and using the aggregated anchor text to enrich document representations. For a target page, its internal inlinks, which point to the target page and are within the site containing the target page, are identified first. Then external anchors that point to the internal inlinks from pages outside of the site are identified. Anchor text of the external anchors are collected, weighted, stored, and used to enrich document presentations. The method not only reduces the number of pages with no anchor text, but also adds lines of anchor text to URLs.
摘要翻译：一种用于在网络图上聚合锚文本并使用聚合锚文本来丰富文档表示的系统和方法。对于目标页面，首先标识其指向目标页面并且在包含目标页面的站点内的内部链接。然后识别指向站点外部的内部链接的外部锚点。收集，加权，存储和使用外部锚点的锚文本来丰富文档演示。该方法不仅减少了没有锚文本的页面数，而且还向URL添加了一些锚文本。

5. 发明申请

US20100332491A1 METHOD AND SYSTEM FOR UTILIZING USER SELECTION DATA TO DETERMINE RELEVANCE OF A WEB DOCUMENT FOR A SEARCH QUERY 审中-公开
标题翻译：使用用户选择数据确定网络文档与搜索查询的相关性的方法和系统
公开(公告)号：US20100332491A1
公开(公告)日：2010-12-30
申请号：US12491463
申请日：2009-06-25
申请人： Hang Cui , Srihari Reddy , Donald Metzler
发明人： Hang Cui , Srihari Reddy , Donald Metzler
IPC分类号： G06F17/30
CPC分类号： G06F16/9535 , G06F16/335
摘要： Methods and systems are provided that may be used to utilize user selection data on web documents in a list of search results to provide relevant search results in response to a search query.
摘要翻译：提供了可用于在搜索结果列表中利用网页文档上的用户选择数据以提供响应于搜索查询的相关搜索结果的方法和系统。

6. 发明申请

US20090282016A1 Systems and Methods for Building a Prediction Model to Predict a Degree of Relevance Between Digital Ads and a Search Query or Webpage Content 审中-公开
标题翻译：用于构建预测模型以预测数字广告与搜索查询或网页内容之间的相关程度的系统和方法
公开(公告)号：US20090282016A1
公开(公告)日：2009-11-12
申请号：US12116747
申请日：2008-05-07
申请人： Evgeniy Gabrilovich , Vassilis Plachouras , Andrei Broder , Vanessa Murdock , Donald Metzler , Vanja Josifovski , Massimiliano Ciaramita , Marcus Fontoura
发明人： Evgeniy Gabrilovich , Vassilis Plachouras , Andrei Broder , Vanessa Murdock , Donald Metzler , Vanja Josifovski , Massimiliano Ciaramita , Marcus Fontoura
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06F16/951 , G06Q10/04
摘要： Systems and methods for building a prediction model to predict a degree of relevance between digital ads and a search query or webpage content are disclosed. Generally, an indication of relevance is received between a plurality of digital ads and one of a webpage content or a search query. A set of features is extracted from the plurality of digital ads and one of the webpage content or the search query. A prediction model is then built to predict a degree of relevance between the set of candidate digital ads and one of a second webpage content or a second search query, where the prediction model is built based at least one the received indication of relevance and the extracted set of features.
摘要翻译：公开了用于构建预测模型以预测数字广告与搜索查询或网页内容之间的相关程度的系统和方法。通常，在多个数字广告和网页内容之一或搜索查询之间接收到相关性的指示。从多个数字广告和网页内容或搜索查询之一提取一组特征。然后构建预测模型以预测候选数字广告集合与第二网页内容或第二搜索查询之一之间的相关程度，其中基于所接收到的相关性指示中的至少一个构建预测模型，并且提取一套功能。

7. 发明申请

US20090282014A1 Systems and Methods for Predicting a Degree of Relevance Between Digital Ads and a Search Query 审中-公开
标题翻译：用于预测数字广告与搜索查询之间相关程度的系统和方法
公开(公告)号：US20090282014A1
公开(公告)日：2009-11-12
申请号：US12116710
申请日：2008-05-07
申请人： Evgeniy Gabrilovich , Vassilis Plachouras , Andrei Broder , Vanessa Murdock , Donald Metzler , Vanja Josifovski , Massimiliano Ciaramita , Marcus Fontoura
发明人： Evgeniy Gabrilovich , Vassilis Plachouras , Andrei Broder , Vanessa Murdock , Donald Metzler , Vanja Josifovski , Massimiliano Ciaramita , Marcus Fontoura
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06F16/334 , G06F16/951
摘要： Systems and methods for predicting a degree of relevance between a set of candidate digital ads and a search query are disclosed. Generally, an ad provider receives a digital ad request associated with a search query. The ad provider identifies a set of candidate digital ads that may be served in response to the digital ad request. A relevance module extracts a set of features from the set of candidate digital ads and the search query associated with the digital ad request, and determines a degree of relevance between the set of candidate digital ads and the search query based on a prediction model and the extracted set of features. If the relevance module determines the set of candidate digital ads is relevant to the search query, the ad provider may serve one or more digital ads from the set of candidate digital ads in response to the received digital ad request.
摘要翻译：公开了用于预测一组候选数字广告与搜索查询之间的相关程度的系统和方法。通常，广告提供商接收与搜索查询相关联的数字广告请求。广告提供商确定可以针对数字广告请求提供的一组候选数字广告。相关性模块从所述候选数字广告集合和与数字广告请求相关联的搜索查询提取一组特征，并且基于预测模型确定候选数字广告集合和搜索查询之间的相关程度，并且提取一组功能。如果相关性模块确定候选数字广告的集合与搜索查询相关，则广告提供者可以响应于接收到的数字广告请求，从一组候选数字广告服务一个或多个数字广告。

8. 发明授权

US09449282B2 System for determining and optimizing for relevance in match-making systems 有权
标题翻译：用于确定和优化匹配系统中的相关性的系统
公开(公告)号：US09449282B2
公开(公告)日：2016-09-20
申请号：US12829152
申请日：2010-07-01
申请人： Fernando Diaz , Donald Metzler , Sihem Amer-Yahia
发明人： Fernando Diaz , Donald Metzler , Sihem Amer-Yahia
IPC分类号： G06F17/30 , G06N99/00
CPC分类号： G06F17/30702 , G06F17/30867 , G06N5/048 , G06N7/005 , G06N99/005
摘要： Disclosed are methods and apparatus for automatically determining the relevance of matches between entities. A set of one or more indicators of relevance for each of a plurality of matches may be detected, where each of the plurality of matches exists between a first entity and a different one of a plurality of entities. Each set of one or more indicators of relevance indicates a degree of two-way interest for a corresponding one of the plurality of matches, the degree of two-way interest indicating both a degree of interest of the first entity in the corresponding one of the plurality of entities and a degree of interest of the corresponding one of the plurality of entities in the first entity. A probability of relevance of each of the plurality of matches may be determined based at least in part upon a corresponding set of one or more indicators of relevance. Each of the plurality of matches may be ranked based at least in part on the corresponding probability of relevance. A ranking function may be trained based upon the probability of relevance of each of the plurality of matches. The ranking function may subsequently be applied to identify and rank matches (e.g., in the absence of indicators of relevance).
摘要翻译：公开了用于自动确定实体之间的匹配的相关性的方法和装置。可以检测到对于多个匹配中的每一个的一个或多个相关性指标的集合，其中多个匹配中的每一个存在于第一实体和多个实体中的不同实体之间。每一组一个或多个相关指示符表示多个匹配中的相应一个匹配的双向兴趣程度，双向利益的程度表示第一实体在相应的一个匹配中的兴趣度多个实体和第一实体中的多个实体中相应的一个实体的兴趣程度。可以至少部分地基于相关的一个或多个相关指标的集合来确定多个匹配中的每一个的相关概率。至少部分地基于相关的相关概率来对多个匹配中的每一个进行排名。可以基于多个匹配中的每一个的相关概率来训练排序功能。随后可以应用排名功能来识别和排名匹配（例如，在没有相关性指标的情况下）。

9. 发明申请

US20120005204A1 SYSTEM FOR DETERMINING AND OPTIMIZING FOR RELEVANCE IN MATCH-MAKING SYSTEMS 有权
标题翻译：用于确定和优化匹配制度中相关性的系统
公开(公告)号：US20120005204A1
公开(公告)日：2012-01-05
申请号：US12829152
申请日：2010-07-01
申请人： Fernando Diaz , Donald Metzler , Sihem Amer-Yahia
发明人： Fernando Diaz , Donald Metzler , Sihem Amer-Yahia
IPC分类号： G06F17/30 , G06F15/18 , G06N5/02
CPC分类号： G06F17/30702 , G06F17/30867 , G06N5/048 , G06N7/005 , G06N99/005
摘要： Disclosed are methods and apparatus for automatically determining the relevance of matches between entities. A set of one or more indicators of relevance for each of a plurality of matches may be detected, where each of the plurality of matches exists between a first entity and a different one of a plurality of entities. Each set of one or more indicators of relevance indicates a degree of two-way interest for a corresponding one of the plurality of matches, the degree of two-way interest indicating both a degree of interest of the first entity in the corresponding one of the plurality of entities and a degree of interest of the corresponding one of the plurality of entities in the first entity. A probability of relevance of each of the plurality of matches may be determined based at least in part upon a corresponding set of one or more indicators of relevance. Each of the plurality of matches may be ranked based at least in part on the corresponding probability of relevance. A ranking function may be trained based upon the probability of relevance of each of the plurality of matches. The ranking function may subsequently be applied to identify and rank matches (e.g., in the absence of indicators of relevance).
摘要翻译：公开了用于自动确定实体之间的匹配的相关性的方法和装置。可以检测到对于多个匹配中的每一个的一个或多个相关性指标的集合，其中多个匹配中的每一个存在于第一实体和多个实体中的不同实体之间。每一组一个或多个相关指示符表示多个匹配中的相应一个匹配的双向兴趣程度，双向利益的程度表示第一实体在相应的一个匹配中的兴趣度多个实体和第一实体中的多个实体中相应的一个实体的兴趣程度。可以至少部分地基于相关的一个或多个相关指标的集合来确定多个匹配中的每一个的相关概率。至少部分地基于相关的相关概率来对多个匹配中的每一个进行排名。可以基于多个匹配中的每一个的相关概率来训练排序功能。随后可以应用排名功能来识别和排名匹配（例如，在没有相关性指标的情况下）。

10. 发明申请

US20110258034A1 HIERARCHICALLY-STRUCTURED INDEXING AND RETRIEVAL 审中-公开
标题翻译：分层结构化的索引和检索
公开(公告)号：US20110258034A1
公开(公告)日：2011-10-20
申请号：US12761216
申请日：2010-04-15
申请人： Donald Metzler , Evgeniy Gabrilovich , Vanja Josifovski , Michael Bendersky
发明人： Donald Metzler , Evgeniy Gabrilovich , Vanja Josifovski , Michael Bendersky
IPC分类号： G06Q30/00 , G06F17/30 , G06Q10/00
CPC分类号： G06Q30/0275 , G06F16/282 , G06F16/31 , G06Q30/02 , G06Q30/0243 , G06Q30/0254
摘要： Novel and efficient methods are described for indexing advertisements (“ads”) and other resources that are defined and organized in accordance with a hierarchical schema. In accordance with at least one embodiment, an ad corpus is transformed into a collection of hierarchically structured textual documents. An indexing technique that exploits the hierarchical structure is then applied to construct a compact yet effective ad index that can be used for performing advanced match or other ad retrieval functions. Various retrieval methods are also described herein that are capable of exploiting the hierarchical structure of the ad corpus to retrieve more relevant ads than those yielded by conventional methods.
摘要翻译：描述了新颖和有效的方法，用于按照分层模式定义和组织广告（“广告”）和其他资源。根据至少一个实施例，将广告语料库转换成分层结构化文本文档的集合。然后利用层次结构的索引技术构建一个紧凑但有效的广告索引，可用于执行高级匹配或其他广告检索功能。本文还描述了能够利用广告语料库的分层结构来检索比常规方法产生的广告更相关的广告的各种检索方法。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式