# US 2024/0005244 A1 · Recommendations over meeting life cycle with user centric graphs and artificial intelligence

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

- Number: US 2024/0005244 A1
- Document ID: US20240005244A1
- Status: Published application
- Kind: A1
- Application number: 17/854,247
- Filed: 2022-06-30
- Published: 2024-01-04
- Earliest claimed: 2022-06-30
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Vipindeep VANGALA; Rajeev GUPTA; Abhishek ARUN; Daniel DECHELOTTE; Sangita N. PITRE; Prakash Kumar PANDEY; Grzegorz S. KUKLA; Sarunas MARCIUSKA
- Web page: https://patentgrep.com/patent/US20240005244A1

## CPC

- G06Q 10/06311: {Scheduling, planning or task assignment for a person or group}
- G06Q 10/0633: Workflow analysis
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Aspects of the present disclosure relate to identifying relationships between entities in a user graph relative to a specific user. The identified relationships may provide user specific insights on related entities from across the enterprise environment. The insights may be provided to the user in a graphical user interface which may organize the insights into categories of information with selectable features to permit user interaction with the insights. Thus, the insights provided from the user graph or user sub-graph according to aspects described herein, may improve productivity and the potential for collaboration across the enterprise environment while reducing user workload.

## Claims

### Claim 1

A system comprising:
at least one processor; and
memory storing instructions that, when executed by the at least one processor, causes the system to perform a set of operations, the set of operations comprising:
receiving a trigger related to an entity of interest;
identifying a user sub-graph on the entity of interest;
analyzing the user sub-graph using a first algorithm to identify a first set of one or more closely related entities;
re-analyzing the user sub-graph using a second algorithm to identify a second set of one or more other closely related entities, the second set of closely related entities being a subset of the first set of closely related entities identified by the first algorithm, wherein the second algorithm is different from the first algorithm;
generating an insight based on the second set of closely related entities; and
displaying the insight on a graphical user interface.

### Claim 2 (depends on 1)

The system of claim 1, wherein the first algorithm is a graph walk algorithm, and the second algorithm is a clustering algorithm, each used in combination with the other to identify one or more closely related entities.

### Claim 3 (depends on 1)

The system of claim 1, wherein the first algorithm is a graph walk algorithm, and the second algorithm is an embedding algorithm, each used in combination with the other to identify one or more closely related entities.

### Claim 4 (depends on 3)

The system of claim 3, further comprising creating an embedding for one or more nodes in the user sub-graph.

### Claim 5 (depends on 1)

The system of claim 1, further comprising ranking the one or more closely related entities for relevance to the entity of interest and importance to the entity of interest.

### Claim 6 (depends on 1)

The system of claim 1, wherein the entity of interest comprises at least one of a meeting, a user, a document, an email, a chat, a team of people within the enterprise, a client list, a meeting agenda, a presentation, a preference, or a task.

### Claim 7 (depends on 1)

The system of claim 1, further comprising filtering the one or more closely related entities.

### Claim 8

A method comprising:
receiving a trigger related to an entity of interest;
identifying a user sub-graph on the entity of interest;
analyzing the user sub-graph using a first algorithm to identify a first set of one or more closely related entities;
re-analyzing the user sub-graph using a second algorithm to identify a second set of one or more other closely related entities, the second set of closely related entities being a subset of the first set of closely related entities identified by the first algorithm, wherein the second algorithm is different from the first algorithm;
generating an insight based on the second set of closely related entities; and
displaying the insight on a graphical user interface.

### Claim 9 (depends on 8)

The method of claim 8, wherein the first algorithm is a clustering algorithm, and the second algorithm is a graph walk algorithm, each used in combination with the other to identify one or more closely related entities.

### Claim 10 (depends on 8)

The method of claim 8, wherein the first algorithm is a clustering algorithm, and the second algorithm is an embedding algorithm, each used in combination with the other to identify one or more closely related entities.

### Claim 11 (depends on 10)

The method of claim 10, further comprising creating an embedding for one or more nodes in the user sub-graph.

### Claim 12 (depends on 8)

The method of claim 8, further comprising ranking the one or more closely related entities for relevance to the entity of interest and importance to the entity of interest.

### Claim 13 (depends on 8)

The method of claim 8, wherein the entity of interest comprises at least one of a meeting, a user, a document, an email, a chat, a team of people within the enterprise, a client list, a meeting agenda, a presentation, a preference, or a task.

### Claim 14 (depends on 8)

The method of claim 8, further comprising filtering the one or more closely related entities.

### Claim 15

A method comprising:
receiving a trigger related to an entity of interest;
identifying a user sub-graph on the entity of interest;
analyzing the user sub-graph using a first algorithm to identify a first set of one or more closely related entities;
re-analyzing the user sub-graph using a second algorithm to identify a second set of one or more other closely related entities, the second set of closely related entities being a subset of the first set of closely related entities identified by the first algorithm, wherein the second algorithm is different from the first algorithm;
generating an insight based on the second set of closely related entities; and
displaying the insight on a graphical user interface.

### Claim 16 (depends on 15)

The method of claim 15, wherein the first algorithm is an embedding algorithm, and the second algorithm is a graph walk algorithm, each used in combination with the other to identify one or more closely related entities.

### Claim 17 (depends on 15)

The method of claim 15, wherein the first algorithm is an embedding algorithm, and the second algorithm is a clustering algorithm, each used in combination with the other to identify one or more closely related entities.

### Claim 18 (depends on 15)

The method of claim 15, further comprising creating an embedding for one or more nodes in the user sub-graph.

### Claim 19 (depends on 15)

The method of claim 15, further comprising ranking the one or more closely related entities for relevance to the entity of interest and importance to the entity of interest.

### Claim 20 (depends on 15)

The method of claim 15, wherein the entity of interest comprises at least one of a meeting, a user, a document, an email, a chat, a team of people within the enterprise, a client list, a meeting agenda, a presentation, a preference, or a task.
