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

1. 发明授权

US09152705B2 Automatic taxonomy merge 有权
标题翻译：自动分类合并
公开(公告)号：US09152705B2
公开(公告)日：2015-10-06
申请号：US13659844
申请日：2012-10-24
申请人： Wal-Mart Stores, Inc.
发明人： Digvijay Singh Lamba , Namrata PramodKumar Tholiya , Omkar Deshpande
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30731
摘要： A method for merging two taxonomies is disclosed. Top levels of first and second taxonomies are merged. For the second taxonomy nodes are evaluated and selectively merged with nodes of the first taxonomy according to comparison of scores for these nodes with a threshold. The score for a node of the first taxonomy is a combination of one or more of a lineage quality score, Jaccard distance, string edit distance, and category depth score. After an iteration, mergings between nodes of the first and second taxonomies may be reversed if child nodes of the merged nodes were not likewise merged. Iterations may be repeated until no nodes are merged in an iteration.
摘要翻译：公开了一种合并两种分类法的方法。顶级和第二级分类法合并。对于第二个分类，根据这些节点的分数与阈值的比较，评估节点并选择性地与第一个分类的节点合并。第一分类法的节点的分数是一个或多个谱系质量得分，雅可比距离，字符串编辑距离和类别深度得分的组合。在迭代之后，如果合并节点的子节点不被同时合并，则可以颠倒第一和第二分类的节点之间的合并。可以重复迭代，直到没有节点在迭代中合并。

2. 发明授权

US09092547B2 Transforming a graph to a tree in accordance with analyst guidance 有权
标题翻译：根据分析师的指导，将图形转换为树
公开(公告)号：US09092547B2
公开(公告)日：2015-07-28
申请号：US13622975
申请日：2012-09-19
申请人： Wal-Mart Stores, Inc.
发明人： Digvijay Singh Lamba , Omkar Deshpande
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30958 , G06F17/30961
摘要： Methods are disclosed for converting a directed graph to a taxonomy using guidelines from a user. An initial tree is output from a first pruning step in which subtree preferences (and other weights) are applied to preserve or remove paths from a node to one or more levels of descendent nodes. Subtree preferences (and infoboxes) may specify rules for automatically generating recommendations during application to nodes. In a second pruning step, the directed graph is again processed with additional weightings applied to edges in the graph in accordance with the recommendations. The recommendations may be human defined. Recommendations may specify a recommended ancestor for a particular node and may include a weighting to be applied to the recommendation itself, if there are multiple conflicting recommendations for the same node. Recommendations may also specify what standard weight to apply to the edge of the best parent.
摘要翻译：公开了使用来自用户的指南将有向图转换成分类法的方法。从第一个修剪步骤输出初始树，其中应用子树首选项（和其他权重）以保留或删除从节点到一个或多个等级的后代节点的路径。子树偏好（和信息框）可以指定在应用到节点期间自动生成建议的规则。在第二个修剪步骤中，根据建议，再次对有向图进行处理，其中额外的加权应用于图中的边。建议可能是人为的。建议书可以为特定节点指定推荐的祖先，并且如果针对同一节点存在多个冲突建议，则可以包括要应用于推荐本身的加权。建议书还可以规定适用于最佳父母边缘的标准体重。

3. 发明申请

US20140114982A1 AUTOMATIC TAXONOMY MERGE 有权
标题翻译：自动TAXONOMY MERGE
公开(公告)号：US20140114982A1
公开(公告)日：2014-04-24
申请号：US13659844
申请日：2012-10-24
申请人： WAL-MART STORES, INC.
发明人： Digvijay Singh Lamba , Namrata PramodKumar Tholiya , Omkar Deshpande
IPC分类号： G06F17/30
CPC分类号： G06F17/30731
摘要： A method for merging two taxonomies is disclosed. Top levels of first and second taxonomies are merged. For the second taxonomy nodes are evaluated and selectively merged with nodes of the first taxonomy according to comparison of scores for these nodes with a threshold. The score for a node of the first taxonomy is a combination of one or more of a lineage quality score, Jaccard distance, string edit distance, and category depth score. After an iteration, mergings between nodes of the first and second taxonomies may be reversed if child nodes of the merged nodes were not likewise merged. Iterations may be repeated until no nodes are merged in an iteration.
摘要翻译：公开了一种合并两种分类法的方法。顶级和第二级分类法合并。对于第二个分类，根据这些节点的分数与阈值的比较，评估节点并选择性地与第一个分类的节点合并。第一分类法的节点的分数是一个或多个谱系质量得分，雅可比距离，字符串编辑距离和类别深度得分的组合。在迭代之后，如果合并节点的子节点不被同时合并，则可以颠倒第一和第二分类的节点之间的合并。可以重复迭代，直到没有节点在迭代中合并。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式