首页> 外国专利> DATA PROCESSING TO ADDRESS UNREPRESENTATIVENESS

DATA PROCESSING TO ADDRESS UNREPRESENTATIVENESS

机译:处理无法代表的数据

摘要

A method of processing data in a fixed taxonomy in order to address quantitative contradiction and/or unrepresentativeness in the data comprises, commencing at end points of the taxonomy: (i) for each set of parent and children nodes, determining a measure of the parent node properties by suitable (i.e. linear, or non-linear or other logical) combination of the properties of the children nodes and comparing this with the parent node properties in the taxonomy to locate quantitative contradictions between the properties of the parent node and children nodes; (ii) identifying a set of knowable data, the knowable data being a suitable representation of the data in a parent and children node set that is not currently known and that would rectify a perceived contradiction between the properties of the parent node and the children nodes found by comparison step (i); (iii) evaluating a balancing correction required for the knowable parent and children nodes in order to reduce the difference between the properties of the parent node and children nodes towards zero (or optionally to zero, if possible) and applying this correction to all sets of unknown but knowable parent and children node sets; (iv) moving up the taxonomy one level at a time, repeating steps (i) to (iii) taking account of the prior balancing corrections of the nodes subject to balancing corrections in step (iii) for the preceding level when making balancing corrections for ancestors of those nodes; and (v) once the most senior knowable parent node has been balanced, repeating steps (i) to (iii) commencing with the parent and children node set of the most senior knowable parent node and moving down the taxonomy one level at a time, wherein in step (iii) the children nodes are balanced with the parent node without any adjustment to the parent node properties, which remain fixed.
机译:一种处理固定分类法中的数据以解决数据中的定量矛盾和/或不具代表性的方法,该方法包括从分类法的端点开始:(i)对于每组父级和子级节点,确定父级的度量通过子节点属性的适当(即线性,非线性或其他逻辑)组合,将节点属性与分类法中的父节点属性进行比较,以找到父节点和子节点属性之间的定量矛盾; (ii)识别一组已知数据,该已知数据是当前未知的父子节点集中的数据的适当表示,并且将纠正父节点和子节点的属性之间的感知矛盾通过比较步骤(i)发现; (iii)评估已知的父级和子级节点所需的平衡校正,以将父级节点和子级节点的属性之间的差异减小为零(如果可能,可选为零),并将此校正应用于所有的未知但已知的父级和子级节点集; (iv)一次将分类法上移一个级别,重复以下步骤(i)至(iii)进行步骤(iii)的平衡校正时,请考虑先前在步骤(iii)中进行平衡校正的节点的先前平衡校正。这些节点的祖先; (v)一旦最高级的已知父节点达到平衡,请重复步骤(i)至(iii),从最高级的已知父节点的父级和子级节点集开始,并一次将分类法向下移动一个级别,其中,在步骤(iii)中,子节点与父节点保持平衡,而对父节点的属性没有任何调整,其保持固定。

著录项

  • 公开/公告号WO2014060720A9

    专利类型

  • 公开/公告日2014-08-28

    原文格式PDF

  • 申请/专利权人 SCIEMUS LTD.;

    申请/专利号WO2013GB52612

  • 发明设计人 BOYD-LEE ASHLEY;

    申请日2013-10-08

  • 分类号G06F17/30;

  • 国家 WO

  • 入库时间 2022-08-21 15:50:15

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号