DDD2010-02 Graph Mining

One way in which data can be represented is as a graph of vertices connected by edges. Each Vertice in the graph will represent one record in the dataset and the edge between them will be weighted according to their similarity as calculated by a similarity measures. Smaller edgeweights will denote vertices that are more similar.

The graphs produced will be input into the GraphView software to produce a visualization of the graph. From these pictures, clusters of vertices can be identfied. Clusters are groups of vertices that are more similar to each other than to the other vertices in the graph.