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

1. 发明授权

US09727642B2 Question pruning for evaluating a hypothetical ontological link 有权
公开(公告)号：US09727642B2
公开(公告)日：2017-08-08
申请号：US14549602
申请日：2014-11-21
申请人： International Business Machines Corporation
发明人： Darryl M. Adderly , Corville O. Allen , Robert K. Tucker
IPC分类号： G06F17/30 , G06F17/27
CPC分类号： G06F17/30734 , G06F17/2785 , G06F17/30687 , G06F17/30976
摘要： Mechanisms for generating a set of questions to evaluate a link between concept entities are provided. A hypothetical link between at least two information concept entities is generated. A set of questions corresponding to the hypothetical link is retrieved and pruned into a subset of questions based on at least one of characteristics of the hypothetical link or characteristics of the at least two information concept entities. The pruned set of questions is processed based on a corpus of evidence to generate a measure of support for or against the hypothetical link being an actual link between the at least two information concept entities. A validity indication for the hypothetical link indicating whether or not the hypothetical link is an actual link between the at least two information concept entities is output.

2. 发明授权

US09721024B2 Searching for ideograms in an online social network 有权
公开(公告)号：US09721024B2
公开(公告)日：2017-08-01
申请号：US14576926
申请日：2014-12-19
申请人： Facebook, Inc.
发明人： Brian Paihan Sa , Stephen Moore Davis , Nikola Vilimonovic , Jireh Yiwei Tan , Aaron Payne Goldsmid
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/30687
摘要： In one embodiment, a method includes receiving a query inputted at a mobile device of a user of an online social network. The query may include n-grams (e.g., words, emoticons, and punctuation marks), and may be, for example, a message to another user or search terms. N-grams may be mapped to tags, which may, in turn, be mapped to ideograms (i.e., stickers). One or more ideograms may be identified based on the one or more ideogram being associated with tags matching n-grams of the query. For each of the identified ideograms, a probability quantifying how likely the user is to select the ideogram is calculated based on how frequently the ideogram has been used. A set of ideogram suggestions, including one or more of the identified ideograms, is generated based on the probabilities and sent to the user's mobile device for display to the user.

3. 发明授权

US09633085B2 Method for calculating relevancy scores of search results 有权
公开(公告)号：US09633085B2
公开(公告)日：2017-04-25
申请号：US14298043
申请日：2014-06-06
申请人： Macy's West Stores, Inc.
发明人： Denis Kamotsky
IPC分类号： G06F7/02 , G06F17/30
CPC分类号： G06F17/3053 , G06F17/30477 , G06F17/30687 , G06F17/30864 , G06F17/30873
摘要： A method including the steps of: receiving, using one or more processors, a search query containing search terms from a user device; executing, using one or more processors, a query on a database based in response to the received search query; generating, using or more processors, search results based on the executed query; calculating, using one or more processors, a relevancy score for each of the generated search results, wherein the relevancy score is determined based on match properties of the search terms and field terms of a matching field; assigning, using one or more processors, a calculated relevancy score to each of the generated search results; and transmitting, using or more processors, the scored search results for display as a ranked list on the user device.

4. 发明申请

US20170068727A1 DELETION OF ELEMENTS FROM A PROBABILISTIC DATA STRUCTURE 审中-公开
标题翻译：从概念数据结构中删除元素
公开(公告)号：US20170068727A1
公开(公告)日：2017-03-09
申请号：US14849481
申请日：2015-09-09
申请人： Amazon Technologies, Inc.
发明人： Gregory Alan Rubin , Gregory Branchek Roth
IPC分类号： G06F17/30
CPC分类号： G06F17/30687 , G06F17/3033 , G06F17/30483 , G06F17/30631
摘要： A computer system receives a request to remove an entry from a probabilistic data structure. In response to the request, the computer system queries the probabilistic data structure to determine a current iteration value for the entry within the probabilistic data structure. The current iteration value indicates a state of the entry such that a first state corresponds to the entry being a member of a set and a second state corresponds to the absence of the entry from the set. As a result of the current iteration value denoting that the entry is a member of the set, the computer system increments the current iteration value to generate a new iteration value that corresponds to the absence of the entry from the set. The computer system uses the new iteration value and the entry to generate a new output value that is then added to the probabilistic data structure.
摘要翻译：计算机系统接收从概率数据结构中删除条目的请求。响应于该请求，计算机系统查询概率数据结构以确定概率数据结构内的条目的当前迭代值。当前迭代值指示条目的状态，使得第一状态对应于作为集合的成员的条目，并且第二状态对应于来自该集合的条目的不存在。作为当前迭代值的结果，表示条目是该集合的成员，计算机系统将递增当前迭代值以生成对应于该集合中条目不存在的新的迭代值。计算机系统使用新的迭代值和条目来生成新的输出值，然后将其添加到概率数据结构中。

