# US 2008/0307326 A1 · System, method, and service for inducing a pattern of communication among various parties

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

- Number: US 2008/0307326 A1
- Document ID: US20080307326A1
- Status: Published application
- Kind: A1
- Application number: 12/191,667
- Filed: 2008-08-14
- Published: 2008-12-11
- Earliest claimed: 2004-05-14
- Assignees: International Business Machines Corporation
- Inventors: DANIEL Frederick GRUHL; Ramanathan Valdnyanath Guha; Andrew S. Tomkins
- Web page: https://patentgrep.com/patent/US20080307326A1

## CPC

- G06F 16/9535: Search customisation based on user profiles and personalisation
- G06Q 10/44: Identification of trends within social networks, e.g. identification of trending topics
- G06Q 10/46: Determination of level of influence of users within social networking services
- G06Q 10/48: using social graphs
- Y10S 707/99935: Query augmenting and refining, e.g. inexact access
- Y10S 707/99945: Object-oriented database structure processing
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- 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
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

A communication pattern inducing system focuses on the propagation of topics amongst a plurality of nodes based on the text of the node rather than hyperlinks of the node. A node could represent a weblog or any other source of information such as person, a conversation, images, etc. The system utilizes a model for information diffusion, wherein the parameters of the model capture how a new topic spreads from node to node. The system further comprises a process to learn the parameters of the model based on real data and to apply the process to real (or synthetic) node data. Consequently, the system is able to identify particular individuals that are highly effective at contributing to the spread of topics.

## Claims

### Claim 1

A computer program product having executable instruction codes for inducing a pattern of communication among a plurality of parties communicating information, comprising the executable instructions for:
receiving during a first episode, for each party of a plurality of parties information that describes a topic that is discussed by at least some parties of the plurality of parties at a predetermined and a time of occurrence of discussion;
preparing a transmission graph illustrative of the pattern of communication, wherein the transmission graph illustrates at least some of the parties as nodes and a plurality of edges that interconnect at least some of the nodes, and wherein the transmission graph establishes a pattern of distribution of propagation of discussion of the topic among the plurality of parties; and
outputting the transmission graph storing the transmission graph on a storage repository;
predicting a propagation pattern of the second episode using the pattern of distribution of propagation established for the first episode and an initial fragment of propagation of discussion of a subsequent second episode; and
outputting on a display of a computer system the propagation pattern of the second episode.

### Claim 2 (depends on 2)

The computer program product of claim 2, further comprising:
providing an initial guess for beginning for the preparing the transmission graph by computing a frequency of transmission of the topic and a probability that a node communicates the topic to another node.

### Claim 3 (depends on 2)

The computer program product of claim 2, further comprising:
recursively updating the transmission graph until the transmission graph meets a predetermined criterion by recomputing the frequency of transmission and probability for each one of the plurality of edges.

### Claim 4 (depends on 3)

The computer program product of claim 3, wherein the third set of instruction codes outputs an updated transmission graph.

### Claim 5 (depends on 1)

The computer program product of claim 1, wherein the parties include at least one transmitting party that transmits information about the topic, and at least one receiving party that receives the information about the topic from the at least one transmitting party; and
further comprising, for certain communication paths along the transmission graph, a sixth eighth set of instruction codes for determining a probability that the receiving party writes about the topic.

### Claim 6 (depends on 5)

The computer program product of claim 5, further comprising a seventh ninth set of instruction codes for determining a frequency of communication from the transmitting party to the receiving party.

### Claim 7

A system of inducing a pattern of communication among a plurality of parties communicating information, comprising:
a soft assignment processor receives for receiving for each party of a plurality of parties, information that describes a topic that is discussed by at least some parties of the plurality of parties at a predetermined and a time of occurrence of discussion;
the soft assignment processor further prepares a transmission graph illustrative of the pattern of communication, wherein the transmission graph illustrates at least some of the parties as nodes and a plurality of edges that interconnect at least some of the nodes; and
the soft assignment processor further outputs the transmission graph on a display of a computer system.

### Claim 8 (depends on 7)

The system of claim 7, wherein the soft assignment processor provides an initial guess for begins preparation of the transmission graph by computing a frequency of transmission of the topic and a probability that a node communicates the topic to another node.

### Claim 9 (depends on 8)

The system of claim 8, further comprising a parameter-update processor recursively updates the transmission graph until the transmission graph meets a predetermined criterion by recomputing the frequency of transmission and probability for each one of the plurality of edges.

### Claim 10 (depends on 9)

The system of claim 9, wherein the transmission graph comprises an updated transmission graph.

### Claim 11 (depends on 9)

The system of claim 9, wherein the parties include at least one transmitting party that transmits information about the topic, and at least one receiving party that receives the information about the topic from the at least one transmitting party; and
for certain communication paths along the transmission graph, the parameter-update processor determines a probability that the receiving party writes about the topic.
