netkit.classifiers.active
Class GraphCentralityLabeling

java.lang.Object
  extended by netkit.classifiers.active.PickLabelStrategyImp
      extended by netkit.classifiers.active.GraphCentralityLabeling
All Implemented Interfaces:
PickLabelStrategy, Configurable

public class GraphCentralityLabeling
extends PickLabelStrategyImp

Graph Centrality Labeling for Active Learning iteratively picks central nodes in a graph that are in clusters that have no known labels. It uses a modularity based clustering algorithm to iteratively cluster a graph into smaller and smaller clusters until it finds a cluster that has no currently known labels. It then picks the most central node in that cluster.

Various centrality metric strategies are possible (using the metric configuration variable):