Examples of cs412.hw3.tree.FPTree

cs412.hw3.pattern.Pattern
Represents an FPTree used by FPGrowth Algorithm This FPTree is a recursive structure containing >0 FPTree's at each child could be refactored later into an FPTree and corresponding Nodes, but will leave that for later. @author Jason P. Clow

    StringTokenizer t = new StringTokenizer(line);
    List<Item> items = new ArrayList<Item>();
    
    while(t.countTokens() > 1){
      String item = t.nextToken();
      items.add(new Item(item));
    }
    
    // record the max value found for svm preperation
    Item i = Collections.max(items, new Comparator<Item>() {
    
      public int compare(Item o1, Item o2) {
        return Integer.valueOf(o1.getItemName()).compareTo(Integer.valueOf(o2.getItemName()));
      }
    
    });
    int largest = Integer.valueOf(i.getItemName()).intValue();
    if(Double.isNaN(largestItemFoundInit) ||  largest > largestItemFound){
      largestItemFound = largest;
    }
    String classLabel = t.nextToken();
    Transaction tran = new Transaction(TID++,classLabel,items);

View Full Code Here

          // min sup is not met, so chop off patterns until we meet min sup
           else{ //count < min_sup
           Pattern freqpat = fp.getPattern();
           List<Item> list = freqpat.getPatternBase();
           //add this label to the list so we don't chop off part of the cond pat base until it's count has been calculated
           list.add(new Item(label));
           while(list.size() > 0){
            String tlabel = list.get(0).getItemName();
            list.remove(list.size()-1);
            FPTree temp = tree.getSubTreeByLabel(tlabel);
            for(int i = 1; i<list.size();i++){

View Full Code Here

//    
//    DDPMine m = new DDPMine(tDB,1);
//    List<Pattern> results = m.perform(t.getHeader());
//    System.out.println(results);
    Pattern pp = new Pattern();
    pp.insertItem(new Item("d"));
//    pp.insertItem(new Item("b"));
    ConditionalDB d = tDB.getConditionalDBForPattern(pp);
    FPTree tr = d.buildConditionalFPTree();
    
  }

View Full Code Here


  public Transaction(int tid,String classLabel,String ... item){
    this.tid = tid;
    this.classLabel = classLabel;
    for(int i=0;i<item.length;i++){
      items.add(new Item(item[i]));
    }
  }

View Full Code Here

   * @param maxPatternValue
   */
  private void primePatternMappings(int maxPatternValue){
    int nextIntForMap = ++maxPatternValue;
    for(Pattern p : frequentPatterns){
      Item i = new Item(String.valueOf(nextIntForMap++));
      frequentPatternMappings.put(p, i);
    }
  }

View Full Code Here

    // consider removing and making part of the inputFileReader
    StringTokenizer t = new StringTokenizer(line);
    List<Item> items = new ArrayList<Item>();
    
    while(t.countTokens() > 1){
      items.add(new Item(t.nextToken()));
    }


    String classLabel = t.nextToken();
    Transaction tran = new Transaction(TID++,classLabel,items);
    return tran;

View Full Code Here

    t.processFile("D:\\workspace\\CS412_HW3\\src\\train2.txt");
    t.returnNewFile("c:\\train2Modified2.txt");
  }
  private static void primePattern(Pattern p, Integer ...strings ){
    for(Integer s: strings){
      Item item = new Item(String.valueOf(s));
      p.insertItem(item);
    }
  }

View Full Code Here

        return bestPat;
      }
      for(FrequentPattern fpp: fp){
        System.out.println();
      }
      Item ai = child.getLabel();
      Pattern B = new Pattern(alpha);
      B.insertItem(ai);//with support = ai.support
      double ig_b = myDBRef.IG(B);
      boolean isCovered = myDBRef.isCovered(B);
      if(!isCovered){

View Full Code Here

//    System.out.println(tDB.IG(p));
//    
//    DDPMine m = new DDPMine(tDB,1);
//    List<Pattern> results = m.perform(t.getHeader());
//    System.out.println(results);
    Pattern pp = new Pattern();
    pp.insertItem(new Item("d"));
//    pp.insertItem(new Item("b"));
    ConditionalDB d = tDB.getConditionalDBForPattern(pp);
    FPTree tr = d.buildConditionalFPTree();
    
  }

View Full Code Here

  public static void main(String[] args){
    int max = 73;
    List<Pattern> pats = new ArrayList<Pattern>();
    Integer[][] patterns = new Integer[][]{{27,56}, {8,70,68,66,17,19,9,53,15,44,40,3,64,46,58,34,56,50,38,60,32,54,5,23,62,42,72,37,13,48,11,22,26,2}, {2,26,68,66,17,13,37,72,42,62,23,3,54,32,60,38,50,56,34,58,46,64,7,40,44,15,53,9,19,11,22,49,70}, {4,2,26,22,11,48,13,37,72,42,62,23,64,54,60,38,50,56,34,46,58,5,40,44,15,53,9,19,17,66,68,70,8}, {4,70,49,22,11,19,9,53,15,44,40,7,58,46,34,56,50,38,60,54,64,23,62,42,72,37,13,17,66,68,26,2}, {4,70,68,11,17,13,37,53,15,44,40,7,54,60,38,50,56,34,46,58,23,62,42,72,25,9,19,21,66,49,2}, {68,11,17,13,37,53,15,29,62,54,58,60,38,50,56,34,46,5,23,44,42,72,25,9,19,21,66}, {2,70,49,66,21,19,37,53,15,44,40,3,46,34,56,50,38,60,54,7,62,42,72,25,9,17,11,68,14,24}, {50}};
    for(int i = 0;i<patterns.length;i++){
      pats.add(new Pattern());
    }
    
    List<Pattern> results = new ArrayList<Pattern>();
    for(int i=0;i<pats.size();i++){
      primePattern(pats.get(i), patterns[i]);

View Full Code Here

0 1 2 3

TOP

Related Classes of cs412.hw3.tree.FPTree

cs412.hw3.BranchAndBound

cs412.hw3.data.ConditionalDB

cs412.hw3.data.Transaction

cs412.hw3.data.TransactionDB

cs412.hw3.DatasetTransformer

cs412.hw3.DDPMine

cs412.hw3.InputFileReader

cs412.hw3.item.FrequentItem

cs412.hw3.item.Item

cs412.hw3.Main

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.