Intelligent system and method of optimizing cross-team information flow

Patent metadata

Field	Value
Publication number	US-12586038-B2
Application number	US-202318304296-A
Country	US
Kind code	B2
Filing date	Apr 20, 2023
Priority date	Apr 20, 2023
Publication date	Mar 24, 2026
Grant date	Mar 24, 2026

Abstract

A system and method and for optimizing cross-team information flow in a communication network includes receiving, from a communication application, via a network, a plurality of candidate post items for display to a first user of an organization, each candidate post item being a post item published by another user of the organization and being a post that is accessible to the first user. A communication knowledge network graph which represents communication events that have occurred between users of the organization is then generated where each communication event is represented by a first node that represents a sender, a second node that represents a receiver and an edge that represents the communication event from the sender to the receiver. For each one of the candidate post items, a value of a total information metric for the communication knowledge network is estimated if one of the plurality of candidate posts is viewed by the first user and the plurality of candidate post items are ranked based on the estimated total information metric before transmitting recommendation data to the communication application for recommending the plurality of candidate posts to the user based on the ranking.

First claim

What is claimed is:

1 . A data processing system comprising:
a processor; a network interface for communicating with a plurality of client devices; and a memory in communication with the processor, the memory comprising executable instructions that, when executed by the processor, cause the data processing system to perform functions of: receiving, from a communication application, via a network, a plurality of candidate post items for display to a first user of an organization, each candidate post item being a post item published by a second user of the organization and being a post available for viewing by the first user; generating, in real-time, a temporal communication knowledge network graph which represents communication events that have occurred between users of the organization, each communication event having a sender, a receiver, a departure time, and an arrival time, the graph being continuously updated as new communication events occur, wherein the candidate post items are messages that are shared with and are available for viewing to a group of two or more users of the organization that are a subset of the users of the organization; measuring, using a latency measuring unit executing in the data processing system, an information latency metric that accounts for an age of the most recent information in the temporal communication knowledge network graph, the measuring including computing pairwise latencies using a priority queue algorithm configured to determine minimum age knowledge between nodes; measuring a total information metric for the temporal communication knowledge network graph, the measuring including applying an exponential decay function to model degradation of information along paths and edge weights corresponding to different communication modalities; estimating changes in at least one of the information latency metric or the total information metric if one of the candidate post items is recommended for viewing to the first user; determining, based on the estimated changes, that the one of the candidate post items should be recommended to the first user for viewing to optimize cross-team information flow between the users of in the organization and to reduce system communication latency; and transmitting recommendation data to the communication application, via the network, for recommending the one of the candidate post items to the user for viewing, the recommendation data usable by the communication application to sort the candidate post items according to a ranking of the candidate post items based on a weighted combination of at least the information latency metric and total information metric, wherein the temporal communication knowledge network graph and the recommendation are updated in real-time as new candidate post items are received.

2 . The data processing system of claim 1 , wherein the memory further comprises executable instructions that, when executed by the processor, cause the data processing system to generate a cross-team communication knowledge network from the communication knowledge network, the cross-team communication knowledge network representing communication events between teams in the organization.

3 . The data processing system of claim 2 , wherein generating the cross-team communication knowledge network includes:
determining that a plurality of nodes in the communication knowledge network represent users belonging to one team in the organization; upon determining that the plurality of nodes represents users belonging to the one team, collapsing the plurality of nodes into one node that represents the one team; representing communication events between users belonging to the one team and users belonging to a second team as connecting lines between collapsed nodes that represent the one team and the second team; and removing connecting lines that represent communication events between users that belong to the one team.

4 . The data processing system of claim 1 , wherein the information latency metric measures a latency of the communication knowledge network by measuring a sum of all pairwise latencies between nodes of the communication knowledge network.

5 . The data processing system of claim 4 , wherein a pairwise latency between a first node and a second node of the communication knowledge network measures a shortest amount of time between a departure time of a path in the communication knowledge network leaving the first node and arriving at the second node.

6 . The data processing system of claim 1 , wherein the total information metric for a pair of nodes of the communication knowledge network is a sum of information a first node of the pair of nodes already had about a second node and an amount of information contained in each new edge between the first node and the second node.

7 . The data processing system of claim 1 , wherein the total information metric for the communication knowledge network is a sum of the total information metric for each pair of nodes of the communication knowledge network.

8 . A method for optimizing cross-team information flow in a communication network comprising:
receiving, from a communication application, via a network, a plurality of candidate post items for display to a first user of an organization, each candidate post item being a post item published by another user of the organization and being a post that is accessible to the first user; generating, in real-time, via a knowledge network generating engine, a temporal communication knowledge network graph which represents communication events that have occurred between users of the organization, each communication event being represented by a first node that represents a sender of the communication event, a second node that represents a receiver of the communication event and an edge that represents the communication event from the sender to the receiver, a departure time, and an arrival time, the graph being continuously updated as new communication events occur, wherein the candidate post items are messages that are shared with and are available for viewing to a group of two or more users of the organization that are a subset of the users of the organization; for each one of the plurality of candidate post items, estimating a value of a total information metric for the temporal communication knowledge network if one of the plurality of candidate post items is viewed by the first user, wherein the total information metric accounts for degradation of information along long paths and amount of communication by applying an exponential decay function to model the degradation; ranking the plurality of candidate post items based on the estimated total information metric for each of the plurality of candidate post items; and transmitting recommendation data to the communication application, via the network, for recommending the plurality of candidate post items to the user based on the ranking, the recommendation data usable by the communication application to sort the candidate post items according to ranking based on a weighted combination of at least an information latency metric and the total information metric, wherein the temporal communication knowledge network and the recommendation are updated in real-time as new candidate post items are received.

9 . The method of claim 8 , further comprising:
for each one of the plurality of candidate post items, estimating, using a latency measuring unit, an information latency metric of the communication knowledge network graph if one of the plurality of candidate post items is viewed by the first user; and ranking the plurality of candidate post items based on the estimated total information metric for each of the plur

Assignees

• Microsoft Technology Licensing Llc

Inventors

• Yang Longqi
• Wan Mengting
• Lu Cao
• Neville Jennifer Lynay
• Tomlinson Kiran

Classifications

• G06F16/9024 Primary

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06Q10/101 Primary

  Collaborative creation, e.g. joint development of products or services · CPC title