-
公开(公告)号：US20080250008A1
公开(公告)日：2008-10-09
申请号：US11696455
申请日：2007-04-04
IPC分类号： G06F17/30
CPC分类号： G06F16/951 , G06F16/3322
摘要： A system, a method and computer-readable media for identifying and presenting potential query refinements for a user's search input. Documents are identified as being responsive to the search input. A query log is accessed to identify previously entered queries that also returned one or more of the identified documents. From these previously entered queries, a portion of the queries are selected as potential query refinements. Thereafter, the potential query refinements are displayed to the user.
摘要翻译： 一种用于识别和呈现用户搜索输入的潜在查询改进的系统，方法和计算机可读介质。 文件被识别为响应于搜索输入。 访问查询日志以识别先前输入的也返回一个或多个已识别文档的查询。 从这些以前输入的查询中，一部分查询被选择为潜在的查询优化。 此后，向用户显示潜在的查询优化。
-
公开(公告)号：US08086631B2
公开(公告)日：2011-12-27
申请号：US12334257
申请日：2008-12-12
CPC分类号： G06F17/30864
摘要： Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.
摘要翻译： 用于接收搜索查询，检索文档，计算给定查询呈现的类别数量的方法，装置和系统，计算在每个类别中显示的结果的数量，计算类别的顺序以及针对所有结果页面 在第一页之外，使用用户界面元素，其可选地允许用户快速放大特定类别并获得属于该类别的更多结果。
-
公开(公告)号：US08612432B2
公开(公告)日：2013-12-17
申请号：US12816389
申请日：2010-06-16
CPC分类号： G06F17/30979
摘要： A tree structure has a node associated with each category of a hierarchy of item categories. Child nodes of the tree are associated with sub-categories of the categories associated with parent nodes. Training data including received queries and indicators of a selected item category for each received query is combined with the tree structure by associating each query with the node corresponding to the selected category of the query. When a query is received, a classifier is applied to the nodes to generate a probability that the query is intended to match an item of the category associated with the node. The classifier is applied until the probability is below a threshold. One or more categories associated with the nodes that are closest to the intent of the received query are selected and indicators of items of those categories that match the received query are output.
摘要翻译： 树结构具有与项目类别的层次结构的每个类别相关联的节点。 树的子节点与与父节点相关联的类别的子类别相关联。 通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。 当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。 应用分类器直到概率低于阈值。 选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。
-
公开(公告)号：US20090313286A1
公开(公告)日：2009-12-17
申请号：US12140272
申请日：2008-06-17
申请人： Nina Mishra , Rakesh Agrawal , Sreenivas Gollapudi , Alan Halverson , Krishnaram N. G. Kenthapadi , Rina Panigrahy , John C. Shafer , Panayiotis Tsaparas
发明人： Nina Mishra , Rakesh Agrawal , Sreenivas Gollapudi , Alan Halverson , Krishnaram N. G. Kenthapadi , Rina Panigrahy , John C. Shafer , Panayiotis Tsaparas
CPC分类号： G06F16/9535
摘要： Data from a click log may be used to generate training data for a search engine. The pages clicked as well as the pages skipped by a user may be used to assess the relevance of a page to a query. Labels for training data may be generated based on data from the click log. The labels may pertain to the relevance of a page to a query.
摘要翻译： 来自点击日志的数据可用于生成搜索引擎的训练数据。 可以使用点击的页面以及用户跳过的页面来评估页面与查询的相关性。 可以根据点击日志的数据生成训练数据的标签。 标签可能与页面与查询的相关性有关。
-
公开(公告)号：US08250092B2
公开(公告)日：2012-08-21
申请号：US13329574
申请日：2011-12-19
CPC分类号： G06F17/30864
摘要： Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.
摘要翻译： 用于接收搜索查询，检索文档，计算给定查询呈现的类别数量的方法，装置和系统，计算在每个类别中显示的结果的数量，计算类别的顺序以及针对所有结果页面 在第一页之外，使用用户界面元素，其可选地允许用户快速放大特定类别并获得属于该类别的更多结果。
-
公开(公告)号：US20110119269A1
公开(公告)日：2011-05-19
申请号：US12620600
申请日：2009-11-18
申请人： Rakesh Agrawal , Sreenivas Gollapudi , Nina Mishra
发明人： Rakesh Agrawal , Sreenivas Gollapudi , Nina Mishra
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.
摘要翻译： 描述了除传统链接形式的（或代替）搜索结果之外还响应于查询返回概念的搜索（例如，网页搜索）技术。 每个概念通常对应于一组到内容的链接，其更多地针对相对于该查询的可能的用户意图或信息需求。 如果用户选择一个概念，则该概念的链接被暴露以便于选择用户发现相关的文档。 以这种方式，可以为查询提供远远超过前十名的链接，每个由概念排列的其他链接集合。 还描述了处理查询日志或其他数据存储以可选地查找相关查询并且通过聚类从查询日志生成的关系图来查找概念，以找到代表概念的密集子图。
-
公开(公告)号：US20110314012A1
公开(公告)日：2011-12-22
申请号：US12816389
申请日：2010-06-16
IPC分类号： G06F17/30
CPC分类号： G06F17/30979
摘要： A tree structure has a node associated with each category of a hierarchy of item categories. Child nodes of the tree are associated with sub-categories of the categories associated with parent nodes. Training data including received queries and indicators of a selected item category for each received query is combined with the tree structure by associating each query with the node corresponding to the selected category of the query. When a query is received, a classifier is applied to the nodes to generate a probability that the query is intended to match an item of the category associated with the node. The classifier is applied until the probability is below a threshold. One or more categories associated with the nodes that are closest to the intent of the received query are selected and indicators of items of those categories that match the received query are output.
摘要翻译： 树结构具有与项目类别的层次结构的每个类别相关联的节点。 树的子节点与与父节点相关联的类别的子类别相关联。 通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。 当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。 应用分类器直到概率低于阈值。 选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。
-
公开(公告)号：US09176772B2
公开(公告)日：2015-11-03
申请号：US11057043
申请日：2005-02-11
CPC分类号： G06F9/4856 , G06F17/30289
摘要： A session established for an application is suspended from an instance and later resumed on the server or a different server. When a session is suspended, its state is captured and persistently stored as a session image in a data repository, and the session is terminated. When the session is resumed, a new session is established on an instance, the session image of the session to resume is retrieved from the repository and restored to the newly established session. The suspension and resumption of a session may be initiated by an application, which may request the suspension and resumption of a session.
摘要翻译： 为应用程序建立的会话从一个实例中暂停，然后在服务器或不同的服务器上恢复。 当会话被暂停时，其状态被捕获并持久存储为数据存储库中的会话映像，并且会话终止。 当会话恢复时，在一个实例上建立一个新的会话，从存储库中检索要恢复的会话的会话映像并恢复到新建立的会话。 暂停和恢复会议可由申请人启动，申请可能要求暂停和恢复会议。
-
公开(公告)号：US09158813B2
公开(公告)日：2015-10-13
申请号：US12796678
申请日：2010-06-09
申请人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
发明人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30861 , G06F17/30864
摘要： A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要翻译： 结构化查询可以指定属性的属性值。 确定将结构化查询与应用于结构化数据库时匹配的项目数量的估计。 如果估计的项目数量低于阈值，则可以放宽结构化查询以形成新的候选结构化查询。 可以基于期望的运行时间来确定候选查询的数量。 可以通过改变结构化查询的属性的一个或多个属性值来确定每个候选结构化查询。 确定每个候选结构化查询将匹配的项目的数量的估计，并且使用具有最高匹配估计的候选结构化查询来查询数据库。 可以输出匹配结果。
-
公开(公告)号：US08099417B2
公开(公告)日：2012-01-17
申请号：US11954216
申请日：2007-12-12
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.
摘要翻译： 给定查询的相关搜索结果可以使用查询的点击数据和查询发布到搜索引擎的次数来确定。 结果为给定查询获得的点击次数可以向搜索引擎提供关于给定查询的结果的相关性的反馈机制。 查询的频率以及相关的点击次数为搜索引擎提供了生成相关结果时查询的有效性。 可以根据点击数据和提供给用户的搜索结果的效率来加权查询与结果图表中的边。
-
-
-
-
-
-
-
-
-
搜索结果
76 条记录 (耗时 0.027 秒)
