首页> 外国专利> DECISION TREE WITH SET-BASED NODAL COMPARISONS

DECISION TREE WITH SET-BASED NODAL COMPARISONS

机译:具有基于集合的节点比较的决策树

摘要

A computer-implemented method is disclosed for efficiently processing set-based attributes. In the method, a computer system may obtain a plurality of records and a decision tree. The decision tree may include a distinction node corresponding to a comparison of two attributes. The distinction node may have a match path and a no match path extending therefrom. After arriving at the distinction node, the computer system may initiate a process wherein each member of a first set corresponding to a first of the two attributes is to be compared to each member of a second set corresponding to a second of the two attributes. The computer system may depart the distinction node via the match path after the process reveals that at least one member of the first set matches at least one member of the second set.
机译:公开了一种用于高效处理基于集合的属性的计算机实现的方法。在该方法中,计算机系统可以获得多个记录和决策树。决策树可以包括与两个属性的比较相对应的区分节点。区分节点可以具有匹配路径和从其延伸的不匹配路径。在到达区别节点之后,计算机系统可以发起处理,其中将与两个属性中的第一个相对应的第一组的每个成员与与两个属性中的第二个相对应的第二组的每个成员进行比较。在过程揭示出第一集合的至少一个成员与第二集合的至少一个成员相匹配之后,计算机系统可以经由匹配路径离开区分节点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号