5. 发明授权

US09582571B2 Targeted message response 有权
标题翻译：有针对性的消息响应
公开(公告)号：US09582571B2
公开(公告)日：2017-02-28
申请号：US15004065
申请日：2016-01-22
申请人： International Business Machines Corporation
发明人： Al Chakra , Liam Harpur , John Rice
IPC分类号： H04L12/58 , G06F17/30
CPC分类号： G06F17/3097 , G06F17/30312 , G06F17/30687 , H04L51/00 , H04L51/063 , H04L51/12 , H04L51/32 , H04L69/16
摘要： A tool for targeting a message response. The tool monitors reactions of a user to message subject lines, message content, and social networks. The tool analyzes user interest data and calculates a user interest rating per keyword. Rated keywords are stored in association with the user. When a user drafts a message addressed to a recipient, the tool compares rated keywords within the recipient's log with the subject line and message content. The tool suggests an alternative subject line likely to elicit a faster and more detailed response from the recipient.
摘要翻译：用于定位消息响应的工具。该工具监视用户对消息主题行，消息内容和社交网络的反应。该工具分析用户兴趣数据，并计算每个关键字的用户兴趣等级。额定关键字与用户相关联存储。当用户起草发送给收件人的邮件时，该工具将收件人日志中的评级关键字与主题行和邮件内容进行比较。该工具提出了一个替代主题行，可能会从收件人那里获得更快更详细的回复。

6. 发明授权

US09552425B2 System and method for determining query aspects at appropriate category levels 有权
标题翻译：在适当的类别级别确定查询方面的系统和方法
公开(公告)号：US09552425B2
公开(公告)日：2017-01-24
申请号：US13152174
申请日：2011-06-02
申请人： Qian Zhong , Guanglei Song , Zhaohui Chen
发明人： Qian Zhong , Guanglei Song , Zhaohui Chen
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/30625 , G06F17/30643 , G06F17/30687 , G06F17/30705 , G06F17/30734
摘要： In various example embodiments, a system and method for determining query aspects for appropriate categories is provided. In example embodiments, query data is collected. The query data indicates a query term and tracked user behavior associated with past queries involving the query term. An aspect demand ratio is calculated for each category of a category tree based on the collected query data. Using at least one processor, one or more lowest categories of the category tree that satisfies a category threshold is determined. The one or more lowest categories are then appended to the query term and stored in a database.
摘要翻译：在各种示例实施例中，提供了用于确定适当类别的查询方面的系统和方法。在示例实施例中，收集查询数据。查询数据指示与涉及查询项的过去查询相关联的查询项和跟踪的用户行为。基于收集的查询数据，为类别树的每个类别计算方面需求比率。使用至少一个处理器，确定满足类别阈值的类别树的一个或多个最低类别。然后将一个或多个最低类别附加到查询项并存储在数据库中。

7. 发明授权

US09489412B2 Managing replicated data 有权
标题翻译：管理复制数据
公开(公告)号：US09489412B2
公开(公告)日：2016-11-08
申请号：US14806147
申请日：2015-07-22
申请人： International Business Machines Corporation
发明人： Billy S. Brewer , Kavita Chavda , Nagapramod S. Mandagere , Ramani R. Routray
IPC分类号： G06F17/30 , G06F11/14 , G06F11/34
CPC分类号： G06F17/30321 , G06F11/1458 , G06F11/3409 , G06F17/30312 , G06F17/30336 , G06F17/30345 , G06F17/30528 , G06F17/3053 , G06F17/30554 , G06F17/30575 , G06F17/30619 , G06F17/30622 , G06F17/30687 , G06F2201/81
摘要： An approach for managing replicated data is presented. Metadata is received specifying inter-data correlation(s), inter-replica correlation(s), and data-replica correlation(s) among replicas generated for a system. A unified replication metadata model specifying the correlations is generated. Based on the inter-replica correlation(s), a proper subset of the replicas is selected. Based on the inter-replica and inter-data correlation(s), the selected proper subset of replicas is indexed to generate a unified content index. Based on a current usage of resources, an expected usage and an affinity score for performing an indexing task online or offline are determined. A query is received to locate a data item in at least one of the replicas. Based on the unified content index, the unified replication metadata model, and the query, candidate replica(s) and confidence score(s) indicating likelihood(s) that the candidate replica(s) include the data item are determined.
摘要翻译：介绍了一种管理复制数据的方法。接收到指定为系统生成的副本之间的数据间相关性，副本间相关性和数据副本相关性的元数据。生成指定相关性的统一复制元数据模型。基于副本之间的相关性，选择副本的正确子集。基于副本间和数据间的相关性，将所选择的副本副本进行索引，以生成统一的内容索引。根据资源的当前使用情况，确定在线或离线执行索引任务的预期用途和亲和度分数。接收到查询以在至少一个副本中定位数据项。基于统一内容索引，确定统一复制元数据模型，以及表示候选副本包含数据项的可能性的查询，候选副本和置信度得分。

