US Patent 10521458 Efficient data clustering

A data processing technique includes: accessing a matrix (M) representing a graph; wherein: the graph comprises a plurality of nodes to be clustered and a plurality of edges; an edge in the plurality of edges represents an association between two of the plurality of nodes; and an entry of the matrix has a corresponding edge among the plurality of edges. The technique further includes performing an operation on the matrix to generate a result matrix, the operation includes a multiplication function on the matrix; and identifying one or more clusters among the plurality of nodes, based at least in part on the result matrix, including detecting one or more vertices among the plurality of nodes using the result matrix.