Java* API Reference for Intel® Data Analytics Acceleration Library 2018 Update 2

DtRegTraverseModel.java

/* file: DtRegTraverseModel.java */
/*******************************************************************************
* Copyright 2014-2018 Intel Corporation
* All Rights Reserved.
*
* If this software was obtained under the Intel Simplified Software License,
* the following terms apply:
*
* The source code, information and material ("Material") contained herein is
* owned by Intel Corporation or its suppliers or licensors, and title to such
* Material remains with Intel Corporation or its suppliers or licensors. The
* Material contains proprietary information of Intel or its suppliers and
* licensors. The Material is protected by worldwide copyright laws and treaty
* provisions. No part of the Material may be used, copied, reproduced,
* modified, published, uploaded, posted, transmitted, distributed or disclosed
* in any way without Intel's prior express written permission. No license under
* any patent, copyright or other intellectual property rights in the Material
* is granted to or conferred upon you, either expressly, by implication,
* inducement, estoppel or otherwise. Any license under such intellectual
* property rights must be express and approved by Intel in writing.
*
* Unless otherwise agreed by Intel in writing, you may not remove or alter this
* notice or any other notice embedded in Materials by Intel or Intel's
* suppliers or licensors in any way.
*
*
* If this software was obtained under the Apache License, Version 2.0 (the
* "License"), the following terms apply:
*
* You may not use this file except in compliance with the License. You may
* obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
*
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*
* See the License for the specific language governing permissions and
* limitations under the License.
*******************************************************************************/
/*
// Content:
// Java example of decision tree regression model traversal
//
// The program trains the decision tree regression model on a training
// datasetFileName and prints the trained model by its depth-first traversing.
*/
package com.intel.daal.examples.decision_tree;
import com.intel.daal.algorithms.regression.TreeNodeVisitor;
import com.intel.daal.algorithms.decision_tree.regression.Model;
import com.intel.daal.algorithms.decision_tree.regression.prediction.*;
import com.intel.daal.algorithms.decision_tree.regression.training.*;
import com.intel.daal.algorithms.decision_tree.*;
import com.intel.daal.data_management.data.NumericTable;
import com.intel.daal.data_management.data.HomogenNumericTable;
import com.intel.daal.data_management.data.MergedNumericTable;
import com.intel.daal.data_management.data_source.DataSource;
import com.intel.daal.data_management.data_source.FileDataSource;
import com.intel.daal.examples.utils.Service;
import com.intel.daal.services.DaalContext;
import com.intel.daal.data_management.data.*;
class DtRegPrintNodeVisitor extends TreeNodeVisitor {
@Override
public boolean onLeafNode(long level, double response) {
if(level != 0)
printTab(level);
System.out.println("Level " + level + ", leaf node. Response value = " + response);
return true;
}
public boolean onSplitNode(long level, long featureIndex, double featureValue){
if(level != 0)
printTab(level);
System.out.println("Level " + level + ", split node. Feature index = " + featureIndex + ", feature value = " + featureValue);
return true;
}
private void printTab(long level) {
String s = "";
for (long i = 0; i < level; i++) {
s += " ";
}
System.out.print(s);
}
}
class DtRegTraverseModel {
/* Input data set parameters */
private static final String trainDataset ="../data/batch/decision_tree_train.csv";
private static final String pruneDataset ="../data/batch/decision_tree_prune.csv";
private static final int nFeatures = 5; /* Number of features in training and testing data sets */
private static DaalContext context = new DaalContext();
public static void main(String[] args) throws java.io.FileNotFoundException, java.io.IOException {
TrainingResult trainingResult = trainModel();
printModel(trainingResult);
context.dispose();
}
private static TrainingResult trainModel() {
/* Retrieve the data from the input data sets */
FileDataSource trainDataSource = new FileDataSource(context, trainDataset,
DataSource.DictionaryCreationFlag.DoDictionaryFromContext,
DataSource.NumericTableAllocationFlag.NotAllocateNumericTable);
/* Create Numeric Tables for training data and dependent variables */
NumericTable trainData = new HomogenNumericTable(context, Float.class, nFeatures, 0, NumericTable.AllocationFlag.NotAllocate);
NumericTable trainGroundTruth = new HomogenNumericTable(context, Float.class, 1, 0, NumericTable.AllocationFlag.NotAllocate);
MergedNumericTable mergedData = new MergedNumericTable(context);
mergedData.addNumericTable(trainData);
mergedData.addNumericTable(trainGroundTruth);
/* Retrieve the data from an input file */
trainDataSource.loadDataBlock(mergedData);
/* Retrieve the pruning data from the input data sets */
FileDataSource pruneDataSource = new FileDataSource(context, pruneDataset,
DataSource.DictionaryCreationFlag.DoDictionaryFromContext,
DataSource.NumericTableAllocationFlag.NotAllocateNumericTable);
/* Create Numeric Tables for pruning data and dependent variables */
NumericTable pruneData = new HomogenNumericTable(context, Float.class, nFeatures, 0, NumericTable.AllocationFlag.NotAllocate);
NumericTable pruneGroundTruth = new HomogenNumericTable(context, Float.class, 1, 0, NumericTable.AllocationFlag.NotAllocate);
MergedNumericTable pruneMergedData = new MergedNumericTable(context);
pruneMergedData.addNumericTable(pruneData);
pruneMergedData.addNumericTable(pruneGroundTruth);
/* Retrieve the pruning data from an input file */
pruneDataSource.loadDataBlock(pruneMergedData);
/* Create algorithm objects to train the decision tree regression model */
TrainingBatch algorithm = new TrainingBatch(context, Float.class, TrainingMethod.defaultDense);
/* Pass the training data set with labels, and pruning dataset with labels to the algorithm */
algorithm.input.set(TrainingInputId.data, trainData);
algorithm.input.set(TrainingInputId.dependentVariables, trainGroundTruth);
algorithm.input.set(TrainingInputId.dataForPruning, pruneData);
algorithm.input.set(TrainingInputId.dependentVariablesForPruning, pruneGroundTruth);
/* Train the decision forest regression model */
return algorithm.compute();
}
private static void printModel(TrainingResult trainingResult) {
Model m = trainingResult.get(TrainingResultId.model);
DtRegPrintNodeVisitor visitor = new DtRegPrintNodeVisitor();
m.traverseDF(visitor);
}
}

For more complete information about compiler optimizations, see our Optimization Notice.