edu.ucla.sspace.graph

Class WeightedLinkClustering

java.lang.Object

edu.ucla.sspace.graph.LinkClustering

edu.ucla.sspace.graph.WeightedLinkClustering

All Implemented Interfaces:

Serializable

public class WeightedLinkClustering
extends LinkClustering
implements Serializable

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
static String	KEEP_WEIGHT_VECTORS_PROPERTY

Fields inherited from class edu.ucla.sspace.graph.LinkClustering

MINIMUM_EDGE_SIMILARITY_PROPERTY

Constructor Summary

Constructors

Constructor and Description
WeightedLinkClustering()

Method Summary

Methods

Modifier and Type	Method and Description
<E extends WeightedEdge> MultiMap<Integer,Integer>	cluster(WeightedGraph<E> graph, int numClusters, Properties props) Computes the similarity of the graph's edges and merges them until the specified number of clusters has been reached.
<E extends WeightedEdge> MultiMap<Integer,Integer>	cluster(WeightedGraph<E> graph, Properties props) Computes the similarity of the graph's edges using their weights and merges them to select the final partitioning that maximizes the overall cluster density.
protected <E extends Edge> double	getConnectionSimilarity(Graph<E> graph, int keystone, int impost1, int impost2) Computes the similarity of the two edges as the Jaccard index of the neighbors of two impost nodes.

Methods inherited from class edu.ucla.sspace.graph.LinkClustering

cluster, cluster, computeDensity

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

KEEP_WEIGHT_VECTORS_PROPERTY

public static final String KEEP_WEIGHT_VECTORS_PROPERTY

See Also:

Constant Field Values

Constructor Detail

WeightedLinkClustering

public WeightedLinkClustering()

Method Detail

cluster

public <E extends WeightedEdge> MultiMap<Integer,Integer> cluster(WeightedGraph<E> graph,
                                                         int numClusters,
                                                         Properties props)

Computes the similarity of the graph's edges and merges them until the specified number of clusters has been reached.

Parameters:

numClusters - the number of clusters to return

cluster

public <E extends WeightedEdge> MultiMap<Integer,Integer> cluster(WeightedGraph<E> graph,
                                                         Properties props)

Computes the similarity of the graph's edges using their weights and merges them to select the final partitioning that maximizes the overall cluster density.

getConnectionSimilarity

protected <E extends Edge> double getConnectionSimilarity(Graph<E> graph,
                                              int keystone,
                                              int impost1,
                                              int impost2)

Description copied from class: LinkClustering

Computes the similarity of the two edges as the Jaccard index of the neighbors of two impost nodes. The impost nodes are the two nodes the edges do not have in common. Subclasses may override this method to define a new method for computing edge similarity.

Implementation Note: Subclasses that wish to override this behavior should be aware that this method is likely to be called by multiple threads and therefor should make provisions to be thread safe. In addition, this method may be called more than once per edge pair if the similarity matrix is being computed on-the-fly.

Overrides:

getConnectionSimilarity in class LinkClustering

Returns:

the similarity of the edges.a