Method of clustering multi-dimensional related data in a computer database by combining the two verticles of a graph connected by an edge having the highest score

A method of clustering multi-dimensional related data in a computer data base, said computer database including a set of data records, each data record storing information about an object of interest, comprising the steps of:

• creating a vertex for at least a subset of objects of interest in said computer database, each of said vertices representing a cluster;
• connecting pairs of vertices with edges, each edge connecting two vertices;
• calculating a score for the edges connecting the vertices using a computer, the score being a measure of how desirable it is to combine the vertices associated therewith;
• selecting one edge having a score indicating a high desirability to combine said two vertices connected by said one edge;
• combining the clusters represented by the two vertices connected by said one edge, the combination resulting in a new cluster;
• creating a new merged vertex representing the new cluster;
• connecting the new merged vertex and at least one preexisting vertex with one or more new edges;
• calculating a new score for the one or more new edges;
• and
• storing remaining clusters in a computer readable medium.

A computer readable storage medium having computer readable code embodied on said computer readable storage medium, said computer readable code for clustering multi-dimensional related data in a computer database, said computer database including a set of data records, each data record storing information about an object of interest, said computer readable code comprising:

• first program code, said first program code establishes a vertex for at least a subset of objects of interest in said computer database, each of said vertices representing a cluster;
• second program code, said second program code connects selected pairs of said vertices with edges, each edge connecting two vertices;
• third program code, said third program code calculates a score for the edges connecting the vertices, the score being a measure of how desirable it is to combine the vertices associated therewith;
• fourth program code, said fourth program code selects two vertices connected with one edge having a score indicating a high desirability to combine the two vertices;
• fifth program code, said fifth program code combines the selected two vertices including combining the clusters represented by the selected two vertices;
• sixth program code, said sixth program code creates a new merged vertex and edges and calculates a new score for the new edges;
• and
• seventh program code, said seventh program code stores remaining clusters in a computer readable medium.