Systems and methods for the estimation of user interest in graph theoretic structures

摘要

Techniques for estimating user interest in graph structures are provided. A graph structure containing at least two nodes, a threshold disinterest value and at least one interesting node within the graph structure are determined. Each determined interesting node is added to a set of active nodes. Adjacent nodes connected to the set of active nodes and associated with Degree-Of-Interest values more interesting than the threshold disinterest value are in turn added to the set of active nodes until no additional adjacent connected nodes have a Degree-Of-Interest value more interesting than the threshold value. A new visualization of the graph structure is determined based on the nodes in the set of active nodes. The interesting nodes may be determined based on specific indications of interest in a node, such as a mouse selections, or may be based on the user's focus of attention within the graph based information structure.