Node rightChild = encodeNode(rightPredicate, rightDaughter.get(index) - 1, depth + 1, nodeStatus, nodeSize, leftDaughter, rightDaughter, splitAtt, splitValue, schema); Node result = new BranchNode() .setId(id) .setPredicate(predicate) .addNodes(leftChild, rightChild);
static private Node createBranchNode(String score, Predicate predicate){ return new BranchNode() .setScore(score) .setPredicate(predicate); }
Node rightChild = encodeNode(rightPredicate, rightIndex, scoreEncoder, leftChildIDs, rightChildIDs, splitVarIDs, splitValues, terminalClassCounts, rightCategoryManager, schema); Node result = new BranchNode() .setPredicate(predicate) .addNodes(leftChild, rightChild);
@Test public void find(){ Node node1a = new BranchNode(); Node node2b = new BranchNode(); Node node2c = new BranchNode(); Node node3a = new BranchNode(); Node node3b = new LeafNode();
@Test public void visit(){ Node root = new BranchNode() .setPredicate(new True());
@Test public void transform(){ Node node1a = new BranchNode(); Node node2a = new BranchNode(); Node node2b = new LeafNode(); node1a.addNodes(node2a, node2b); Node node3a = new LeafNode(); node2a.addNodes(node3a); assertTrue(node1a.getNodes() instanceof ArrayList); assertTrue(node2a.getNodes() instanceof ArrayList); TreeModel treeModel = new TreeModel(MiningFunction.CLASSIFICATION, new MiningSchema(), node1a); ArrayListTransformer transformer = new ArrayListTransformer(); transformer.applyTo(treeModel); assertTrue(node1a.getNodes() instanceof DoubletonList); assertTrue(node2a.getNodes() instanceof SingletonList); } }
@Override public Node unmarshal(ComplexNode value){ if(value.getRecordCount() != null){ return value; } // End if if(value.hasExtensions() || (value.getPartition() != null) || value.hasScoreDistributions() || (value.getEmbeddedModel() != null)){ return value; } Node node; if(value.hasNodes()){ node = new BranchNode() .setId(value.getId()) .setDefaultChild(value.getDefaultChild()); (node.getNodes()).addAll(value.getNodes()); } else { node = new LeafNode() .setId(value.getId()); } node .setScore(value.getScore()) .setPredicate(value.getPredicate()); return node; }
@Test public void parseAndIntern(){ Node node1a = new BranchNode() .setScore("1") .setPredicate(new True()); .setPredicate(new False()); Node node2b = new BranchNode() .setScore("2.0") .setPredicate(new False());
Node result = new BranchNode() .setId(id) .setPredicate(predicate);
@Override public Node unmarshal(ComplexNode value){ if(value.getRecordCount() != null){ return value; } // End if if(value.hasExtensions() || (value.getPartition() != null) || value.hasScoreDistributions() || (value.getEmbeddedModel() != null)){ return value; } Node node; if(value.hasNodes()){ node = new BranchNode() .setId(value.getId()) .setDefaultChild(value.getDefaultChild()); (node.getNodes()).addAll(value.getNodes()); } else { node = new LeafNode() .setId(value.getId()); } node .setScore(value.getScore()) .setPredicate(value.getPredicate()); return node; }
org.dmg.pmml.tree.Node rightChild = encodeNode(rightPredicate, predicateManager, node.cright(), schema); org.dmg.pmml.tree.Node result = new BranchNode() .setId(id)
org.dmg.pmml.tree.Node rightChild = encodeNode(rightPredicate, predicateManager, node.cright(), schema); org.dmg.pmml.tree.Node result = new BranchNode() .setId(id)
Node rightChild = encodeNode(rightPredicate, right, schema); Node result = new BranchNode() .setId(id) .setPredicate(predicate) .addNodes(leftChild, rightChild);
@Test public void jaxbClone() throws Exception { Node node1a = new BranchNode() .setId("1a") .setPredicate(new True());
Node result = new BranchNode() .setId(id) .setDefaultChild(leftward ? leftChild.getId() : rightChild.getId()) .setPredicate(predicate)
Node result = new BranchNode() .setId(id) .setPredicate(predicate);