iitb.con.clustering
Class CliqueClustering

java.lang.Object
  iitb.con.clustering.CliqueClustering

public class CliqueClustering
extends java.lang.Object

Clusters the existing instances based on its relationships. Concept networks can be viewed as a directed graph with unit distance between connected vertices. Clustering in ConStore is based on the criterion that if two vertices (entities) are tagged with the same cluster id, the distance between them is less or equal to a given cluster diameter k. One exception is made to this rule in the case of vertices which get singled out in clusters of their own. Such vertices are allowed to merge with a neigbouring cluster. Thus, any two nodes within cluster can be reached in at most k + 1 hops.

Constructor Summary

CliqueClustering()

Method Summary

void	cluster(java.util.Map<java.lang.Integer,java.util.List<ClusterNode>> graph, ClusterNode startNode, short clusterDiameter) Initializes the concept-net graph and the node to start along with cluster diameter

Methods inherited from class java.lang.Object

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

Constructor Detail

CliqueClustering

public CliqueClustering()

Method Detail

cluster

public void cluster(java.util.Map<java.lang.Integer,java.util.List<ClusterNode>> graph,
                    ClusterNode startNode,
                    short clusterDiameter)

Initializes the concept-net graph and the node to start along with cluster diameter

Parameters:

graph - concept-net graph as hash map structure

startNode - start entity node

clusterDiameter - cluster diameter