会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 51. 发明申请
    • PRODUCT SIMILARITY MEASURE
    • 产品相似度测量
    • US20110145226A1
    • 2011-06-16
    • US12634748
    • 2009-12-10
    • Sreenivas GollapudiDebmalya Panigrahi
    • Sreenivas GollapudiDebmalya Panigrahi
    • G06F17/30
    • G06Q30/06G06F16/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.
    • 查询产品和/或服务的用户提交的查询将在一段时间内进行监控和收集。 与用户响应提交查询所购买的产品和/或服务相对应的网页也在这段时间内被监控和收集。 从网页和查询中提取属性,并且将属性相关联以识别彼此相似的属性。 这些属性是相关联的,以标识在查询中不可替代的属性。 所识别的属性可以用于基于与产品和/或服务相关联的属性来对响应于查询的产品和/或服务进行排名,或者通过替换查询的一个或多个属性来推荐基于所提交的查询的替代查询 具有相似的属性。
    • 53. 发明申请
    • LINK BASED RANKING OF SEARCH RESULTS USING SUMMARIES OF RESULT NEIGHBORHOODS
    • 基于链接的搜索结果排序使用结果相邻的概要
    • US20090234829A1
    • 2009-09-17
    • US12045716
    • 2008-03-11
    • Sreenivas GollapudiMarc A. NajorkRina Panigrahy
    • Sreenivas GollapudiMarc A. NajorkRina Panigrahy
    • G06F17/30
    • 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.
    • 可以离线确定页面邻域的摘要,并在查询时使用,以近似结果集的邻域图,并使用近似邻域图计算得分。 邻域图的摘要可以包括包含页面的祖先或后代的有限大小子集的布隆过滤器。 摘要中也可以包括网页标识符。 使用一致的采样,其中确定来自集合的多个元素的一致的无偏样本。 在查询时,给定结果集,可以使用所有结果的摘要来创建一个封面。 创建由封面集合中的顶点组成的近似邻域图。 排名技术得分可以基于近似邻域图来确定。
    • 56. 发明申请
    • METHOD OF FINDING CANDIDATE SUB-QUERIES FROM LONGER QUERIES
    • 从长期查询中查找候选子问题的方法
    • US20090089266A1
    • 2009-04-02
    • US11863045
    • 2007-09-27
    • Sreenivas GollapudiRina Panigrahy
    • Sreenivas GollapudiRina Panigrahy
    • G06F17/30
    • G06F17/30693G06F17/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是基于查询中的项数的整数。
    • 59. 发明申请
    • BID DISCOUNTING USING EXTERNALITIES
    • 使用外来物品折价
    • US20130226713A1
    • 2013-08-29
    • US13407739
    • 2012-02-28
    • Sreenivas GollapudiAnand Bhalgat
    • Sreenivas GollapudiAnand Bhalgat
    • G06Q30/02G06Q30/08
    • G06Q30/02G06Q30/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.
    • 广告商提供在网页上放置一个或多个广告的出价以及一组外部性。 来自广告商的外部性表示可以根据从用户的浏览历史获得的信息来应用于其出价的折扣。 外部性可以包括基于用户先前对广告商的广告的观察的外部性,基于用户观看的来自竞争者广告商的广告的先前观看的外部性以及基于用户访问过的网页或域的外部性。 当接收到广告请求时,根据用户的浏览历史使用外部性来折扣提供的出价。 然后根据折扣出价选择广告。
    • 60. 发明申请
    • FULFILLING QUERIES USING SPECIFIED AND UNSPECIFIED ATTRIBUTES
    • 使用指定和未经验证的属性的丰富的查询
    • US20120226679A1
    • 2012-09-06
    • US13038409
    • 2011-03-02
    • Sreenivas GollapudiSayan Bhattacharya
    • Sreenivas GollapudiSayan Bhattacharya
    • G06F17/30
    • G06F17/30958
    • A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights.
    • 接收并处理查询以确定查询中的一个或多个指定和未指定的属性。 指定和未指定的属性可以对应于一个或多个项目的属性。 为项目生成图形,并包括每个项目的节点和每个唯一的节点对之间的边。 根据查询的指定属性与与节点相关联的项目的属性之间的距离,为每个节点分配一个成本。 基于与边缘对应的节点对的节点相关联的未指定属性之间的距离,为每个边缘分配权重。 通过最小化节点的总成本,同时基于边缘权重最大化节点的色散来选择来自图形的一组节点。