public class MinimizeDisagreementsClustering extends Object
| Constructor and Description |
|---|
MinimizeDisagreementsClustering(MappedGraph g,
double d) |
MinimizeDisagreementsClustering(salvo.jesus.graph.WeightedGraph g,
double d) |
| Modifier and Type | Method and Description |
|---|---|
Object |
deepCopy(Object oldObj) |
double |
evaluatePair(Cluster c1,
Cluster c2,
salvo.jesus.graph.WeightedGraph graph) |
static MappedGraph |
generateRandomMappedGraph(int size,
double posRand) |
static salvo.jesus.graph.WeightedGraph |
generateRandomWeightedGraph(int size,
double posRand) |
Clustering |
getClustering(List selectVertices) |
Clustering |
getClustering(List selectVertices,
double threshold) |
Clustering |
getClusteringGreedily()
Greedy aglomerative clustering implemented here....
|
int |
getGoods() |
int |
getRemoves() |
static void |
main(String[] args) |
Cluster |
mergeClusters(Cluster c1,
Cluster c2) |
double |
nextBestClustering(Set curClustering,
salvo.jesus.graph.WeightedGraph graph) |
SortedSet |
sortSet(Set origSet,
Comparator c) |
public MinimizeDisagreementsClustering(MappedGraph g, double d)
public MinimizeDisagreementsClustering(salvo.jesus.graph.WeightedGraph g,
double d)
public int getGoods()
public int getRemoves()
public Clustering getClusteringGreedily()
public double nextBestClustering(Set curClustering, salvo.jesus.graph.WeightedGraph graph)
public double evaluatePair(Cluster c1, Cluster c2, salvo.jesus.graph.WeightedGraph graph)
public Clustering getClustering(List selectVertices)
public Clustering getClustering(List selectVertices, double threshold)
public SortedSet sortSet(Set origSet, Comparator c)
public static MappedGraph generateRandomMappedGraph(int size, double posRand)
public static salvo.jesus.graph.WeightedGraph generateRandomWeightedGraph(int size,
double posRand)
public static void main(String[] args)
Copyright © 2019 JULIE Lab, Germany. All rights reserved.