公开(公告)号：US08428933B1

公开(公告)日：2013-04-23

申请号：US12640964

申请日：2009-12-17

申请人： Igor Roizen ,  Wojciech Jawor ,  Keith Dutton

发明人： Igor Roizen ,  Wojciech Jawor ,  Keith Dutton

IPC分类号： G06F17/28

CPC分类号： G06F17/277 ,  G06F17/30684

摘要： It is possible to provide meaningful responses to queries using systems which consider usage of words in the queries when analyzing those queries and determining what information is possibly relevant. This approach can be applied in online shopping systems by identification of nouns or noun phrases reflecting products available through the system.

摘要翻译： 使用在分析这些查询并确定哪些信息可能相关时考虑在查询中使用单词的系统的查询可以提供有意义的响应。 这种方法可以通过识别通过系统可用的产品的名词或名词短语来应用于在线购物系统。

公开(公告)号：US07865495B1

公开(公告)日：2011-01-04

申请号：US11245602

申请日：2005-10-06

申请人： Igor Roizen ,  Keith A. Dutton

发明人： Igor Roizen ,  Keith A. Dutton

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30864 ,  G06F17/30687 ,  Y10S707/971 ,  Y10S707/99935 ,  Y10S707/99937

摘要： A searcher can be configured to improve search results through the use of intelligent word deletion. A search auto categorizer (SAC) operates on the original query and returns a list of leaf categories and a distribution of probabilities among the leaf categories. The original query is parsed into word pairs and each word pair is run through the search engine. The search results for each word pair are weighted by the leaf category probabilities. A word pair is selected from the results and one of the two words is deleted from the original query. The searcher can perform exhaustive deletion where multiple truncated queries are generated from the original query and the results list from one truncated query is returned as the results list. The searcher can build up a truncated query from the original query by iteratively appending a word selected from the original query to the truncated query.

摘要翻译： 可以通过使用智能字删除来配置搜索器来提高搜索结果。 搜索自动分类器（SAC）对原始查询进行操作，并返回叶类别列表和叶类别之间的概率分布。 原始查询被解析为单词对，每个单词对都通过搜索引擎运行。 每个单词对的搜索结果由叶类别概率加权。 从结果中选择一个字对，并从原始查询中删除两个单词之一。 搜索者可以执行详尽的删除，其中从原始查询生成多个截断的查询，并将一个截断的查询的结果列表作为结果列表返回。 搜索者可以通过将从原始查询中选择的单词迭代地添加到截断的查询中，从原始查询中构建截断的查询。

公开(公告)号：US20110078130A1

公开(公告)日：2011-03-31

申请号：US12958340

申请日：2010-12-01

申请人： Igor ROIZEN ,  Keith A. Dutton

发明人： Igor ROIZEN ,  Keith A. Dutton

IPC分类号： G06F17/30

CPC分类号： G06F16/3346 ,  G06F16/951 ,  Y10S707/971 ,  Y10S707/99935 ,  Y10S707/99937

摘要： A searcher can be configured to improve search results through the use of intelligent word deletion. A search auto categorizer (SAC) operates on the original query and returns a list of leaf categories and a distribution of probabilities among the leaf categories. The original query is parsed into word pairs and each word pair is run through the search engine. The search results for each word pair are weighted by the leaf category probabilities. A word pair is selected from the results and one of the two words is deleted from the original query. The searcher can perform exhaustive deletion where multiple truncated queries are generated from the original query and the results list from one truncated query is returned as the results list. The searcher can build up a truncated query from the original query by iteratively appending a word selected from the original query to the truncated query.

摘要翻译： 可以通过使用智能字删除来配置搜索器来提高搜索结果。 搜索自动分类器（SAC）对原始查询进行操作，并返回叶类别列表和叶类别之间的概率分布。 原始查询被解析为单词对，每个单词对都通过搜索引擎运行。 每个单词对的搜索结果由叶类别概率加权。 从结果中选择一个字对，并从原始查询中删除两个单词之一。 搜索者可以执行详尽的删除，其中从原始查询生成多个截断的查询，并将一个截断的查询的结果列表作为结果列表返回。 搜索者可以通过将从原始查询中选择的单词迭代地添加到截断的查询中，从原始查询中构建截断的查询。

公开(公告)号：US07672894B2

