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

import java.io.*;

public class AprioriTFPsortedApp {
    
    // ------------------- FIELDS ------------------------
    
    // None
    
    // ---------------- CONSTRUCTORS ---------------------
    
    // None
    
    // ------------------ METHODS ------------------------
    
    public static void main(String[] args) throws IOException {
        // Create instance of class PartialSuppoprtTree
	
	PartialSupportTree newAprioriTFP = new PartialSupportTree(args);
	
	// Read data to be mined from file
	
	newAprioriTFP.inputDataSet();
	
	// Reorder input data according to frequency of single attributes
	
	newAprioriTFP.idInputDataOrdering();
	newAprioriTFP.recastInputData();
	
	// Create P-tree
	
	double time1 = (double) System.currentTimeMillis(); 
	newAprioriTFP.createPtree();
	newAprioriTFP.outputDuration(time1,(double) System.currentTimeMillis());
	
	// Create T-tree
	
	time1 = (double) System.currentTimeMillis(); 
	newAprioriTFP.createTotalSupportTree();
	newAprioriTFP.outputDuration(time1,(double) System.currentTimeMillis());
	 
	// Output 
	
	newAprioriTFP.outputNumFreqSets();
	newAprioriTFP.outputNumUpdates();
	newAprioriTFP.outputStorage();
	newAprioriTFP.outputFrequentSets();
	
	// End
	System.exit(1);
	}
    }