Method for gauging public interest in a topic using network analysis of online discussions

Patent metadata

Field	Value
Publication number	US-9639610-B1
Application number	US-201414452129-A
Country	US
Kind code	B1
Filing date	Aug 5, 2014
Priority date	Aug 5, 2013
Publication date	May 2, 2017
Grant date	May 2, 2017

Abstract

Described is system and method for gauging public interest in a topic using network analysis of online discussions. A message from an online discussion related to a specific topic is received as input. The message is analyzed for information related to the message, and a graph comprised of nodes is generated where each node represents information related to the message, such as user name, location, hyperlinks, and annotations. The graph is updated over time as additional messages from the online discussion are received. Additional nodes are generated and linked with at least one of the existing nodes in the graph to form at least one connected component. A normalized diameter of the largest connected component in the graph is determined, and a level of collective focus in the online discussion related to the topic based on the normalized diameter is output to a user.

First claim

What is claimed is:

1. A system for gauging public interest in a topic using network analysis of online discussions, the system comprising:
one or more processors and a non-transitory memory having instructions encoded thereon such that when the instructions are executed, the one or more processors perform operations of:
receiving, as input, a message from an online discussion related to a topic;
analyzing the message for information related to the message;
generating a graph comprising a plurality of nodes, wherein each of the plurality of nodes represents information related to the message;
updating the graph over time as additional messages from the online discussion are received, such that additional nodes are generated and linked with at least one of the plurality of nodes in the graph to form at least one connected component comprising a set of nodes that are linked together by paths;
determining a normalized diameter of the largest connected component in the graph, wherein the diameter of a connected component is the length of the longest path between two nodes in the connected component; and
outputting a level of collective focus in the online discussion related to the topic based on the normalized diameter to a user.

2. The system as set forth in claim 1 , wherein the one or more processors further perform an operation of determining the normalized diameter according to the following:

max

u
,
v

⁢

d
⁡

(

u
,
v

)

n

L
⁡

(
G
)

where max u,v d(u, v) represents a value of the diameter in the largest connected component, and n L(G) is the number of nodes in the largest connected component of a graph G.

3. The system as set forth in claim 2 , wherein the level of collective focus is related to the normalized diameter such that if the normalized diameter decreases, then the level of collective focus increases, and if the normalized diameter increases, then the level of collective focus decreases.

4. The system as set forth in claim 3 , wherein the information related to the message is selected from a group consisting of user information, location information, hyperlink information, and annotation information.

5. The system as set forth in claim 4 , wherein the location information is obtained from at least one of geo-coordinate information related to the message or location information in a user profile from the online discussion.

6. A computer-implemented method for gauging public interest in a topic using network analysis of online discussions, comprising:
an act of causing one or more processors to execute instructions stored on a non-transitory memory such that upon execution, the data processor performs operations of:
receiving, as input, a message from an online discussion related to a topic;
analyzing the message for information related to the message;
generating a graph comprising a plurality of nodes, wherein each of the plurality of nodes represents information related to the message;
updating the graph over time as additional messages from the online discussion are received, such that additional nodes are generated and linked with at least one of the plurality of nodes in the graph to form at least one connected component comprising a set of nodes that are linked together by paths;
determining a normalized diameter of the largest connected component in the graph, wherein the diameter of a connected component is the length of the longest path between two nodes in the connected component; and
outputting a level of collective focus in the online discussion related to the topic based on the normalized diameter to a user.

7. The method as set forth in claim 6 , wherein the one or more processors further perform an operation of determining the normalized diameter according to the following:

max

u
,
v

⁢

d
⁡

(

u
,
v

)

n

L
⁡

(
G
)

where max u,v d(u, v) represents a value of the diameter in the largest connected component, and n L(G) is the number of nodes in the largest connected component of a graph G.

8. The method as set forth in claim 7 , wherein the level of collective focus is related to the normalized diameter such that if the normalized diameter decreases, then the level of collective focus increases, and if the normalized diameter increases, then the level of collective focus decreases.

9. The method as set forth in claim 8 , wherein the information related to the message is selected from a group consisting of user information, location information, hyperlink information, and annotation information.

10. The method as set forth in claim 9 , wherein the location information is obtained from at least one of geo-coordinate information related to the message or location information in a user profile from the online discussion.

11. A computer program product for gauging public interest in a topic using network analysis of online discussions, the computer program product comprising computer-readable instructions stored on a non-transitory computer-readable medium that are executable by a computer having a processor for causing the processor to perform operations of:
receiving, as input, a message from an online discussion related to a topic;
analyzing the message for information related to the message;
generating a graph comprising a plurality of nodes, wherein each of the plurality of nodes represents information related to the message;
updating the graph over time as additional messages from the online discussion are received, such that additional nodes are generated and linked with at least one of the plurality of nodes in the graph to form at least one connected component comprising a set of nodes that are linked together by paths;
determining a normalized diameter of the largest connected component in the graph, wherein the diameter of a connected component is the length of the longest path between two nodes in the connected component; and
outputting a level of collective focus in the online discussion related to the topic based on the normalized diameter to a user.

12. The computer program product as set forth in claim 11 , further comprising instructions

Assignees

• Hrl Lab Llc

Inventors

• Jurgens David A
• Lu Tsai-Ching
• Stmadova Veronika

Classifications

• G06F17/30958

  Physics · mapped topic

• H04L51/32

  Electricity · mapped topic

• G06F17/30864 Primary

  Physics · mapped topic

• H04L51/52 Primary

  for supporting social networking services · CPC title

• G06Q30/00 Primary

  Commerce · CPC title