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

Improved coding style

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

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

@ -7,8 +7,6 @@ import java.util.ArrayList;
import java.util.List; import java.util.List;
public class Apriori { public class Apriori {
private static List<int[]> itemsets = new ArrayList<int[]>(); private static List<int[]> itemsets = new ArrayList<int[]>();
private static float minSup = 0.01f; private static float minSup = 0.01f;
private static String path = "transactions.txt"; private static String path = "transactions.txt";
@ -78,7 +76,7 @@ public class Apriori {
} }
} }
} }
itemsets = new ArrayList<int[]>(candidates); itemsets = new ArrayList<>(candidates);
if (itemsets.size() > 0) { if (itemsets.size() > 0) {
System.out.println(itemsets.size() + " Candidates for k=" + itemsets.get(0).length); System.out.println(itemsets.size() + " Candidates for k=" + itemsets.get(0).length);
} else { } else {
@ -103,15 +101,6 @@ public class Apriori {
return true; return true;
} }
private static boolean compare(int[] a, int[] b) {
for (int i = 0; i < a.length; i++) {
if (a[i] != b[i]) {
return false;
}
}
return true;
}
private static void find_frequent_1_itemsets() { private static void find_frequent_1_itemsets() {
itemsets = new ArrayList<>(); itemsets = new ArrayList<>();
for (int i = 0; i < numItems; i++) { for (int i = 0; i < numItems; i++) {