# US 2023/0067265 A1 · Force-directed network calendar

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

- Number: US 2023/0067265 A1
- Document ID: US20230067265A1
- Status: Published application
- Kind: A1
- Application number: 17/411,196
- Filed: 2021-08-25
- Published: 2023-03-02
- Earliest claimed: 2021-08-25
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Lisa Seacat DeLuca; Kelley Anders; Jonathan D. Dunne
- Web page: https://patentgrep.com/patent/US20230067265A1

## CPC

- G06Q 10/1093: Calendar-based scheduling for persons or groups
- G06F 16/24578: {using ranking}
- 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
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method, computer system, and a computer program product for directed calendaring is provided. The present invention may include generating a topic model for each of a plurality of previously conducted meetings based on calendar data for a plurality of users. The present invention may include receiving a scheduled meeting, the scheduled meeting including an initial recipient list. The present invention may include generating a new topic model for the scheduled meeting. The present invention may include identifying a previous meeting with a highest similarity score between the topic model and the new topic model for each of the plurality of users. The present invention may include adjusting the initial recipient list of the scheduled meeting based on a transition matrix.

## Claims

### Claim 1

A method for directed calendaring, the method comprising:
generating a topic model for each of a plurality of previously conducted meetings based on calendar data for a plurality of users;
receiving a scheduled meeting, the scheduled meeting including an initial recipient list;
generating a new topic model for the scheduled meeting;
identifying a previous meeting with a highest similarity score between the topic model and the new topic model for each of the plurality of users; and
adjusting the initial recipient list of the scheduled meeting based on a transition matrix, wherein the transition matrix is determined for each of the plurality of users based on at least participation in the previous meeting and a position within a hierarchal organizational structure.

### Claim 2 (depends on 1)

The method of claim 1, wherein identifying the previous meeting with the highest similarity score for each of the plurality of users further comprises:
determining a similarity score between the topic model for each of the plurality of previously conducted meetings and the new topic model for the scheduled meeting;
weighting each of the similarity scores based on at least recency of the previously conducted meetings and whether the previously conducted meetings are a recurring or a one-time meeting; and
ranking the similarity scores for each of the plurality of users.

### Claim 3 (depends on 1)

The method of claim 1, wherein the transition matrix represents a probability of a user transitioning from a passive to an active state in the scheduled meeting, wherein the transition matrix is determined based on at least the participation of the of the user in the previous meeting with the highest similarity score and the position of the user within the hierarchal organizational structure.

### Claim 4 (depends on 3)

The method of claim 3, wherein the position of the user within the hierarchal organizational structure is determined relative to users of the initial recipient list.

### Claim 5 (depends on 1)

The method of claim 1, wherein the transition matrix is determined for each of the plurality of users using a force-directed conditional calendar model, and wherein the transition matrix depicts a numerical value between 0 and 1.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
absorbing, to an adjusted recipient list, each user where the transition matrix exceeds a threshold; and
deflecting, from the adjusted recipient list, each user where the transition matrix is less than or equal to the threshold.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
generating the adjusted recipient list; and
transmitting the scheduled meeting to the adjusted recipient list.

### Claim 8 (depends on 6)

The method of claim 6, further comprising:
sending a notification to each user deflected from the adjusted recipient list, the notification including an option to monitor a chat transcript of the scheduled meeting, wherein the chat transcript is generated in real time.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
determining a topic profile for each of the plurality of users;
generating a chat transcript for the scheduled meeting in real time; and
sending a notification to join the scheduled meeting to one or more absent users based on at least the chat transcript and the topic profile of the one or more absent users.

### Claim 10

A computer system for directed calendaring, comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage medium, and program instructions stored on at least one of the one or more tangible storage medium for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising:
generating a topic model for each of a plurality of previously conducted meetings based on calendar data for a plurality of users;
receiving a scheduled meeting, the scheduled meeting including an initial recipient list;
generating a new topic model for the scheduled meeting;
identifying a previous meeting with a highest similarity score between the topic model and the new topic model for each of the plurality of users; and
adjusting the initial recipient list of the scheduled meeting based on a transition matrix, wherein the transition matrix is determined for each of the plurality of users based on at least participation in the previous meeting and a position within a hierarchal organizational structure.

### Claim 11 (depends on 10)

The computer system of claim 10, wherein identifying the previous meeting with the highest similarity score for each of the plurality of users further comprises:
determining a similarity score between the topic model for each of the plurality of previously conducted meetings and the new topic model for the scheduled meeting;
weighting each of the similarity scores based on at least recency of the previously conducted meetings and whether the previously conducted meetings are a recurring or a one-time meeting; and
ranking the similarity scores for each of the plurality of users.

### Claim 12 (depends on 10)

The computer system of claim 10, wherein the transition matrix represents a probability of a user transitioning from a passive to an active state in the scheduled meeting, wherein the transition matrix is determined based on at least the participation of the of the user in the previous meeting with the highest similarity score and the position of the user within the hierarchal organizational structure.

### Claim 13 (depends on 12)

The computer system of claim 12, wherein the position of the user within the hierarchal organizational structure is determined relative to users of the initial recipient list.

### Claim 14 (depends on 10)

The computer system of claim 10, wherein the transition matrix is determined for each of the plurality of users using a force-directed conditional calendar model, and wherein the transition matrix depicts a numerical value between 0 and 1.

### Claim 15 (depends on 14)

The computer system of claim 14, further comprising:
absorbing, to an adjusted recipient list, each user where the transition matrix exceeds a threshold; and
deflecting, from the adjusted recipient list, each user where the transition matrix is less than or equal to the threshold.

### Claim 16 (depends on 15)

The computer system of claim 15, further comprising:
generating the adjusted recipient list; and
transmitting the scheduled meeting to the adjusted recipient list.

### Claim 17

A computer program product for directed calendaring, comprising:
one or more non-transitory computer-readable storage media and program instructions stored on at least one of the one or more tangible storage media, the program instructions executable by a processor to cause the processor to perform a method comprising:
generating a topic model for each of a plurality of previously conducted meetings based on calendar data for a plurality of users;
receiving a scheduled meeting, the scheduled meeting including an initial recipient list;
generating a new topic model for the scheduled meeting;
identifying a previous meeting with a highest similarity score between the topic model and the new topic model for each of the plurality of users; and
adjusting the initial recipient list of the scheduled meeting based on a transition matrix, wherein the transition matrix is determined for each of the plurality of users based on at least participation in the previous meeting and a position within a hierarchal organizational structure.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein identifying the previous meeting with the highest similarity score for each of the plurality of users further comprises:
determining a similarity score between the topic model for each of the plurality of previously conducted meetings and the new topic model for the scheduled meeting;
weighting each of the similarity scores based on at least recency of the previously conducted meetings and whether the previously conducted meetings are a recurring or a one-time meeting; and
ranking the similarity scores for each of the plurality of users.

### Claim 19 (depends on 17)

The computer program product of claim 17, wherein the transition matrix represents a probability of a user transitioning from a passive to an active state in the scheduled meeting, wherein the transition matrix is determined based on at least the participation of the of the user in the previous meeting with the highest similarity score and the position of the user within the hierarchal organizational structure.

### Claim 20 (depends on 19)

The computer program product of claim 19, wherein the position of the user within the hierarchal organizational structure is determined relative to users of the initial recipient list.
