// Finds clusters of size 3.
private Set<Set<Integer>> findMixedClusters(
List<Integer> remaining, Set<Integer> unionPure, Map<Node, Set<Node>> adjacencies) {
Set<Set<Integer>> threeClusters = new HashSet<Set<Integer>>();
if (unionPure.isEmpty()) {
return new HashSet<Set<Integer>>();
}
REMAINING:
while (true) {
if (remaining.size() < 3) break;
ChoiceGenerator gen = new ChoiceGenerator(remaining.size(), 3);
int[] choice;
while ((choice = gen.next()) != null) {
int y = remaining.get(choice[0]);
int z = remaining.get(choice[1]);
int w = remaining.get(choice[2]);
Set<Integer> cluster = new HashSet<Integer>();
cluster.add(y);
cluster.add(z);
cluster.add(w);
// if (!allVariablesDependent(cluster)) {
// continue;
// }
if (!clique(cluster, adjacencies)) {
continue;
}
// Check all x as a cross check; really only one should be necessary.
boolean allX = true;
for (int x : unionPure) {
Set<Integer> _cluster = new HashSet<Integer>(cluster);
_cluster.add(x);
if (!quartetVanishes(_cluster) || !significant(new ArrayList<Integer>(_cluster))) {
allX = false;
break;
}
}
if (allX) {
threeClusters.add(cluster);
unionPure.addAll(cluster);
remaining.removeAll(cluster);
System.out.println(
"3-cluster found: " + variablesForIndices(new ArrayList<Integer>(cluster)));
continue REMAINING;
}
}
break;
}
return threeClusters;
}
