Class SimplifiedWatset<V,​E>

  • Type Parameters:
    V - the type of nodes in the graph
    E - the type of edges in the graph
    All Implemented Interfaces:
    org.jgrapht.alg.interfaces.ClusteringAlgorithm<V>

    public class SimplifiedWatset<V,​E>
    extends Object
    implements org.jgrapht.alg.interfaces.ClusteringAlgorithm<V>
    A faster and simplified version of Watset that does not need a context similarity measure.

    This is the recommended implementation of the Watset clustering algorithm.

    See Also:
    Ustalov et al. (COLI 45:3)
    • Field Detail

      • graph

        protected final org.jgrapht.Graph<V,​E> graph
        The graph.
      • inducer

        protected final SenseInduction<V,​E> inducer
        The node sense induction approach.
    • Constructor Detail

      • SimplifiedWatset

        public SimplifiedWatset​(org.jgrapht.Graph<V,​E> graph,
                                ClusteringAlgorithmBuilder<V,​E,​?> local,
                                ClusteringAlgorithmBuilder<Sense<V>,​org.jgrapht.graph.DefaultWeightedEdge,​?> global)
        Create an instance of the Simplified Watset clustering algorithm.
        Parameters:
        graph - the graph
        local - the local clustering algorithm supplier
        global - the global clustering algorithm supplier
    • Method Detail

      • builder

        public static <V,​E> SimplifiedWatset.Builder<V,​E> builder()
        Create a builder.
        Type Parameters:
        V - the type of nodes in the graph
        E - the type of edges in the graph
        Returns:
        a builder
      • getClustering

        public WatsetClustering<V> getClustering()
        Specified by:
        getClustering in interface org.jgrapht.alg.interfaces.ClusteringAlgorithm<V>