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

1. 发明申请

US20110145227A1 DETERMINING PREFERENCES FROM USER QUERIES 有权
标题翻译：确定用户查询的优先权
公开(公告)号：US20110145227A1
公开(公告)日：2011-06-16
申请号：US12639021
申请日：2009-12-16
申请人： Krishnaram N. G. Kenthapadi , Indraneel Mukherjee , Stelios Paparizos , Panayiotis Tsaparas
发明人： Krishnaram N. G. Kenthapadi , Indraneel Mukherjee , Stelios Paparizos , Panayiotis Tsaparas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： A query may be received at a computing device through a network. One or more attribute values that are preferences for a subset of the one or more terms of the query may be identified by the computing device. One or more products or services having associated attributes that have values that match a subset of the identified attribute values may be identified by the computing device, and a subset of the identified products or services may be presented by the computing device through the network. Implementations may also identify latent preferences, that is, preferences that are found for a query even where such a preference is not explicitly part of a term or token of the query.
摘要翻译：可以通过网络在计算设备处接收查询。可以由计算设备识别作为查询的一个或多个项的子集的偏好的一个或多个属性值。具有与所识别的属性值的子集匹配的值的相关联属性的一个或多个产品或服务可由计算设备识别，并且所识别的产品或服务的子集可以由计算设备通过网络呈现。实现还可以识别潜在的偏好，即，即使在这样的偏好不是查询的术语或令牌的明确部分的情况下，也可以查询查询的偏好。

2. 发明授权

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.
摘要翻译：提供了基于搜索引擎查询点击日志对搜索引擎查询和相关文档进行分类的方法。提供了一个或多个种子文档或查询，其中包含代表类别的内容。包含关于由至少一个用户输入到搜索引擎中的查询的信息的查询点击日志，并分析随后在查询中对应的搜索引擎结果中点击的文档，以确定哪一个或多个查询导致种子文档的点击。存储将一个或多个查询与类别相关联的信息，如果它们导致种子文档的点击。

3. 发明授权

US08612472B2 Determining preferences from user queries 有权
标题翻译：确定用户查询的偏好设置
公开(公告)号：US08612472B2
公开(公告)日：2013-12-17
申请号：US12639021
申请日：2009-12-16
申请人： Krishnaram N. G. Kenthapadi , Indraneel Mukherjee , Stelios Paparizos , Panayiotis Tsaparas
发明人： Krishnaram N. G. Kenthapadi , Indraneel Mukherjee , Stelios Paparizos , Panayiotis Tsaparas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： A query may be received at a computing device through a network. One or more attribute values that are preferences for a subset of the one or more terms of the query may be identified by the computing device. One or more products or services having associated attributes that have values that match a subset of the identified attribute values may be identified by the computing device, and a subset of the identified products or services may be presented by the computing device through the network. Implementations may also identify latent preferences, that is, preferences that are found for a query even where such a preference is not explicitly part of a term or token of the query.
摘要翻译：可以通过网络在计算设备处接收查询。可以由计算设备识别作为查询的一个或多个项的子集的偏好的一个或多个属性值。具有与所识别的属性值的子集匹配的值的相关联属性的一个或多个产品或服务可由计算设备识别，并且所识别的产品或服务的子集可以由计算设备通过网络呈现。实现还可以识别潜在的偏好，即，即使在这样的偏好不是查询的术语或令牌的明确部分的情况下，也可以查询查询的偏好。

4. 发明申请

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.
摘要翻译：树结构具有与项目类别的层次结构的每个类别相关联的节点。树的子节点与与父节点相关联的类别的子类别相关联。通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。应用分类器直到概率低于阈值。选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。

5. 发明授权

US07185012B1 Method and apparatus for ranked join indices 有权
标题翻译：排名连接索引的方法和装置
公开(公告)号：US07185012B1
公开(公告)日：2007-02-27
申请号：US10775056
申请日：2004-02-09
申请人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
发明人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937 , Y10S707/99942
摘要： A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.
摘要翻译：用于分级连接索引的方法和装置包括当允许对特定连接条件构建排名连接索引的预处理时，提供针对两个关系的top-k连接查询的性能保证的解决方案。在这里提出的排名连接指数的概念也适用于单一关系的情况。在这种情况下，这里的概念提供了对单调线性函数的top-k选择问题的解决方案，对于两个排序的属性和任意偏好向量的情况，保证了最差情况搜索性能。

6. 发明授权