公开(公告)日：2010-03-02

申请号：US10201118

申请日：2002-07-22

申请人： George Rebane ,  Keith Allen Dutton ,  Haitao Wang

发明人： George Rebane ,  Keith Allen Dutton ,  Haitao Wang

IPC分类号： G06Q40/00

CPC分类号： G06Q30/08 ,  G06Q40/04

摘要： A computer implemented bidding method for use in bidding on auction items that allows for a desired optimization of bid amounts. The method includes selecting a set of one or more biddable items offered at auction wherein for a biddable item the auction offers a ranking for one or more received bids according to bid amounts, determining the current bids for a set of the biddable items, determining a bid amount for a selected biddable item based on a given utility function to determine a set of rankings for achieving a desired optimized outcome from the bidding, and submitting a set of bid amounts.

摘要翻译： 计算机实施用于投标拍卖项目的投标方法，允许期望的投标金额优化。 该方法包括选择在拍卖中提供的一个或多个可出价项目的集合，其中对于可出价项目，拍卖根据投标金额为一个或多个接收的投标提供排名，确定一组可出价项目的当前出价， 基于给定的效用函数的所选择的可出价项目的出价金额来确定用于从投标获得期望的优化结果的一组排名，以及提交一组投标金额。

公开(公告)号：US08428948B1

公开(公告)日：2013-04-23

申请号：US12839764

申请日：2010-07-20

申请人： Igor Roizen ,  Wojciech Jawor ,  Keith Dutton

发明人： Igor Roizen ,  Wojciech Jawor ,  Keith Dutton

IPC分类号： G10L15/04

CPC分类号： G06F17/277 ,  G06F17/30684

摘要： It is possible to provide meaningful responses to queries using systems which consider usage of words in the queries when analyzing those queries and determining what information is possibly relevant. This approach can be applied in online shopping systems by identification of nouns or noun phrases reflecting products available through the system.

公开(公告)号：US08001478B2

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

申请号：US11313552

申请日：2005-12-20

申请人： Rajesh Bhatia ,  Nikhil Ganju ,  Anil Kamath ,  Prashant Kulkarni ,  Phoumrin Tan

发明人： Rajesh Bhatia ,  Nikhil Ganju ,  Anil Kamath ,  Prashant Kulkarni ,  Phoumrin Tan

IPC分类号： G06F3/00

CPC分类号： G06Q30/06 ,  G06Q30/0601 ,  G06Q30/0629 ,  G06Q30/0641

摘要： Computer software, systems and methods for providing context personalized browsing over computer networks. In the foregoing, an intelligent agent referred to as a “browser companion agent” includes a service component for holding one or more service modules that may assist a user by providing services that are contextually relevant to content on a browser on the user's computer system. The agent also includes a data component for holding data objects related to and sharable by one or more service modules. The agent further includes a tracking component for tracking the pages on a browser and for communicating browser page data to a remote computer system that may respond to the agent with data or code for use by service modules. Contemplated service modules include a comparison shopping service, a transaction tracking service, and automated form filling service.

摘要翻译： 用于通过计算机网络提供上下文个性化浏览的计算机软件，系统和方法。 在上文中，称为“浏览器伴随代理”的智能代理包括用于保持一个或多个服务模块的服务组件，该服务模块可以通过提供与用户计算机系统上的浏览器上的内容相关的服务来辅助用户。 代理还包括用于保存与一个或多个服务模块相关并可共享的数据对象的数据组件。 代理还包括跟踪组件，用于跟踪浏览器上的页面，并将浏览器页面数据传送到远程计算机系统，远程计算机系统可以用服务模块使用的数据或代码来响应代理。 考虑的服务模块包括比较购物服务，交易跟踪服务和自动填表服务。

公开(公告)号：US07953723B1

公开(公告)日：2011-05-31

申请号：US11245600

申请日：2005-10-06

申请人： Keith A. Dutton ,  Igor Roizen ,  Sanford J. Ganz

发明人： Keith A. Dutton ,  Igor Roizen ,  Sanford J. Ganz

IPC分类号： G06F7/00 ,  G06F17/00

CPC分类号： G06F17/30864 ,  G06F17/30687 ,  Y10S707/971 ,  Y10S707/99935 ,  Y10S707/99937

摘要： A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.

