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

1. 发明授权

US09171045B2 Recommending queries according to mapping of query communities 有权
标题翻译：根据查询社区的映射推荐查询
公开(公告)号：US09171045B2
公开(公告)日：2015-10-27
申请号：US12943951
申请日：2010-11-11
申请人： Nina Mishra , Sreenivas Gollapudi , Srikanth Jagabathula
发明人： Nina Mishra , Sreenivas Gollapudi , Srikanth Jagabathula
IPC分类号： G06F17/30
CPC分类号： G06F17/30528 , G06F17/3097
摘要： A set of queries, such as a search log, is divided into commercial queries and non-commercial queries. A first set of query communities is determined from the non-commercial queries and a second set is determined from the commercial queries. The query communities are correlated based on the users who submitted the queries and instances where a query from the first set of query communities was followed by a query from the second set to generate a mapping between the first set of query communities and the second set. Later, a non-commercial query is received from a user, and the mapping is used to predict one or more commercial queries that the user is likely to submit in the future based on the non-commercial query. One or more of the commercial queries are presented to the user according to the mapping with search results responsive to the non-commercial query.
摘要翻译：诸如搜索日志的一组查询被分为商业查询和非商业查询。从非商业查询确定第一组查询社区，并从商业查询中确定第二组。查询社区是基于提交查询的用户和来自第一组查询社区的查询后跟来自第二组的查询的用户相关联的，以生成第一组查询社区和第二组之间的映射。之后，从用户接收到非商业查询，并且映射用于基于非商业查询来预测用户将来可能提交的一个或多个商业查询。根据与响应于非商业查询的搜索结果的映射，向用户呈现一个或多个商业查询。

2. 发明申请

US20130159291A1 RANKING SEARCH RESULTS USING WEIGHTED TOPOLOGIES 审中-公开
标题翻译：使用加权拓扑来排列搜索结果
公开(公告)号：US20130159291A1
公开(公告)日：2013-06-20
申请号：US13325081
申请日：2011-12-14
申请人： Samuel Ieong , Nina Mishra , Or Sheffet
发明人： Samuel Ieong , Nina Mishra , Or Sheffet
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06F16/951
摘要： Identifiers of items generated in response to a query are each ranked in a way that considers the other identified items. Topologies are generated that correspond to features of the identified items. Each topology may be a Markov chain that includes a node for each identified item and directed edges between the nodes. Each directed edge between a node pair has an associated transition probability that represents the likelihood that a hypothetical user would change their preference from a first node in the pair to the second node in the pair when considering the feature associated with the topology. The topologies are weighted according to the relative importance of the features that correspond to the topologies. The weighted topologies are used to generate a stationary distribution of the identified items, and the identified items are ranked using the stationary distribution.
摘要翻译：响应于查询生成的项目的标识符都以考虑其他已识别项目的方式进行排名。生成与所识别项目的特征对应的拓扑。每个拓扑可以是马尔可夫链，其包括用于每个识别的项目的节点和节点之间的有向边。节点对之间的每个有向边具有相关联的转移概率，其表示当考虑与拓扑相关联的特征时，假设用户将其优选从该对中的第一节点改变成对中的第二节点的可能性。根据与拓扑对应的特征的相对重要性，对拓扑进行加权。加权拓扑用于产生所识别的项目的固定分布，并且使用固定分布对所识别的项目进行排名。

3. 发明授权

US08219539B2 Search queries with shifting intent 有权
标题翻译：搜索具有转换意图的查询
公开(公告)号：US08219539B2
公开(公告)日：2012-07-10
申请号：US12419363
申请日：2009-04-07
申请人： Alan Dale Halverson , Krishnaram Kenthapadi , Nina Mishra , Aleksandrs Slivkins , Umar Ali Syed
发明人： Alan Dale Halverson , Krishnaram Kenthapadi , Nina Mishra , Aleksandrs Slivkins , Umar Ali Syed
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： Techniques and systems are disclosed for returning temporally-aware results from an Internet-based search query. To determine if a query is temporally-based one or more query features are collected and input into a trained classifier, yielding a temporal classification for the query. Further, if a query is classified as temporal, the query results are shifted by determining an alternate set of results for the query, and returning one or more alternate results to one or more users. Based on user interactions with the one or more alternate results, the classifier can be updated, for example, by changing the query to a non-temporal query if the user interactions identify it as such.
摘要翻译：公开了用于从基于因特网的搜索查询返回时间感知结果的技术和系统。为了确定查询是否是基于时间的，一个或多个查询特征被收集并输入到经过训练的分类器中，产生查询的时间分类。此外，如果查询被分类为时间，则通过为查询确定替代的一组结果并将一个或多个替代结果返回给一个或多个用户来移动查询结果。基于与一个或多个替代结果的用户交互，分类器可以被更新，例如，如果用户交互识别它，例如通过将查询改变为非时间查询。