US08990124B2 Assessing quality of user reviews 有权
标题翻译：评估用户评论的质量
公开(公告)号：US08990124B2
公开(公告)日：2015-03-24
申请号：US12687127
申请日：2010-01-14
申请人： Panayiotis Tsaparas , Yue Lu , Alexandros Ntoulas , Livia Polanyi
发明人： Panayiotis Tsaparas , Yue Lu , Alexandros Ntoulas , Livia Polanyi
IPC分类号： G06Q30/00 , G06F17/30 , G06Q30/02
CPC分类号： G06F17/30616 , G06Q30/02
摘要： User generated reviews and scores associated with the reviews may be used to train a review scoring model with textual features of the reviews. The review scoring model may be used to predict scores for newly received reviews. One or more constraints based on social networking application data associated with an author of a review may be used to adjust the predicted score of the review.
摘要翻译：用户生成的与评论相关的评论和分数可能用于训练评论模型与评论的文字功能。审查评分模型可用于预测新收到的评论的分数。可以使用基于与评论的作者相关联的社交网络应用数据的一个或多个约束来调整评论的预测得分。

7. 发明授权

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.
摘要翻译：树结构具有与项目类别的层次结构的每个类别相关联的节点。树的子节点与与父节点相关联的类别的子类别相关联。通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。应用分类器直到概率低于阈值。选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。

8. 发明申请

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.
摘要翻译：如本文所提供的，可以使用目录分类法将来自源目录的诸如提供者目录的对象以可扩展的方式添加到目标目录，例如企业主目录。基准分类器确定源对象到目标目录类的概率。可以将源对象分配给具有满足期望阈值且满足期望速率的概率的那些类。可以针对相应的未分配的源对象来确定目标类别的分类成本，其可以包括确定用于各个期望目标类别的源对象的分配成本和分离成本。分离和分配成本可以组合以确定分类成本，并且未分配的源对象可以被分配给具有期望的分类成本的那些类。

9. 发明申请

US20090228353A1 QUERY CLASSIFICATION BASED ON QUERY CLICK LOGS 有权
标题翻译：基于QUICK CLICK LOGS的QUERY分类
公开(公告)号：US20090228353A1
公开(公告)日：2009-09-10
申请号：US12042531
申请日：2008-03-05
申请人： KANNAN ACHAN , ARIEL FUXMAN , RAKESH AGRAWAL , PANAYIOTIS TSAPARAS
发明人： KANNAN ACHAN , ARIEL FUXMAN , RAKESH AGRAWAL , PANAYIOTIS TSAPARAS
IPC分类号： G06Q30/00 , G06F7/10 , G06F17/30 , G06F7/38 , G06F7/52 , G06F7/556
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.
摘要翻译：提供了基于搜索引擎查询点击日志对搜索引擎查询和相关文档进行分类的方法。提供了一个或多个种子文档或查询，其中包含代表类别的内容。包含关于由至少一个用户输入到搜索引擎中的查询的信息的查询点击日志，并分析随后在查询中对应的搜索引擎结果中点击的文档，以确定哪一个或多个查询导致种子文档的点击。存储将一个或多个查询与类别相关联的信息，如果它们导致种子文档的点击。

10. 发明申请

US20130060760A1 DETERMINING COMPREHENSIVE SUBSETS OF REVIEWS 审中-公开
标题翻译：确定综合综合评估报告
公开(公告)号：US20130060760A1
公开(公告)日：2013-03-07
申请号：US13224350
申请日：2011-09-02
申请人： Panayiotis Tsaparas , Alexandros Ntoulas , Evimaria Terzi
发明人： Panayiotis Tsaparas , Alexandros Ntoulas , Evimaria Terzi
IPC分类号： G06F17/30
CPC分类号： G06F16/355
摘要： Techniques are provided for selecting a limited but comprehensive set of high-quality users reviews covering several different aspects or attributes of a reviewed item. For several implementations, selection methodologies approach the challenge as a maximum coverage problem and provide a generic formalism to model the different variants of the review-set selection. Variations to such implementation may also employ different algorithms in consideration of different variants and weightings of those variants. Select implementations employ methodologies that collectively consider attributes of the item discussed in the reviews, the quality of the reviews themselves, and the viewpoint of the reviews (e.g., positive or negative) as input values in order to provide outputs that cover as many attributes of the item as possible, comprising high quality reviews representing different viewpoints.
摘要翻译：提供技术用于选择覆盖所审查项目的几个不同方面或属性的有限但全面的高质量用户评论。对于多个实施方案，选择方法将挑战视为最大覆盖问题，并提供通用的形式主义以对审查集选择的不同变体进行建模。考虑到这些变型的不同变体和权重，这种实现的变化也可以采用不同的算法。选择实施采用集体考虑审查中讨论的项目的属性，评论本身的质量以及评论的观点（例如，正或负））作为输入值的方法，以提供涵盖尽可能多的属性的输出该项目可能包括代表不同观点的高质量评论。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式