发明名称 Method for gauging public interest in a topic using network analysis of online discussions
摘要 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.
申请公布号 US9639610(B1) 申请公布日期 2017.05.02
申请号 US201414452129 申请日期 2014.08.05
申请人 HRL Laboratories, LLC 发明人 Jurgens David A.;Lu Tsai-Ching;Stmadova Veronika
分类号 G06F17/30;H04L12/58 主分类号 G06F17/30
代理机构 Tope-McKay & Associates 代理人 Tope-McKay & Associates
主权项 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.
地址 Malibu CA US