PRODUCT SIMILARITY MEASURE
    51.
    发明申请
    PRODUCT SIMILARITY MEASURE 审中-公开
    产品相似度测量

    公开(公告)号:US20110145226A1

    公开(公告)日:2011-06-16

    申请号:US12634748

    申请日:2009-12-10

    IPC分类号: G06F17/30

    CPC分类号: G06Q30/06 G06F16/9535

    摘要: Queries submitted by users looking for products and/or services are monitored and collected over a time period. Webpages corresponding to products and/or services bought by the users in response to submitting the queries are also monitored and collected over the time period. Attributes are extracted from the webpages and the queries, and the attributes are correlated to identify attributes that are similar to one another. The attributes are correlated to identify attributes that are not substitutable in a query. The identified attributes may be used to rank products and/or services that are responsive to a query based on attributes associated with the products and/or services, or to recommend alternative queries based on a submitted query by substituting one or more attributes of the query with similar attributes.

    摘要翻译: 查询产品和/或服务的用户提交的查询将在一段时间内进行监控和收集。 与用户响应提交查询所购买的产品和/或服务相对应的网页也在这段时间内被监控和收集。 从网页和查询中提取属性,并且将属性相关联以识别彼此相似的属性。 这些属性是相关联的,以标识在查询中不可替代的属性。 所识别的属性可以用于基于与产品和/或服务相关联的属性来对响应于查询的产品和/或服务进行排名,或者通过替换查询的一个或多个属性来推荐基于所提交的查询的替代查询 具有相似的属性。

    Concept Discovery in Search Logs
    52.
    发明申请
    Concept Discovery in Search Logs 审中-公开
    搜索日志中的概念发现

    公开(公告)号:US20110119269A1

    公开(公告)日:2011-05-19

    申请号:US12620600

    申请日:2009-11-18

    IPC分类号: G06F17/30

    CPC分类号: G06F16/338 G06F16/954

    摘要: Described is a search (e.g., web search) technology in which concepts are returned in response to a query in addition to (or instead of) search results in the form of traditional links. Each concept generally corresponds to a set of links to content that are more directed towards a possible user intention, or information need, with respect to that query. If a user selects a concept, that concept's links are exposed to facilitate selection of a document the user finds relevant. In this manner, much more than the top ten ranked links may be provided for a query, each set of other links arranged by the concepts. Also described is processing a query log or other data store to optionally find related queries and find the concepts, e.g., by clustering a relationship graph built from the query log to find dense subgraphs representative of the concepts.

    摘要翻译: 描述了除传统链接形式的(或代替)搜索结果之外还响应于查询返回概念的搜索(例如,网页搜索)技术。 每个概念通常对应于一组到内容的链接,其更多地针对相对于该查询的可能的用户意图或信息需求。 如果用户选择一个概念,则该概念的链接被暴露以便于选择用户发现相关的文档。 以这种方式,可以为查询提供远远超过前十名的链接,每个由概念排列的其他链接集合。 还描述了处理查询日志或其他数据存储以可选地查找相关查询并且通过聚类从查询日志生成的关系图来查找概念,以找到代表概念的密集子图。

    LINK BASED RANKING OF SEARCH RESULTS USING SUMMARIES OF RESULT NEIGHBORHOODS
    54.
    发明申请
    LINK BASED RANKING OF SEARCH RESULTS USING SUMMARIES OF RESULT NEIGHBORHOODS 审中-公开
    基于链接的搜索结果排序使用结果相邻的概要

    公开(公告)号:US20090234829A1

    公开(公告)日:2009-09-17

    申请号:US12045716

    申请日:2008-03-11

    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.

    摘要翻译: 可以离线确定页面邻域的摘要,并在查询时使用,以近似结果集的邻域图,并使用近似邻域图计算得分。 邻域图的摘要可以包括包含页面的祖先或后代的有限大小子集的布隆过滤器。 摘要中也可以包括网页标识符。 使用一致的采样,其中确定来自集合的多个元素的一致的无偏样本。 在查询时,给定结果集,可以使用所有结果的摘要来创建一个封面。 创建由封面集合中的顶点组成的近似邻域图。 排名技术得分可以基于近似邻域图来确定。

    Transparent session migration across servers
    56.
    发明授权
    Transparent session migration across servers 有权
    跨服务器的透明会话迁移

    公开(公告)号:US07552218B2

    公开(公告)日:2009-06-23

    申请号:US10917953

    申请日:2004-08-12

    IPC分类号: G06F15/16 G06F12/00

    CPC分类号: G06F17/30575 H04L67/148

    摘要: Techniques allow a client to be switched from a session on a server to another session on another server in a way that is a transparent to the application for which the initial session was established. Thus, under transparent session migration, a client is switched between sessions without executing application instructions tailored to accomplish the migration. Instead, a client-side interface component, through which the application interacts with the server, handles details of migration, modifying the internal state of the client-side interface component to effect the same. Legacy applications do not have to be modified in order to institute techniques described herein.

    摘要翻译: 技术允许客户端以对初始会话建立的应用程序透明的方式从服务器上的会话切换到另一个服务器上的另一个会话。 因此,在透明会话迁移下,客户端在会话之间切换,而不执行为完成迁移而定制的应用程序指令。 相反,应用程序与服务器交互的客户端接口组件处理迁移的细节,修改客户端接口组件的内部状态来实现。 传统的应用程序不需要修改,以便建立这里描述的技术。

    METHOD OF FINDING CANDIDATE SUB-QUERIES FROM LONGER QUERIES
    57.
    发明申请
    METHOD OF FINDING CANDIDATE SUB-QUERIES FROM LONGER QUERIES 失效
    从长期查询中查找候选子问题的方法

    公开(公告)号:US20090089266A1

    公开(公告)日:2009-04-02

    申请号:US11863045

    申请日:2007-09-27

    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是基于查询中的项数的整数。

    Transparent migration of stateless sessions across servers
    59.
    发明申请
    Transparent migration of stateless sessions across servers 有权
    跨服务器透明地迁移无状态会话

    公开(公告)号:US20050038828A1

    公开(公告)日:2005-02-17

    申请号:US10917882

    申请日:2004-08-12

    CPC分类号: G06F17/30575 H04L67/148

    摘要: Techniques allow a client to be migrated from a session that has been established for a client on a server to another session on another server in a way that is a transparent to the application for which the initial session was established. The sessions are migrated under conditions in which a copy of session state of the session to migrate from the source node does not have to be captured and restored to a destination session.

    摘要翻译: 技术允许将客户端从对服务器上的客户端建立的会话迁移到另一个服务器上的另一个会话,方式对于初始会话建立的应用程序是透明的。 在不需要捕获并将其恢复到目的地会话的情况下,会话将从源节点迁移的会话状态的副本迁移到该会话。

    BID DISCOUNTING USING EXTERNALITIES
    60.
    发明申请
    BID DISCOUNTING USING EXTERNALITIES 审中-公开
    使用外来物品折价

    公开(公告)号:US20130226713A1

    公开(公告)日:2013-08-29

    申请号:US13407739

    申请日:2012-02-28

    IPC分类号: G06Q30/02 G06Q30/08

    CPC分类号: G06Q30/02 G06Q30/08

    摘要: Advertisers provide bids for the placement of one or more advertisements on web pages, along with a set of externalities. The externalities from an advertiser indicate discounts that can be applied to their bid based on information learned from a browse history of a user. The externalities may include externalities based on previous viewings of advertisements from the advertiser by the user, externalities based on previous viewings of advertisements from competitor advertisers viewed by the user, and externalities based on web pages or domains that have been visited by the user. When a request for an advertisement is received, the externalities are used to discount the provided bids based on the browse history of the user. An advertisement is then selected based on the discounted bids.

    摘要翻译: 广告商提供在网页上放置一个或多个广告的出价以及一组外部性。 来自广告商的外部性表示可以根据从用户的浏览历史获得的信息来应用于其出价的折扣。 外部性可以包括基于用户先前对广告商的广告的观察的外部性,基于用户观看的来自竞争者广告商的广告的先前观看的外部性以及基于用户访问过的网页或域的外部性。 当接收到广告请求时,根据用户的浏览历史使用外部性来折扣提供的出价。 然后根据折扣出价选择广告。