US 12,032,634 B1
Graph reclustering based on different clustering criteria
Yijou Chen, Cupertino, CA (US); Harish Kumar Bharat Singh, Mountain View, CA (US); Murat Bog, Fremont, CA (US); and Vikram Kapoor, Cupertino, CA (US)
Assigned to Lacework Inc., Mountain View, CA (US)
Filed by Lacework, Inc., San Jose, CA (US)
Filed on Jan. 18, 2022, as Appl. No. 17/578,031.
Application 17/578,031 is a continuation of application No. 16/726,004, filed on Dec. 23, 2019, granted, now 11,256,759.
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/906 (2019.01); G06F 16/901 (2019.01)
CPC G06F 16/906 (2019.01) [G06F 16/9024 (2019.01); G06F 16/9027 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method, comprising:
generating a logical graph by performing a clustering operation with respect to log data associated with a plurality of machines, the clustering operation performed using a rust clustering criteria and causing the logical graph to initially include a rust set of nodes representative of the machines and generated in accordance with relationship requirements of an underlying model and a first set of edges representing communication between machines represented by nodes included in the first set of nodes; and
augmenting the logical graph by performing a reclustering operation with respect to the log data using a second clustering criteria different than the first clustering criteria, the reclustering operation updating the logical graph to include, in place of the first set of nodes, a second set of nodes representative of the machines and generated while maintaining the relationship requirements of the underlying model and a second set of edges representing communication between machines represented by nodes included in the second set of nodes.