4. 发明申请

US20100257164A1 SEARCH QUERIES WITH SHIFTING INTENT 有权
标题翻译：搜索与移位信息的疑问
公开(公告)号：US20100257164A1
公开(公告)日：2010-10-07
申请号：US12419363
申请日：2009-04-07
申请人： Alan Dale Halverson , Krishnaram Kenthapadi , Nina Mishra , Aleksandrs Slivkins , Umar Ali Syed
发明人： Alan Dale Halverson , Krishnaram Kenthapadi , Nina Mishra , Aleksandrs Slivkins , Umar Ali Syed
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Techniques and systems are disclosed for returning temporally-aware results from an Internet-based search query. To determine if a query is temporally-based one or more query features are collected and input into a trained classifier, yielding a temporal classification for the query. Further, if a query is classified as temporal, the query results are shifted by determining an alternate set of results for the query, and returning one or more alternate results to one or more users. Based on user interactions with the one or more alternate results, the classifier can be updated, for example, by changing the query to a non-temporal query if the user interactions identify it as such.
摘要翻译：公开了用于从基于因特网的搜索查询返回时间感知结果的技术和系统。为了确定查询是否是基于时间的，一个或多个查询特征被收集并输入到经过训练的分类器中，产生查询的时间分类。此外，如果查询被分类为时间，则通过为查询确定替代的一组结果并将一个或多个替代结果返回给一个或多个用户来移动查询结果。基于与一个或多个替代结果的用户交互，分类器可以被更新，例如，如果用户交互识别它，例如通过将查询改变为非时间查询。

5. 发明授权

US07225118B2 Global data placement 有权
标题翻译：全球数据放置
公开(公告)号：US07225118B2
公开(公告)日：2007-05-29
申请号：US10284098
申请日：2002-10-31
申请人： Qian Wang , Arif Merchant , Nina Mishra , Mahesh Kallahalla , Ram Swaminathan
发明人： Qian Wang , Arif Merchant , Nina Mishra , Mahesh Kallahalla , Ram Swaminathan
IPC分类号： G06F9/45
CPC分类号： G06Q10/10 , H04L67/1002 , H04L67/1008 , H04L67/1095 , H04L69/329
摘要： A method of global data placement. The method includes assigning one or more workloads to one or more compute servers such that each workload flows to one compute server, assigning the data chunks that the workloads accesses to one or more storage servers, and determining how the workloads access the data.
摘要翻译：全球数据放置方法。该方法包括将一个或多个工作负载分配给一个或多个计算服务器，使得每个工作负载流向一个计算服务器，将工作负载访问的数据块分配给一个或多个存储服务器，以及确定工作负载如何访问数据。

6. 发明申请

