Package org.nlpub.watset.graph
Graph processing and clustering.
-
Interface Summary Interface Description ClusteringAlgorithmBuilder<V,E,C extends org.jgrapht.alg.interfaces.ClusteringAlgorithm<V>> A builder for constructing theClusteringAlgorithminstances.MaxMaxClustering<V> A MaxMax clustering.NodeWeighting<V,E> Node weighting for Chinese Whispers.WatsetClustering<V> A Watset clustering. -
Class Summary Class Description ChineseWhispers<V,E> Implementation of the Chinese Whispers algorithm.ChineseWhispers.Builder<V,E> Builder forChineseWhispers.ChineseWhispers.Implementation<V,E> Actual implementation of Chinese Whispers.ComponentsClustering<V,E> A trivial clustering algorithm that treats every connected component as a cluster.ComponentsClustering.Builder<V,E> Builder forComponentsClustering.EmptyClustering<V> A trivial clustering algorithm that returns no clusters.EmptyClustering.Builder<V,E> Builder forEmptyClustering.MarkovClustering<V,E> Naïve implementation of the Markov Clustering (MCL) algorithm.MarkovClustering.Builder<V,E> Builder forMarkovClustering.MarkovClustering.Implementation<V,E> Actual implementation of Markov Clustering.MarkovClustering.InflateVisitor Visitor that raises each element to the power ofMarkovClustering.r.MarkovClustering.NormalizeVisitor Visitor that normalizes columns.MarkovClusteringExternal<V,E> A wrapper for the official implementation of the Markov Clustering (MCL) algorithm in C.MarkovClusteringExternal.Builder<V,E> Builder forMarkovClusteringExternal.MarkovClusteringExternal.Implementation<V,E> Actual implementation of the Markov Clustering wrapper.MaxMax<V,E> Implementation of the MaxMax soft clustering algorithm.MaxMax.Builder<V,E> Builder forMaxMax.MaxMax.Implementation<V,E> Actual implementation of MaxMax.MaxMaxClustering.MaxMaxClusteringImpl<V> Default implementation of the MaxMax clustering.NodeWeightings Useful implementations ofNodeWeighting.NodeWeightings.LabelNodeWeighting<V,E> A trivial and not particularly useful node weighting approach that assigns the current node label as the weight.NodeWeightings.LinearNodeWeighting<V,E> The node weighting approach that chooses the label with the highest total edge weight in the neighborhood divided by the neighbor node degree.NodeWeightings.LogNodeWeighting<V,E> The node weighting approach that chooses the label with the highest total edge weight in the neighborhood divided by the logarithm of the neighbor node degree.NodeWeightings.TopNodeWeighting<V,E> The node weighting approach that chooses the label with the highest total edge weight in the neighborhood.SenseInduction<V,E> A simple graph-based word sense induction approach that clusters node neighborhoods.SimplifiedWatset<V,E> A faster and simplified version of Watset that does not need a context similarity measure.SimplifiedWatset.Builder<V,E> Builder forSimplifiedWatset.SimplifiedWatset.Implementation<V,E> Actual implementation of Simplified Watset.SingletonClustering<V,E> A trivial clustering algorithm that puts every node in a separate cluster.SingletonClustering.Builder<V,E> Builder forSingletonClustering.TogetherClustering<V,E> A trivial clustering algorithm that puts every node together in a single large cluster.TogetherClustering.Builder<V,E> Builder forTogetherClustering.Watset<V,E> Deprecated. Replaced withSimplifiedWatsetWatset.Builder<V,E> Builder forWatset. -
Enum Summary Enum Description NodeWeightings.WeightingMode Weighting modes.