利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

21 条记录 (耗时 0.016 秒)

    SYSTEM AND METHOD FOR IMPROVED SEARCH RELEVANCE USING PROXIMITY BOOSTING
    3.
    发明申请
    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搜索的查询，其中所述查询包括多个查询令牌。 在查询中识别一个或多个概念，其中每个概念包括至少两个查询令牌。 确定每个识别的概念的相对概念强度。 然后，该查询被重写以提交给搜索引擎，其中对于一个或多个概念中的每一个，与概念的相应相对概念强度相关联的语法规则被应用于包括概念的查询令牌，使得重写的查询表示 提高了一个或多个概念，由此响应于重写的查询，搜索引擎向用户返回的搜索结果中的一个或多个概念的接近度被提升。

    ENRICHED DOCUMENT REPRESENTATIONS USING AGGREGATED ANCHOR TEXT
    4.
    发明申请
    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添加了一些锚文本。

    Systems and Methods for Predicting a Degree of Relevance Between Digital Ads and a Search Query
    6.
    发明申请
    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.

    摘要翻译： 公开了用于预测一组候选数字广告与搜索查询之间的相关程度的系统和方法。 通常，广告提供商接收与搜索查询相关联的数字广告请求。 广告提供商确定可以针对数字广告请求提供的一组候选数字广告。 相关性模块从所述候选数字广告集合和与数字广告请求相关联的搜索查询提取一组特征，并且基于预测模型确定候选数字广告集合和搜索查询之间的相关程度，并且 提取一组功能。 如果相关性模块确定候选数字广告的集合与搜索查询相关，则广告提供者可以响应于接收到的数字广告请求，从一组候选数字广告服务一个或多个数字广告。

    System and method for automatically ranking lines of text
    7.
    发明授权
    System and method for automatically ranking lines of text 有权
    自动排列文本行的系统和方法

    公开(公告)号：US08005845B2

    公开(公告)日：2011-08-23

    申请号：US12124086

    申请日：2008-05-20

    申请人： Tapas Kanungo ,  Donald Metzler

    发明人： Tapas Kanungo ,  Donald Metzler

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30675

    摘要： Disclosed are apparatus and methods for ranking lines of text. In one embodiment, an intent of a query is ascertained. A relevance of each one of a plurality of lines of text of a document is determined based upon the intent of the query, content of the query, and content of each of the plurality of lines of text. The plurality of lines of text may then be ranked according to the determined relevance of each of the plurality of lines of text.

    摘要翻译： 公开了用于对文本排列进行排序的装置和方法。 在一个实施例中，确定查询的意图。 基于查询的意图，查询的内容以及多条文本行中的每一行的内容来确定文档的多行文本中的每一行的相关性。 然后可以根据所确定的多行文本中的每一行的确定的相关性来对多行文本进行排名。

    System for determining and optimizing for relevance in match-making systems
    9.
    发明授权
    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).

    摘要翻译： 公开了用于自动确定实体之间的匹配的相关性的方法和装置。 可以检测到对于多个匹配中的每一个的一个或多个相关性指标的集合，其中多个匹配中的每一个存在于第一实体和多个实体中的不同实体之间。 每一组一个或多个相关指示符表示多个匹配中的相应一个匹配的双向兴趣程度，双向利益的程度表示第一实体在相应的一个匹配中的兴趣度 多个实体和第一实体中的多个实体中相应的一个实体的兴趣程度。 可以至少部分地基于相关的一个或多个相关指标的集合来确定多个匹配中的每一个的相关概率。 至少部分地基于相关的相关概率来对多个匹配中的每一个进行排名。 可以基于多个匹配中的每一个的相关概率来训练排序功能。 随后可以应用排名功能来识别和排名匹配（例如，在没有相关性指标的情况下）。

    SYSTEM FOR DETERMINING AND OPTIMIZING FOR RELEVANCE IN MATCH-MAKING SYSTEMS
    10.
    发明申请
    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).

    摘要翻译： 公开了用于自动确定实体之间的匹配的相关性的方法和装置。 可以检测到对于多个匹配中的每一个的一个或多个相关性指标的集合，其中多个匹配中的每一个存在于第一实体和多个实体中的不同实体之间。 每一组一个或多个相关指示符表示多个匹配中的相应一个匹配的双向兴趣程度，双向利益的程度表示第一实体在相应的一个匹配中的兴趣度 多个实体和第一实体中的多个实体中相应的一个实体的兴趣程度。 可以至少部分地基于相关的一个或多个相关指标的集合来确定多个匹配中的每一个的相关概率。 至少部分地基于相关的相关概率来对多个匹配中的每一个进行排名。 可以基于多个匹配中的每一个的相关概率来训练排序功能。 随后可以应用排名功能来识别和排名匹配（例如，在没有相关性指标的情况下）。