Class MaxMax<V,​E>

  • Type Parameters:
    V - the type of nodes in the graph
    E - the type of edges in the graph
    All Implemented Interfaces:
    Clustering<V>

    public class MaxMax<V,​E>
    extends Object
    implements Clustering<V>
    Implementation of the MaxMax soft clustering algorithm.
    See Also:
    Hope & Keller (CICLing 2013)
    • Constructor Detail

      • MaxMax

        public MaxMax​(org.jgrapht.Graph<V,​E> graph)
        Create an instance of the MaxMax algorithm.
        Parameters:
        graph - the graph
    • Method Detail

      • provider

        public static <V,​E> Function<org.jgrapht.Graph<V,​E>,​Clustering<V>> provider()
        A factory function that sets up the algorithm for the given graph.
        Type Parameters:
        V - the type of nodes in the graph
        E - the type of edges in the graph
        Returns:
        a factory function that sets up the algorithm for the given graph
      • fit

        public void fit()
        Description copied from interface: Clustering
        Run the algorithm to induce the parameters of the clusters.
        Specified by:
        fit in interface Clustering<V>
      • getDigraph

        public org.jgrapht.Graph<V,​org.jgrapht.graph.DefaultEdge> getDigraph()
        Return the directed graph representation of the input graph.
        Returns:
        a directed graph
      • getMaximals

        public Map<V,​Set<V>> getMaximals()
        Return the map of nodes to their maximal affinity nodes.
        Returns:
        a map of maximal affinities
      • getRoots

        public Map<V,​Boolean> getRoots()
        Return the map of root and non-root nodes.
        Returns:
        a map of root and non-root nodes