/* -------------------------------------------------------------------------- */ /* */ /* D E C I S S I O N T R E E 2 - F I L E A P P L I C A T I O N */ /* (R A N D O M) */ /* */ /* Frans Coenen */ /* */ /* Tuesday 3 January 2012 */ /* */ /* -------------------------------------------------------------------------- */ // Dept Computer Science, University of Liverpool //import lucsKDD_ARM.*; import java.io.*; // Decision tree application class using seperate training and test files and // using frequency of attribute occurance as the "splitting criteria" (so not // really random!). class DecTreeRandom_2file_App { // ------------------- FIELDS ------------------------ // Mone // ---------------- CONSTRUCTORS --------------------- // None // ------------------ METHODS ------------------------ /* MAIN */ public static void main(String[] args) throws IOException { // Create instance of class decisionTree DecTreeRandom newDecisionTree = new DecTreeRandom(args); // Read training input file (method in AssocRuleMining class), and // test inputfile (method in AprioriTFPclass). newDecisionTree.inputDataSet(); newDecisionTree.inputTestDataSet(); // Output opportunity //newDecisionTree.outputDataArray(); //newDecisionTree.outputTestDataArray(); // Process Data double time1 = (double) System.currentTimeMillis(); newDecisionTree.startClassification2file(); newDecisionTree.outputDuration(time1, (double) System.currentTimeMillis()); // Output //newDecisionTree.outputNumClasses(); //newDecisionTree.outputTestDataArray(); //newDecisionTree.outputDataArray(); //newDecisionTree.outputDecTree(); //newDecisionTree.outputRulesWithDefault(); } }