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

1. 发明授权

US08103686B2 Extracting similar entities from lists/tables 有权
标题翻译：从列表/表中提取类似的实体
公开(公告)号：US08103686B2
公开(公告)日：2012-01-24
申请号：US11954218
申请日：2007-12-12
申请人： Sreenivas Gollapudi , Alan Halverson
发明人： Sreenivas Gollapudi , Alan Halverson
IPC分类号： G06F17/30
CPC分类号： G06F17/30663
摘要： Large numbers of lists of entities may be mined for similar entities to related searches. A representation for each list may be determined to provide for a comparison between lists and to support membership checks. A score for an element in a list may be computed that represents the validity of an item in the corpus of lists. Thus, a spurious element would receive a very low score, where a valid element would receive a higher score. A list weight is then computed using the constituent element weights, and the element and list weight are used to compute the nearest neighbors of a given query element.
摘要翻译：大量的实体清单可以被开采用于相关实体进行相关搜索。可以确定每个列表的表示以提供列表之间的比较并且支持成员资格检查。可以计算列表中的元素的分数，其表示列表语料库中的项目的有效性。因此，假元素将获得非常低的分数，其中有效元素将获得更高的分数。然后使用组成元素权重计算列表权重，并使用元素和列表权重来计算给定查询元素的最近邻居。

2. 发明申请

US20090306996A1 RATING COMPUTATION ON SOCIAL NETWORKS 审中-公开
标题翻译：社会网络评估计算
公开(公告)号：US20090306996A1
公开(公告)日：2009-12-10
申请号：US12133370
申请日：2008-06-05
申请人： Panayiotis Tsaparas , Krishnaram N. G. Kenthapadi , Alan Halverson
发明人： Panayiotis Tsaparas , Krishnaram N. G. Kenthapadi , Alan Halverson
IPC分类号： G06Q99/00
CPC分类号： G06Q30/02 , G06Q50/01
摘要： A social network may be used to determine a rating of a user with no prior history. The ratings for unrated nodes may be inferred from the existing ratings of users associated with the unrated node in either or both the underlying social network or other social networks. Additionally in some implementations, the effect of the rating of a rated node to an unrated node diminishes as the strength of their relationships decreases. In some cases, a social network may be modeled as an electrical network, and ratings may be modeled as voltages on the nodes of the social network, relationships in the social network may be modeled as connections in the electrical network, and in some cases the strength of relationships may be modeled as conductance of the connections. Ratings for nodes may be determined using Kirchhoff's Law and in some cases by solving a set of linear equations or by propagating positive and negative ratings using a random walk with absorbing states.
摘要翻译：可以使用社交网络来确定没有先前历史的用户的评级。对未分配节点的评级可以从在基础社交网络或其他社交网络中的任一个或两者中与未分级节点相关联的用户的现有评级推断。另外在一些实施方式中，额定节点的额定值对未分级节点的影响随着其关系的强度减小而减小。在某些情况下，社交网络可能被建模为电网，评级可以被建模为社交网络节点上的电压，社交网络中的关系可以被建模为电网中的连接，并且在某些情况下关系的力量可能被建模为连接的传导。可以使用基尔霍夫定律确定节点的等级，并且在某些情况下通过求解一组线性方程式，或者通过使用具有吸收状态的随机游走来传播正和负的额定值。

3. 发明申请

US20090157644A1 EXTRACTING SIMILAR ENTITIES FROM LISTS / TABLES 有权
标题翻译：从列表/表提取类似实体
公开(公告)号：US20090157644A1
公开(公告)日：2009-06-18
申请号：US11954218
申请日：2007-12-12
申请人： Sreenivas Gollapudi , Alan Halverson
发明人： Sreenivas Gollapudi , Alan Halverson
IPC分类号： G06F7/06
CPC分类号： G06F17/30663
摘要： Large numbers of lists of entities may be mined for similar entities to related searches. A representation for each list may be determined to provide for a comparison between lists and to support membership checks. A score for an element in a list may be computed that represents the validity of an item in the corpus of lists. Thus, a spurious element would receive a very low score, where a valid element would receive a higher score. A list weight is then computed using the constituent element weights, and the element and list weight are used to compute the nearest neighbors of a given query element.
摘要翻译：大量的实体清单可以被开采用于相关实体进行相关搜索。可以确定每个列表的表示以提供列表之间的比较并且支持成员资格检查。可以计算列表中的元素的分数，其表示列表语料库中的项目的有效性。因此，假元素将获得非常低的分数，其中有效元素将获得更高的分数。然后使用组成元素权重计算列表权重，并使用元素和列表权重来计算给定查询元素的最近邻居。

4. 发明申请

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.
摘要翻译：来自点击日志的数据可用于生成搜索引擎的训练数据。可以使用点击的页面以及用户跳过的页面来评估页面与查询的相关性。可以根据点击日志的数据生成训练数据的标签。标签可能与页面与查询的相关性有关。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式