METHOD OF CLUSTERING MULTI-DIMENSIONAL RELATED DATA IN A COMPUTER DATABASE BY COMBINING THE TWO VERTICES OF A GRAPH CONNECTED BY AN EDGE HAVING THE HIGHEST SCORE

摘要

A method of clustering multi-dimensional relateddata performed by identifying features from a collectionof data, each of said features being represented by avertex (31, 32, 33, 34, 35), selecting pairs of featuresthat it is desirable to cluster together, connecting the pairof vertices representing every selected pair of featuresby an edge (40, 41, 42, 43), assigning a score to everyedge according to a predetermined formula, selectingan edge having the highest score, creating a new vertexby merging the vertices connected by the selected edge(17), creating new edges between the new vertex andthe vertices previously connected to the merged vertices,and repeating this procedure until every edge has apredetermined score.