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.
1. A method of determining user interest estimations comprising:
determining a threshold disinterest value;
determining a graph based information structure containing at least two nodes;
determining at least one interesting node in the graph based information structure;
for each of the at least one interesting nodes;
determining a set of active nodes that is a subset of the graph, based on the at least one interesting nodes;
repeatedly adding adjacent connected nodes to the set of active nodes, based on a Degree-Of-Interest value and the determined threshold disinterest value.
2. The method of claim 1 , in which interesting nodes are determined based on at least one of: an explicit indication of a focus of attention, and an inferred indication of a focus of attention.
3. The method of claim 1 , in which processing the active nodes is comprised of displaying the active nodes on a display system.
4. The method of claim 1 , in which the step of repeatedly adding nodes adjacent to and connected to the set of active nodes based on the degree of interest values of the nodes is comprised of the steps of:
comparing the Degree-Of-Interest value of an adjacent connected node to the threshold disinterest value; and
adding nodes that are more interesting than the disinterest threshold value to the set of active nodes.
5. The method of claim 1 , having Degree-Of-Interest values based on at least one of: ordered positive values, ordered negative values.
6. The method of claim 1 , having more interesting Degree-Of-Interest values are at least one of: less than a threshold disinterest value, more than a threshold disinterest value.
7. The method of claim 1 , in which at least one interesting node is determined based on a focus of attention.
8. The method of claim 7 , in which the focus of attention is based on tracking indicators of the focus of attention.
9. The method of claim 8 , in which the indicators of the focus of attention include at least one of: eye tracking, head tracking, cursor tracking and speech tracking.
10. The method of claim 1 , in which the graph structure is a hierarchical structure.
11. The method of claim 10 , in which the hierarchical structure is a tree structure.
12. A system for managing user interest estimations comprising:
an input/output circuit for receiving a graph based information structure to be visualized, the graph based information structure comprising at least two nodes;
a threshold disinterest value memory;
an interesting node determination circuit for determining at least one interesting node within the graph based information structure and adding the at least one interesting node to a set of active nodes that is a subset of the graph, in a memory;
a connected node determination circuit that determines candidate active nodes in the graph based information structure adjacent to and connected to each of the active nodes based on the Degree-Of-Interest value determined by a degree of interest determination circuit; and
a processor that adds the determined nodes with Degree-Of-Interest values above the threshold value to the set of active nodes; and
a transformation circuit that processes the active nodes.
13. The system of claim 12 , in which interesting nodes are determined based on at least one of: an explicit indication of a focus of attention, and inferred indication of a focus of attention.
14. The system of claim 12 , in which the transformation circuit is comprised of a display circuit that displays the active nodes on a display system.
15. The system of claim 12 , in which the processor repeatedly adds nodes adjacent to and connected to the set of active nodes based on the degree of interest values of the nodes by comparing the Degree-Of-Interest value of an adjacent connected node to the threshold disinterest value; and adding more interesting nodes to the set of active nodes.
16. The system of claim 12 , in which Degree-Of-Interest values are based on at least one of: ordered positive values, ordered negative values.
17. The system of claim 12 , in which more interesting Degree-Of-Interest values are at least one of: less than a threshold disinterest value, more than a threshold disinterest value.
18. The system of claim 12 , in which at least one interesting node is determined based on a focus of attention.
19. The system of claim 18 , in which the focus of attention is based on tracking indicators of the focus of attention.
20. The system of claim 19 , in which the indicators of the focus of attention are based on at least one of: eye tracking, head tracking, cursor tracking and speech tracking.
21. The system of claim 12 , in which the graph structure is a hierarchical structure.
22. The system of claim 21 , in which the hierarchical structure is a tree structure.
23. Computer readable storage medium comprising: computer readable program code embodied on the computer readable storage medium, the computer readable program code usable to program a computer for determining user interest estimations comprising the steps of:
determining a threshold disinterest value;
determining a graph based information structure containing at least two nodes;
determining at least one interesting node from the graph based information structure;
for each of the at least one interesting nodes;
determining a set of active nodes that is a subset of the graph, based on the at least one interesting nodes;
repeatedly adding adjacent connected nodes to the set of active nodes, based on a Degree-Of-Interest value and the determined threshold disinterest value.
24. A carrier wave encoded to transmit a control program, useable to program a computer to determine user interest estimations, to a device for executing the program, the control program comprising:
instructions for determining a threshold disinterest value;
instructions for determining a graph based information structure containing at least two nodes;
instructions for determining at least one interesting node in the graph based information structure;
instructions for determining a set of active nodes that is a subset of the graph, based on the at least one interesting nodes;
instructions for repeatedly adding adjacent connected nodes to the set of active nodes, based on a Degree-Of-Interest value and the determined threshold disinterest value.
25. A means of determining user interest estimations comprising:
a processor for determining a graph based information structure containing at least two nodes;
a memory for storing the graph based information structure; and
a means for determining a threshold disinterest value;
a means for determining at least one interesting node in the graph based information structure;
a means for determining a set of active nodes in the graph based information structure that is a subset of the graph, based on the at least one interesting nodes for each node in the graph based information structure;
a means for repeatedly adding adjacent connected nodes to the set of active nodes, based on a Degree-Of-Interest value and the determined threshold disinterest value.