Patent ID: 9529935
Filing Date: 2016-12-27
CPC Classification: G06F

Claim Text:
1. A computer-executable method, comprising: storing in a storage device of a computer a data set comprising a plurality of data elements; determining, by the computer, a type and strength of relationship between a first and a second data elements in the plurality of data elements; representing the first data element as a first vertex and the second data element as a second vertex in a graph; identifying the first vertex and the second vertex as candidates for establishing a link between the first and the second vertices; determining a link threshold, which represents a measurement to determine whether to connect two vertices using a link, based on an average vertex memory segment per vertex; wherein the average vertex memory segment per vertex is determined by dividing a vertex memory size by number of vertices in the graph; and wherein the vertex memory size is determined by subtracting size of a memory overhead from a size of an allocated memory; determining a link indicator based on a first link count associated with the first vertex and a second link count associated with the second vertex, wherein a link count indicates a sum of respective weights of links of a vertex; determining whether to connect the first and the second vertices with a link for forming a graph cluster based on the link indicator's conformity with the link threshold; and in response to determining the link indicator's conformity with the link threshold, connecting the first and the second vertices with a link for forming a graph cluster.