# US 2022/0046086 A1 · System and method for peer group detection, visualization and analysis in identity management artificial intelligence systems using cluster based analysis of network identity graphs

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0046086 A1
- Document ID: US20220046086A1
- Status: Published application
- Kind: A1
- Application number: 17/501,324
- Filed: 2021-10-14
- Published: 2022-02-10
- Earliest claimed: 2018-11-27
- Assignees: Sailpoint Technologies, Inc.
- Applicants: SailPoint Technologies, Inc.
- Inventors: Mohamed M. Badawy; Jostine Fei Ho
- Web page: https://patentgrep.com/patent/US20220046086A1

## CPC

- H04L 67/1044: {Group management mechanisms (management of multicast group membership H04L12/185; reconfiguring of node membership in a computing system to eliminate errors G06F11/1425)}
- G06F 16/345: {Summarisation for human users}
- G06F 16/355: Creation or modification of classes or clusters
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/906: Clustering; Classification
- G06F 21/45: Structures or tools for the administration of authentication
- G06F 21/57: Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- H04L 41/22: comprising specially adapted graphical user interfaces [GUI]
- H04L 63/08: {for authentication of entities (cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32)}
- H04L 63/10: {for controlling access to devices or network resources}
- H04L 63/104: {Grouping of entities}
- H04L 63/1425: {Traffic logging, e.g. anomaly detection}
- H04L 63/1433: {Vulnerability analysis}
- H04L 63/20: {for managing network security; network security policies in general (filtering policies H04L63/0227)}
- H04L 67/1074: for supporting data block transmission mechanisms (file transfer H04L67/06)
- G06N 20/00: Machine learning
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Systems and methods for graph based artificial intelligence systems for identity management systems are disclosed. Embodiments of the identity management systems disclosed herein may utilize a network graph approach to peer grouping of identities of distributed networked enterprise computing environment. Specifically, in certain embodiments, data on the identities and the respective entitlements assigned to each identity as utilized in an enterprise computer environment may be obtained by an identity management system. A network identity graph may be constructed using the identity and entitlement data. The identity graph can then be clustered into peer groups of identities. The peer groups of identities may be used by the identity management system and users thereof in risk assessment or other identity management tasks.

## Claims

### Claim 1

An identity management system, comprising:
a memory;
a processor;
a non-transitory, computer-readable storage medium including computer instructions for:
presenting a peer group interface;
presenting a peer group determined from an identity graph through the peer group interface, wherein the identity graph was created from identity management data, the identity management data utilized in identity management in a distributed enterprise computing environment and comprising data on a first set of identities and a first set of entitlements associated with the first set of identities, wherein the identity graph includes:
a node for each of the first set of identities, and
an edge between a first node and a second node for each first identity and second identity that share at least one entitlement of the first set of entitlements, wherein the first node and the second node respectively represent the first identity and the second identity and where the edge has a weight based on the at least one shared entitlement between the first identity and the second identity; and
wherein the peer group was determined by:
pruning a first set of edges of the identity graph based on each weight associated with each of the first set of edges; and
clustering a second set of identities associated with a second set of entitlements represented in the pruned identity graph into the peer group based on the second set of entitlements, the peer group including a set of nodes of the pruned identity graph representing the second set of identities associated with a second set of edges of the pruned identity graph representing the second set of entitlements.

### Claim 2 (depends on 1)

The identity management system of claim 1, wherein the peer group interface presents a graphical depiction of the peer group determined from the identity graph.

### Claim 3 (depends on 2)

The identity management system of claim 2, wherein a size of the graphical depiction of the peer group is based on a number of the second set of identities.

### Claim 4 (depends on 1)

The identity management system of claim 1, wherein the peer group interface presents data on a cause of the clustering of the second set of identities into the peer group.

### Claim 5 (depends on 1)

The identity management system of claim 1, wherein the peer group interface presents an outlier of the second set of identities or second set of entitlements relative to the peer group.

### Claim 6 (depends on 1)

The identity management system of claim 1, wherein the peer group interface presents data on a distribution of the second set of entitlements or the second set of identities within the peer group.

### Claim 7 (depends on 6)

The identity management system of claim 6, wherein the distribution is associated with a department, job title or location.

### Claim 8

A method, comprising:
presenting a peer group interface;
presenting a peer group determined from an identity graph through the peer group interface, wherein the identity graph was created from identity management data, the identity management data utilized in identity management in a distributed enterprise computing environment and comprising data on a first set of identities and a first set of entitlements associated with the first set of identities, wherein the identity graph includes:
a node for each of the first set of identities, and
an edge between a first node and a second node for each first identity and second identity that share at least one entitlement of the first set of entitlements, wherein the first node and the second node respectively represent the first identity and the second identity and where the edge has a weight based on the at least one shared entitlement between the first identity and the second identity; and
wherein the peer group was determined by:
pruning a first set of edges of the identity graph based on each weight associated with each of the first set of edges; and
clustering a second set of identities associated with a second set of entitlements represented in the pruned identity graph into the peer group based on the second set of entitlements, the peer group including a set of nodes of the pruned identity graph representing the second set of identities associated with a second set of edges of the pruned identity graph representing the second set of entitlements.

### Claim 9 (depends on 8)

The method of claim 8, wherein the peer group interface presents a graphical depiction of the peer group determined from the identity graph.

### Claim 10 (depends on 9)

The method of claim 9, wherein a size of the graphical depiction of the peer group is based on a number of the second set of identities.

### Claim 11 (depends on 8)

The method of claim 8, wherein the peer group interface presents data on a cause of the clustering of the second set of identities into the peer group.

### Claim 12 (depends on 8)

The method of claim 8, wherein the peer group interface presents an outlier of the second set of identities or second set of entitlements relative to the peer group.

### Claim 13 (depends on 8)

The method of claim 8, wherein the peer group interface presents data on a distribution of the second set of entitlements or the second set of identities within the peer group.

### Claim 14 (depends on 13)

The method of claim 13, wherein the distribution is associated with a department, job title or location.

### Claim 15

A non-transitory computer readable medium, comprising instructions for:
presenting a peer group interface;
presenting a peer group determined from an identity graph through the peer group interface, wherein the identity graph was created from identity management data, the identity management data utilized in identity management in a distributed enterprise computing environment and comprising data on a first set of identities and a first set of entitlements associated with the first set of identities, wherein the identity graph includes:
a node for each of the first set of identities, and
an edge between a first node and a second node for each first identity and second identity that share at least one entitlement of the first set of entitlements, wherein the first node and the second node respectively represent the first identity and the second identity and where the edge has a weight based on the at least one shared entitlement between the first identity and the second identity; and
wherein the peer group was determined by:
pruning a first set of edges of the identity graph based on each weight associated with each of the first set of edges; and
clustering a second set of identities associated with a second set of entitlements represented in the pruned identity graph into the peer group based on the second set of entitlements, the peer group including a set of nodes of the pruned identity graph representing the second set of identities associated with a second set of edges of the pruned identity graph representing the second set of entitlements.

### Claim 16 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein the peer group interface presents a graphical depiction of the peer group determined from the identity graph.

### Claim 17 (depends on 16)

The non-transitory computer readable medium of claim 16, wherein a size of the graphical depiction of the peer group is based on a number of the second set of identities.

### Claim 18 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein the peer group interface presents data on a cause of the clustering of the second set of identities into the peer group.

### Claim 19 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein the peer group interface presents an outlier of the second set of identities or second set of entitlements relative to the peer group.

### Claim 20 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein the peer group interface presents data on a distribution of the second set of entitlements or the second set of identities within the peer group.
