/* -------------------------------------------------------------------------- */
/*                                                                            */
/*          APRIORI TOTAL FROM PARTIAL SORTED AND PRUNED APPLICATION          */
/*                                                                            */
/*                              Frans Coenen                                  */
/*                                                                            */
/*                              2 July 2002                                   */
/*                                                                            */
/*                     Department of Computer Science                         */
/*                      The University of Liverpool                           */
/*                                                                            */ 
/* -------------------------------------------------------------------------- */

import java.io.*;

public class AprioriTFPsortedPrunedApp {
    
    // ------------------- FIELDS ------------------------
    
    // None
    
    // ---------------- CONSTRUCTORS ---------------------
    
    // None
    
    // ------------------ METHODS ------------------------
    
    public static void main(String[] args) throws IOException {
    
        // Create instance of class PartialSuppoprtTree
	double time1 = (double) System.currentTimeMillis();
	PartialSupportTree newAprioriTFP = new PartialSupportTree(args);
	
	// Read data to be mined from file 
	newAprioriTFP.inputDataSet();
	//newAprioriTFP.outputDataArraySize();
	//newAprioriTFP.outputDataArray();
	
	// Reorder and prune input data according to frequency of single 
	// attributes
	newAprioriTFP.idInputDataOrdering();
	newAprioriTFP.recastInputDataAndPruneUnsupportedAtts();
	//newAprioriTFP.outputDataArray();
	
	// Create P-tree
	newAprioriTFP.createPtree();
	newAprioriTFP.outputPtreeTableStats();
	//newAprioriTFP.outputPtreeTable();
	
	// Create T-tree
	newAprioriTFP.createTotalSupportTree();
	newAprioriTFP.outputDuration(time1,(double) System.currentTimeMillis());
	//newAprioriTFP.outputTtree();
	newAprioriTFP.outputTtreeStats();
	newAprioriTFP.outputNumFreqSets();
	newAprioriTFP.outputNumUpdates();
	newAprioriTFP.outputStorage();
	//newAprioriTFP.outputFrequentSets();
	
	// Generate ARS
	newAprioriTFP.generateARs();
	newAprioriTFP.getCurrentRuleListObject().outputNumRules();
	//newAprioriTFP.getCurrentRuleListObject().outputRules();
	//newAprioriTFP.getCurrentRuleListObject().outputRulesWithReconversion();
	
	// End
	System.exit(1);
	}
    }