摘要翻译： 可以通过实现并行计算架构来配置搜索引擎来提高搜索时间。 该索引在多个独立的搜索节点之间分割。 将查询传送给每个并行节点，并在每个独立节点中搜索查询。 每个节点的结果被路由到一个配置为将结果聚合到一个结果集的联盟。 联盟体被配置为确定中间结果的子集以从每个独立节点检索和聚合。 至少部分地基于节点的数量和结果集中期望的搜索结果的数量，联盟人确定从每个节点检索的结果的数量。

公开(公告)号：US20140100969A1

公开(公告)日：2014-04-10

申请号：US13647555

申请日：2012-10-09

申请人： SHOPZILLA, INC.

发明人： Joseph WANG ,  David B. Johnson

IPC分类号： G06Q30/08

CPC分类号： G06Q30/08

摘要： Methods, systems, and apparatuses, including computer programs encoded on computer-readable media, for computing a displayable size for a device, a default visible area for the device, and a number of pages of content based upon historical device click-through data and pagination data. A size of an advertising candidate set is determined. The advertising candidate set, containing one or more advertisements, is determined based in part upon a query. The advertising candidate set is categorized into two or more buckets. The advertisements within each bucket are ranked. Selected advertisements based upon the ranked advertisements to send to the device are determined.

摘要翻译： 方法，系统和装置，包括在计算机可读介质上编码的计算机程序，用于计算设备的可显示大小，用于设备的默认可视区域以及基于历史设备点击数据的多页内容， 分页数据 确定广告候选集的大小。 部分地基于查询来确定包含一个或多个广告的广告候选集。 广告候选集被分为两个或更多个桶。 每个桶中的广告排名。 确定基于要发送到设备的排名广告的所选广告。

公开(公告)号：US08429147B1

公开(公告)日：2013-04-23

申请号：US13091967

申请日：2011-04-21

申请人： Keith A. Dutton ,  Igor Roizen ,  Sanford J. Ganz

发明人： Keith A. Dutton ,  Igor Roizen ,  Sanford J. Ganz

IPC分类号： G06F7/00 ,  G06F17/00

CPC分类号： G06F17/30864 ,  G06F17/30687 ,  Y10S707/971 ,  Y10S707/99935 ,  Y10S707/99937

摘要： A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.

摘要翻译： 可以通过实现并行计算架构来配置搜索引擎来提高搜索时间。 该索引在多个独立的搜索节点之间分割。 将查询传送给每个并行节点，并在每个独立节点中搜索查询。 每个节点的结果被路由到一个配置为将结果聚合到一个结果集的联盟。 联盟体被配置为确定中间结果的子集以从每个独立节点检索和聚合。 至少部分地基于节点的数量和结果集中期望的搜索结果的数量，联盟人确定从每个节点检索的结果的数量。

公开(公告)号：US08019744B1

公开(公告)日：2011-09-13

申请号：US12704179

申请日：2010-02-11

申请人： Igor Roizen ,  Keith A. Dutton

发明人： Igor Roizen ,  Keith A. Dutton

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30864 ,  G06F17/30687 ,  Y10S707/971 ,  Y10S707/99935 ,  Y10S707/99937

摘要： A searcher can be configured to improve relevance ranking of search results through iterative weighting of search ranking results. A Search Auto Categorizer (SAC) operates on a base query to return a probabilistic distribution of leaf categories of a taxonomy in which relevant products may reside. A Search Logic Unit (SLU) can compute a relevance of any particular leaf category to the base query. The SLU can then determine an initial relevance of a particular product to the query based on the probabilistic distribution and the relevance of leaf category to query. The SLU weights the relevance of a product to the query to establish an updated probabilistic distribution. The SLU then repeats the relevance and weighting until convergence upon a relevance list.

摘要翻译： 搜索者可以被配置为通过搜索排名结果的迭代加权来提高搜索结果的相关性排名。 搜索自动分类器（SAC）基于基本查询来返回相关产品可能存在的分类法的叶类别的概率分布。 搜索逻辑单元（SLU）可以计算任何特定叶类别与基本查询的相关性。 然后，SLU可以基于概率分布和叶类别与查询的相关性来确定特定产品与查询的初始相关性。 SLU将产品与查询的相关性加权，以建立更新的概率分布。 然后，SLU重复相关性和权重，直到在相关性列表上收敛。