Patent Document ID: 9646057
Application ID: 14452012

Base Claim:
1. A system for discovering important elements that drive an online discussion of a topic, 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 an entity, resulting in a plurality of entities; 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 by paths having path lengths; determining a closeness value for each node based on the path lengths, resulting in a plurality of closeness values; ranking the plurality of entities based on the plurality of closeness values, thereby providing a ranking of the plurality of entities by level of importance in the online discussion; and outputting the ranking of the plurality of entities to a user.

---

Claim 2:
2. The system as set forth in claim 1 , wherein the one or more processors further perform an operation of determining the closeness value for each node according to the following: cl ⁡ ( v ) = 1 1  V  ⁢ ∑ u ∈ V ⁢ d G ⁡ ( u , v ) , where d G (u, v) denotes the shortest path length between nodes u and v, Σ denotes a summation, ε denotes is an element of, and V is the total number of nodes in the graph.