2martens/dis
1
0
Fork 0
Code Issues 1 Pull Requests Projects Releases Wiki Activity

Moved main method to top and removed obsolete parameter

Browse Source 
Signed-off-by: Jim Martens <github@2martens.de>
This commit is contained in:
Jim Martens
2017-07-12 14:27:20 +02:00
parent 143aec106c
commit c95234c4ca
1 changed files with 7 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
blatt8/src/blatt8/Apriori.java
View File

@ -15,6 +15,11 @@ public class Apriori {
private static int numItems = 0;
private static int numTransactions = 0;
public static void main(String[] args) {
analyzeTransactionFile();
AprioriAlgorithm();
}
private static void analyzeTransactionFile() {
try (BufferedReader br = new BufferedReader(new FileReader(path))) {
String line;
@ -66,7 +71,7 @@ public class Apriori {
int[] c = new int[k];
System.arraycopy(I1, 0, c, 0, k - 1);
c[k - 1] = itemset[k - 2];
if (!prune(c)) {
if (!prune()) {
candidates.add(c);
}
}
@ -81,31 +86,8 @@ public class Apriori {
}
}
private static boolean prune(int[] c) {
// if(new Random().nextInt(50)==0)return false;
private static boolean prune() {
return false;
// for(int skip=0;skip<c.length;skip++){
// int[] subset = new int[c.length-1];
// for(int i=0;i<c.length-1;i++){
// if(i>=skip)
// subset[i]=c[i+1];
// else
// subset[i]=c[i];
// }
// boolean match=false;
// for(int i=0;i<itemsets.size();i++){
// if(compare(itemsets.get(i),subset)){
// match=true;
// break;
// }
// }
// if(!match)
// return true;
//
// }
// return false;
}
private static boolean contains(int[] a, int[] b) {
@ -184,10 +166,4 @@ public class Apriori {
System.out.println(print);
}
public static void main(String[] args) {
analyzeTransactionFile();
AprioriAlgorithm();
}
}