Package cs412.hw3.item

Examples of cs412.hw3.item.Item

99
100
101
102
103
104
105
106
107
108
  public int getLargestItemFound(){
    return largestItemFound;
  }
 
  public static void main(String args[]){
    TransactionDB db = new TransactionDB(1);
    InputFileReader r = new InputFileReader(db);
    r.processFile("D:\\workspace\\CS412_HW3\\src\\train1.txt");
    System.out.println(db.getTransactions().size());
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
      System.out.println(" Log file will be created in current directory under file name: Jason_DDP_MINE_LOG**.txt where ** is Hour_Minute_Month_Day");
      System.exit(1);
    }
    int min_sup = 6;
    int delta = 2;
    TransactionDB db = new TransactionDB(min_sup);
    InputFileReader r = new InputFileReader(db);
    Log.writeInfoDual(new Date()+" :Processing Transactions...");
    String fileName = args[0];
    r.processFile(fileName);
    Log.writeInfoDual(new Date()+" :Processed Transactions");
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
134
    trans.add( new Transaction(2,"1","d","o","n","k","e","y"));
    trans.add( new Transaction(3,"1","m","a","k","e"));
    trans.add( new Transaction(4,"0","m","u","c","k","y"));
    trans.add( new Transaction(5,"0","c","o","o","k","i","e"));
    int min_sup = 3;
    TransactionDB db = new TransactionDB(min_sup);
    db.addTransactions(trans);
    FPTreeBuilder builder = new FPTreeBuilder(db);
   
    FPTree mainTree = builder.buildTree();
   
    Hashtable<String, List<FrequentPattern>> f = FrequentPatternBuilder.buildConditionalPatternBase(mainTree.getHeader());
View Full Code Here
425
426
427
428
429
430
431
432
433
434
435
        tranItem.add(itemName);
        if(hash.containsKey(itemName)){
          hash.get(itemName).incrementSupport();
        }
        else{
          hash.put(itemName, new FrequentItem(itemName,1));
        }
      }
    }
    List<FrequentItem> sorted = Collections.list(Collections.enumeration(hash.values()));
    Collections.sort(sorted, new Comparator<FrequentItem>() {
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
    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
82
83
84
85
86
87
88
89
90
91
92
          // 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
489
490
491
492
493
494
495
496
497
498
499
//   
//    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
29
30
31
32
33
34
35
36
  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
56
57
58
59
60
61
62
63
64
   * @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
101
102
103
104
105
106
107
108
109
110
111
    // 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
TOP

Related Classes of cs412.hw3.item.Item

  • com.mojang.ld22.crafting.Recipe
  • com.mojang.ld22.screen.CraftingMenu
  • com.mojang.ld22.screen.InventoryMenu
  • cs412.hw3.BranchAndBound
  • cs412.hw3.data.ConditionalDB
  • cs412.hw3.data.Transaction
  • cs412.hw3.data.TransactionDB
  • cs412.hw3.DatasetTransformer
  • cs412.hw3.DDPMine
  • cs412.hw3.InputFileReader
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.