US20100318546A1 SYNOPSIS OF A SEARCH LOG THAT RESPECTS USER PRIVACY 有权
标题翻译：搜索记录的概要，以表达用户隐私
公开(公告)号：US20100318546A1
公开(公告)日：2010-12-16
申请号：US12485058
申请日：2009-06-16
申请人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
发明人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： Described is releasing output data representing a search log, in which the data is suitable for most data mining/analysis applications, but is safe to publish by preserving user privacy. The search log is processed such that a query is only included if a sufficient count of that query is present; noise may be added. User contributions that are considered may be limited to a maximum number of queries. The output may indicate how often (possibly plus noise) that each query appeared. Other output may comprise a query-action graph, a query-inaction graph and/or a query-reformulation graph, with nodes representing queries and nodes representing actions, inactions or reformulations (e.g., clicked URLs, skipped URLs, or selected related queries), and edges between nodes representing action, skip or selection counts (possibly plus noise). The output may correspond to the top results/related queries returned from a search.
摘要翻译：描述了释放表示搜索日志的输出数据，其中数据适用于大多数数据挖掘/分析应用程序，但通过保护用户隐私来安全地发布。处理搜索日志，使得仅当存在该查询的足够计数时才包括查询; 可能会添加噪音。被考虑的用户贡献可能被限制为最大数量的查询。输出可以指示每个查询出现的频率（可能加噪声）。其他输出可以包括查询动作图，查询反应图和/或查询重构图，其中节点表示查询和节点，表示动作，不作为或重新设定（例如，点击的URL，跳过的URL或选择的相关查询），并且节点之间的边缘表示动作，跳过或选择计数（可能加上噪声）。输出可以对应于从搜索返回的最高结果/相关查询。

7. 发明授权

US07707058B2 Predicting parts needed for an onsite repair using expected waste derived from repair history 失效
标题翻译：使用从修复历史获得的预期废物预测现场维修所需的零件
公开(公告)号：US07707058B2
公开(公告)日：2010-04-27
申请号：US09945193
申请日：2001-08-31
申请人： Henri Jacques Suermondt , George Henry Forman , Nina Mishra
发明人： Henri Jacques Suermondt , George Henry Forman , Nina Mishra
IPC分类号： G06F17/30
CPC分类号： G06Q10/06 , G06Q10/06315 , G06Q10/06375 , G06Q10/06398 , G06Q30/0201
摘要： A method for predicting parts for onsite repair which takes into account a repair history and the costs associated with mis-predictions. Parts for onsite repair of a product are predicted by determining an expected waste for one or more parts of the product. The parts having a lowest expected waste are selected and sent to the onsite repair. The expected waste indicates parts that are responsible for high support costs and highlights the mistakes being made and scores the mistakes by actual cost.
摘要翻译：一种用于预测现场维修部件的方法，其中考虑到维修历史和与误预测相关的成本。通过确定产品的一个或多个部分的预期废物来预测产品的现场维修部件。选择具有最低预期废物的部件并发送到现场维修。预期的浪费表示负责高支持成本的部分，并突出显示出错误，并按实际成本计算错误。

8. 发明授权

US07203864B2 Method and system for clustering computers into peer groups and comparing individual computers to their peers 有权
标题翻译：将计算机集群到对等组中并将各个计算机与其对等体进行比较的方法和系统
公开(公告)号：US07203864B2
公开(公告)日：2007-04-10
申请号：US10876865
申请日：2004-06-25
申请人： Todd Mitchell Goin , Randall Bruce Campbell , James Richard Stinger , Thomas Elliott Fawcett , Douglas William Steele , Nina Mishra , Henri Jacques Suermondt
发明人： Todd Mitchell Goin , Randall Bruce Campbell , James Richard Stinger , Thomas Elliott Fawcett , Douglas William Steele , Nina Mishra , Henri Jacques Suermondt
IPC分类号： G06F11/00
CPC分类号： G06F11/008
摘要： A method and system for identifying clusters of similarly-configured computers. The method, for example, comprises gathering system and business configuration information values from a set of computers. Next, at least a portion of the system and business configuration information values gathered from the set of computers is analyzed along with the numbers of computers that are configured in various ways. Then, using the result of the analysis as a guide, logical expressions of configuration information values are selected for use as definitions of one or more clusters of similarly-configured computers, the selection process generally maximizing the number of computers included within each cluster and also generally maximizing the number of configuration information value specifications included within the definition of each cluster. Then, for one or more clusters so defined and selected, one or more statistics or limit values are generated from one or more configuration information values or both gathered from the subset of computers included in the one or more clusters.
摘要翻译：用于识别类似配置的计算机的群集的方法和系统。该方法例如包括从一组计算机收集系统和业务配置信息值。接下来，分析从该组计算机收集的系统和业务配置信息值的至少一部分以及以各种方式配置的计算机的数量。然后，使用分析结果作为指导，选择配置信息值的逻辑表达式用作一个或多个类似配置的计算机的集群的定义，所述选择过程通常最大化包括在每个集群内的计算机的数量，并且还通常最大化每个集群定义中包含的配置信息值规范的数量。然后，对于如此定义和选择的一个或多个集群，从一个或多个配置信息值或从包含在一个或多个集群中的计算机子集收集的二者生成一个或多个统计值或限制值。

