专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08612432B2 Determining query intent 有权
标题翻译：确定查询意图
公开(公告)号：US08612432B2
公开(公告)日：2013-12-17
申请号：US12816389
申请日：2010-06-16
申请人： Krishnaram N. G. Kenthapadi , Panayiotis Tsaparas , Sreenivas Gollapudi , Rakesh Agrawal
发明人： Krishnaram N. G. Kenthapadi , Panayiotis Tsaparas , Sreenivas Gollapudi , Rakesh Agrawal
IPC分类号： G06F7/00 , G06F17/30 , G06F15/18
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.
摘要翻译：树结构具有与项目类别的层次结构的每个类别相关联的节点。树的子节点与与父节点相关联的类别的子类别相关联。通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。应用分类器直到概率低于阈值。选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。

2. 发明申请

US20110314012A1 DETERMINING QUERY INTENT 有权
标题翻译：确定查询内容
公开(公告)号：US20110314012A1
公开(公告)日：2011-12-22
申请号：US12816389
申请日：2010-06-16
申请人： Krishnaram N. G. Kenthapadi , Panayiotis Tsaparas , Sreenivas Gollapudi , Rakesh Agrawal
发明人： Krishnaram N. G. Kenthapadi , Panayiotis Tsaparas , Sreenivas Gollapudi , Rakesh Agrawal
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.
摘要翻译：树结构具有与项目类别的层次结构的每个类别相关联的节点。树的子节点与与父节点相关联的类别的子类别相关联。通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。应用分类器直到概率低于阈值。选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。

3. 发明申请

US20090313286A1 GENERATING TRAINING DATA FROM CLICK LOGS 审中-公开
标题翻译：从点击记录生成培训数据
公开(公告)号：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
IPC分类号： G06F7/00 , G06F17/30
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.
摘要翻译：来自点击日志的数据可用于生成搜索引擎的训练数据。可以使用点击的页面以及用户跳过的页面来评估页面与查询的相关性。可以根据点击日志的数据生成训练数据的标签。标签可能与页面与查询的相关性有关。

4. 发明授权

US07877404B2 Query classification based on query click logs 有权
标题翻译：基于查询点击日志的查询分类
公开(公告)号：US07877404B2
公开(公告)日：2011-01-25
申请号：US12042531
申请日：2008-03-05
申请人： Kannan Achan , Ariel Fuxman , Rakesh Agrawal , Panayiotis Tsaparas
发明人： Kannan Achan , Ariel Fuxman , Rakesh Agrawal , Panayiotis Tsaparas
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06F17/30648 , G06F17/30672 , G06F17/30864 , G06Q30/0255 , G06Q30/0256
摘要： Methods are provided for the classification of search engine queries and associated documents based on search engine query click logs. One or more seed documents or queries are provided that contain content that is representative of a category. A query click log containing information regarding queries entered by at least one user into the search engine and documents subsequently clicked in search engine results corresponding with the queries is analyzed to determine which one or more queries resulted in clicks on the seed documents. Information is stored associating the one or more queries with the category if they resulted in clicks on the seed documents.
摘要翻译：提供了基于搜索引擎查询点击日志对搜索引擎查询和相关文档进行分类的方法。提供了一个或多个种子文档或查询，其中包含代表类别的内容。包含关于由至少一个用户输入到搜索引擎中的查询的信息的查询点击日志，并分析随后在查询中对应的搜索引擎结果中点击的文档，以确定哪一个或多个查询导致种子文档的点击。存储将一个或多个查询与类别相关联的信息，如果它们导致种子文档的点击。

5. 发明申请

US20100185577A1 OBJECT CLASSIFICATION USING TAXONOMIES 有权
标题翻译：使用TAXONOMIES的对象分类
公开(公告)号：US20100185577A1
公开(公告)日：2010-07-22
申请号：US12414065
申请日：2009-03-30
申请人： Panayiotis Tsaparas , Panagiotis Papadimitriou , Ariel D. Fuxman , Lise C. Getoor , Rakesh Agrawal
发明人： Panayiotis Tsaparas , Panagiotis Papadimitriou , Ariel D. Fuxman , Lise C. Getoor , Rakesh Agrawal
IPC分类号： G06N5/02
CPC分类号： G06N99/005
摘要： As provided herein objects from a source catalog, such as a provider's catalog, can be added to a target catalog, such as an enterprise master catalog, in a scalable manner utilizing catalog taxonomies. A baseline classifier determines probabilities for source objects to target catalog classes. Source objects can be assigned to those classes with probabilities that meet a desired threshold and meet a desired rate. A classification cost for target classes can be determined for respective unassigned source objects, which can comprise determining an assignment cost and separation cost for the source objects for respective desired target classes. The separation and assignment costs can be combined to determine the classification cost, and the unassigned source objects can be assigned to those classes having a desired classification cost.
摘要翻译：如本文所提供的，可以使用目录分类法将来自源目录的诸如提供者目录的对象以可扩展的方式添加到目标目录，例如企业主目录。基准分类器确定源对象到目标目录类的概率。可以将源对象分配给具有满足期望阈值且满足期望速率的概率的那些类。可以针对相应的未分配的源对象来确定目标类别的分类成本，其可以包括确定用于各个期望目标类别的源对象的分配成本和分离成本。分离和分配成本可以组合以确定分类成本，并且未分配的源对象可以被分配给具有期望的分类成本的那些类。

