decisiontree.java

决策树java实现id3算法2006

import java.util.ArrayList;


public class DecisionTree {

	//定义数组，用于装载训练集的数据
	//38行数据，7129个普通属性，1个目标属性
	public static int[][]  primal = new int[38][7130];
	//测试集
	public static int[][]  test = new int[34][7130];
	//训练集的分支点
    public static double[] middle = new double[7129];
	             
	public static void  main(String args[]){
		
	
		ReadTrain rt = new ReadTrain();
		
		rt.Read_in_train();
		
		rt.Make_boolean();
		
		rt.Make_List();
		//System.out.println(rt.last_entropy);
		System.out.println("树的根节点为：" + rt.root);
		
		ID3Node root = new ID3Node(rt.root);
				
        root.insert_leaf(ReadTrain.external,rt.root,root);
        

		
		ReadTest readtest = new ReadTest();
		readtest.Read_in_train();
		readtest.Make_boolean();

        root.compute(root);
        //root.test(root);
		
	}
	
	
	
}