9. 发明授权

US06907380B2 Computer implemented scalable, incremental and parallel clustering based on weighted divide and conquer 有权
标题翻译：基于加权分割和征服的计算机实现可扩展，增量和并行聚类
公开(公告)号：US06907380B2
公开(公告)日：2005-06-14
申请号：US10726254
申请日：2003-12-01
申请人： Nina Mishra , Liadan O'Callaghan , Sudipto Guha , Rajeev Motwani
发明人： Nina Mishra , Liadan O'Callaghan , Sudipto Guha , Rajeev Motwani
IPC分类号： G06K9/62 , G06F101/14 , G06F17/18 , G06F17/30
CPC分类号： G06K9/6218 , Y10S707/99936 , Y10S707/99937
摘要： A technique that uses a weighted divide and conquer approach for clustering a set S of n data points to find k final centers. The technique comprises 1) partitioning the set S into P disjoint pieces S1, . . . , Sp; 2) for each piece Si, determining a set Di of k intermediate centers; 3) assigning each data point in each piece Si to the nearest one of the k intermediate centers; 4) weighting each of the k intermediate centers in each set Di by the number of points in the corresponding piece Si assigned to that center; and 5) clustering the weighted intermediate centers together to find said k final centers, the clustering performed using a specific error metric and a clustering method A.
摘要翻译：一种使用加权分割和征服方法来聚集n个数据点的集合S以找到k个最终中心的技术。该技术包括：1）将集合S划分成P个不相交的部分S 1。。。，S 2）对于每个块S i确定k个中间中心的集合D i i i i， 3）将每个片段S i中的每个数据点分配给k个中间中心中最接近的一个; 4）通过分配给该中心的相应片段S i i中的点的数量对每个集合D i i i中的每个k个中间中心进行加权; 和5）将加权中间体聚类在一起以找到所述k个最终中心，使用特定的误差度量和聚类方法A进行聚类。

10. 发明授权

US08601024B2 Synopsis of a search log that respects user privacy 有权
标题翻译：搜索日志的简要说明，尊重用户隐私
公开(公告)号：US08601024B2
公开(公告)日：2013-12-03
申请号：US12485058
申请日：2009-06-16
申请人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
发明人： Krishnaram Kenthapadi , Aleksandra Korolova , Nina Mishra , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： Described is releasing output data representing a search log, in which the data is suitable for most data mining/analysis applications, but is safe to publish by preserving user privacy. The search log is processed such that a query is only included if a sufficient count of that query is present; noise may be added. User contributions that are considered may be limited to a maximum number of queries. The output may indicate how often (possibly plus noise) that each query appeared. Other output may comprise a query-action graph, a query-inaction graph and/or a query-reformulation graph, with nodes representing queries and nodes representing actions, inactions or reformulations (e.g., clicked URLs, skipped URLs, or selected related queries), and edges between nodes representing action, skip or selection counts (possibly plus noise). The output may correspond to the top results/related queries returned from a search.
摘要翻译：描述了释放表示搜索日志的输出数据，其中数据适用于大多数数据挖掘/分析应用程序，但通过保护用户隐私来安全地发布。处理搜索日志，使得仅当存在该查询的足够计数时才包括查询; 可能会添加噪音。被考虑的用户贡献可能被限制为最大数量的查询。输出可以指示每个查询出现的频率（可能加噪声）。其他输出可以包括查询动作图，查询反应图和/或查询重构图，其中节点表示查询和节点，表示动作，不作为或重新设定（例如，点击的URL，跳过的URL或选择的相关查询），并且节点之间的边缘表示动作，跳过或选择计数（可能加上噪声）。输出可以对应于从搜索返回的最高结果/相关查询。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式