6. 发明授权

US08275726B2 Object classification using taxonomies 有权
标题翻译：使用分类法的对象分类
公开(公告)号：US08275726B2
公开(公告)日：2012-09-25
申请号：US12414065
申请日：2009-03-30
申请人： Panayiotis Tsaparas , Panagiotis Papadimitriou , Ariel D. Fuxman , Lise C. Getoor , Rakesh Agrawal
发明人： Panayiotis Tsaparas , Panagiotis Papadimitriou , Ariel D. Fuxman , Lise C. Getoor , Rakesh Agrawal
IPC分类号： G06E1/00 , G06E3/00 , G06F15/18 , G06G7/00
CPC分类号： G06N99/005
摘要： As provided herein objects from a source catalog, such as a provider's catalog, can be added to a target catalog, such as an enterprise master catalog, in a scalable manner utilizing catalog taxonomies. A baseline classifier determines probabilities for source objects to target catalog classes. Source objects can be assigned to those classes with probabilities that meet a desired threshold and meet a desired rate. A classification cost for target classes can be determined for respective unassigned source objects, which can comprise determining an assignment cost and separation cost for the source objects for respective desired target classes. The separation and assignment costs can be combined to determine the classification cost, and the unassigned source objects can be assigned to those classes having a desired classification cost.
摘要翻译：如本文所提供的，可以使用目录分类法将来自源目录的诸如提供者目录的对象以可扩展的方式添加到目标目录，例如企业主目录。基准分类器确定源对象到目标目录类的概率。可以将源对象分配给具有满足期望阈值且满足期望速率的概率的那些类。可以针对相应的未分配的源对象来确定目标类别的分类成本，其可以包括确定用于各个期望目标类别的源对象的分配成本和分离成本。分离和分配成本可以组合以确定分类成本，并且未分配的源对象可以被分配给具有期望的分类成本的那些类。

7. 发明申请

US20080250008A1 Query Specialization 审中-公开
标题翻译：查询专业化
公开(公告)号：US20080250008A1
公开(公告)日：2008-10-09
申请号：US11696455
申请日：2007-04-04
申请人： Sreenivas Gollapudi , Rakesh Agrawal , Evimaria Terzi
发明人： Sreenivas Gollapudi , Rakesh Agrawal , Evimaria Terzi
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.
摘要翻译：一种用于识别和呈现用户搜索输入的潜在查询改进的系统，方法和计算机可读介质。文件被识别为响应于搜索输入。访问查询日志以识别先前输入的也返回一个或多个已识别文档的查询。从这些以前输入的查询中，一部分查询被选择为潜在的查询优化。此后，向用户显示潜在的查询优化。

8. 发明授权

US08086631B2 Search result diversification 有权
标题翻译：搜索结果多样化
公开(公告)号：US08086631B2
公开(公告)日：2011-12-27
申请号：US12334257
申请日：2008-12-12
申请人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
发明人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
IPC分类号： G06F17/30 , G06F17/00
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.
摘要翻译：用于接收搜索查询，检索文档，计算给定查询呈现的类别数量的方法，装置和系统，计算在每个类别中显示的结果的数量，计算类别的顺序以及针对所有结果页面在第一页之外，使用用户界面元素，其可选地允许用户快速放大特定类别并获得属于该类别的更多结果。

9. 发明授权

US08250092B2 Search result diversification 有权
标题翻译：搜索结果多样化
公开(公告)号：US08250092B2
公开(公告)日：2012-08-21
申请号：US13329574
申请日：2011-12-19
申请人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
发明人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
IPC分类号： G06F17/30 , G06F17/00
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.
摘要翻译：用于接收搜索查询，检索文档，计算给定查询呈现的类别数量的方法，装置和系统，计算在每个类别中显示的结果的数量，计算类别的顺序以及针对所有结果页面在第一页之外，使用用户界面元素，其可选地允许用户快速放大特定类别并获得属于该类别的更多结果。

10. 发明申请

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

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式