Patent ID: 9529887
Filing Date: 2016-12-27
CPC Classification: G06F,G06Q

Claim Text:
1. A computer-executable method, comprising: identifying for a first graph clustering, by a computer, a first set of vertices in a graph, wherein a respective vertex in the first set of vertices is an exemplar of a respective vertex cluster and a vertex identifier of the vertex identifies the corresponding vertex cluster; identifying a second set of vertices in the graph, wherein a respective vertex in the second set of vertices is not an exemplar of a vertex cluster and the vertex is not associated with a vertex identifier; assigning a vertex identifier of a first vertex in the first set of vertices to a second vertex in the second set of vertices based on an edge between the first vertex and the second vertex, wherein the first vertex and the second vertex represent element in a data set, and wherein the edge represent a type and strength of relationship between the first vertex and the second vertex; wherein the vertex identifiers of the first vertex and the second vertex do not change before convergence; disregarding input from a respective vertex without a vertex identifier for calculation of mode used for assigning a respective vertex identifier a respective vertex in the graph; allocating the first vertex and the second vertex to a first vertex cluster associated with the vertex identifier, wherein the vertex cluster represents information of interest in the data set; and detecting convergence of the first graph clustering based on allocation of vertex identifier to a respective vertex in the second set of vertices.