8. 发明申请

US20160267085A1 PROVIDING ANSWERS TO QUESTIONS HAVING BOTH RANKABLE AND PROBABILISTIC COMPONENTS 有权
标题翻译：提供具有两个可排序和可概述组件的问题的答案
公开(公告)号：US20160267085A1
公开(公告)日：2016-09-15
申请号：US14641467
申请日：2015-03-09
申请人： International Business Machines Corporation
发明人： John Martin Prager
IPC分类号： G06F17/30 , G06N7/00
CPC分类号： G06F17/3043 , G06F17/2785 , G06F17/28 , G06F17/30654 , G06F17/30687 , G06N7/005
摘要： Providing answers to questions. A LAT, a rankable criterion, and a probabilistic criterion are identified in a received query. A set of candidate answers to the question that are instances of the LAT identified in a first data source is generated. Based on the rankable criterion, the candidate answers are ranked. Each candidate answer is assigned a likelihood that the candidate answer satisfies the probabilistic criterion, based on a statistic of occurrences of terms related to the candidate answer and the probabilistic criterion in text passages from a second data source. One or more candidate answers are selected based on the rank and the likelihood of the candidate answers. In another aspect of the invention, a Boolean criterion is also identified in the query and the set of candidate answers is reduced by applying the Boolean criterion.
摘要翻译：提供问题的答案。在接收的查询中标识LAT，排序标准和概率标准。生成在第一数据源中识别的作为LAT的实例的该问题的一组候选答案。根据排名标准，候选人答案排名。根据与候选答案有关的术语的出现的统计量和来自第二数据源的文本段落中的概率标准，候选答案被赋予候选答案满足概率标准的可能性。基于候选答案的等级和可能性来选择一个或多个候选答案。在本发明的另一方面，在查询中也标识了布尔准则，并且通过应用布尔准则来减少候选答案集合。

9. 发明授权

US09411829B2 Image-based faceted system and method 有权
标题翻译：基于图像的分面系统和方法
公开(公告)号：US09411829B2
公开(公告)日：2016-08-09
申请号：US13913943
申请日：2013-06-10
申请人： YAHOO! INC.
发明人： Jia Li , Nadav Golbandi , XianXing Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30274 , G06F17/30253 , G06F17/30256 , G06F17/30687 , G06F17/30713 , G06K9/4642 , G06K9/6223 , G06K9/6226 , G06K9/6262
摘要： Disclosed herein is a system and method that facilitate searching and/or browsing of images by clustering, or grouping, the images into a set of image clusters using facets, such as without limitation visual properties or visual characteristics, of the images, and representing each image cluster by a representative image selected for the image cluster. A map-reduce based probabilistic topic model may be used to identify one or more images belonging to each image cluster and update model parameters.
摘要翻译：本文公开了一种系统和方法，其通过使用小平面（例如但不限于图像的视觉特性或视觉特征）将图像聚类或分组成一组图像群集来促进搜索和/或浏览图像，并且表示每个图像通过为图像集群选择的代表图像进行图像聚类。可以使用基于地图缩减的概率主题模型来识别属于每个图像簇的一个或多个图像和更新模型参数。

10. 发明申请

US20160179927A1 COMPUTER-IMPLEMENTED SYSTEMS AND METHODS FOR COMPARING AND ASSOCIATING OBJECTS 审中-公开
公开(公告)号：US20160179927A1
公开(公告)日：2016-06-23
申请号：US15053305
申请日：2016-02-25
申请人： Palantir Technologies Inc.
发明人： Mark ELLIOT , Allen CHANG
IPC分类号： G06F17/30 , G06Q50/26
CPC分类号： G06F17/30598 , G06F17/30292 , G06F17/30595 , G06F17/30687 , G06F17/30699 , G06F17/30705 , G06F17/3071 , G06Q50/26
摘要： Computer-implemented systems and methods are disclosed for comparing and associating objects. In some embodiments, a method is provided for associating a first object with one or more objects within a plurality of objects, each object comprising a first plurality of properties, each property comprising data reflecting a characteristic of an entity represented by the object, the associated objects comprising matching data in corresponding properties for a second plurality of properties. The method may include executing, for each object within the plurality of objects and for the first object, the following: creating a slug for the object, the slug comprising the second plurality of properties from the object; and inputting the slug for the object into a Bloom filter. Further, the method may include creating for a bin within the Bloom filter corresponding to the slug for the first object, an association between objects whose slugs correspond to the bin if the slugs for those objects match.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式