Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A non-transitory machine-readable medium having executable instructions to cause one or more processing units to perform a method to compute a graph layout of a graph using non-visible metadata edges, the method comprising: receiving graph information of the graph for a plurality of nodes, wherein a first subset of the plurality of nodes are connected by visible edges and the graph is a multi-dimensional graph of at least three dimensions; determining a plurality of metadata edges for a second subset of nodes that are not connected by visible edges, wherein the plurality of metadata edges constrains an inter-nodal distance layout for one or more pairs of nodes of the second subset of the plurality of nodes, each of the plurality of metadata edge are not visible, each of the plurality of metadata edges includes a layout constraint strength that represents a layout force for a node pair associated with that metadata edge and used for computing the graph layout, and each of the plurality of metadata edges is based on at least a similarity between a node pair associated with this metadata edge and a default weight; computing the graph layout of the graph using a simulation involving at least the visible edges and the plurality of metadata edges and the graph layout is a two-dimensional representation of the graph; and presenting the graph layout using a user interface.
A system (non-transitory machine-readable medium with executable instructions for one or more processing units) for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The system receives graph information for multiple nodes, where some nodes are already connected by visible edges. It then identifies additional "metadata edges" for other node pairs that lack visible connections. These metadata edges, which are themselves not visible, impose layout constraints on the inter-nodal distance, acting as forces in the layout computation. Each metadata edge has a strength based on the similarity between the node pair it connects and a default weight. Finally, the system computes a two-dimensional graph layout using a simulation that incorporates both the visible and the non-visible metadata edges, and presents this layout through a user interface.
2. The machine-readable medium of claim 1 , wherein the determining of the plurality of metadata edge comprises: for each possible pair of the plurality of nodes, determining if the possible pair of nodes is connected with a visible edge, and if this possible pair of nodes is not connected with a visible edge, determining if this possible pair of nodes is similar, and if this possible pair of nodes is similar, setting this possible pair of nodes as connected, setting a weight for this possible pair of nodes, and setting an opacity for an edge of the possible pair of nodes to be non-visible.
A system (non-transitory machine-readable medium with executable instructions for one or more processing units) for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The system receives graph information for multiple nodes, where some nodes are already connected by visible edges. It determines additional non-visible "metadata edges" for other node pairs not connected by visible edges by: for each possible node pair, if no visible edge exists, it determines if they are similar. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the system computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
3. The machine-readable medium of claim 2 , wherein the setting of the weight comprises: computing the weight based on at least a similarity value of this possible pair of nodes and the default weight.
A system (non-transitory machine-readable medium with executable instructions for one or more processing units) for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The system receives graph information for multiple nodes, where some nodes are already connected by visible edges. It determines additional non-visible "metadata edges" for other node pairs not connected by visible edges by: for each possible node pair, if no visible edge exists, it determines if they are similar. If similar, the pair is set as connected, and a weight is computed for them based on their similarity value and a default weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the system computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
4. The machine-readable medium of claim 2 , wherein the non-visible opacity for an edge of the possible pair of nodes is zero.
A system (non-transitory machine-readable medium with executable instructions for one or more processing units) for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The system receives graph information for multiple nodes, where some nodes are already connected by visible edges. It determines additional non-visible "metadata edges" for other node pairs not connected by visible edges by: for each possible node pair, if no visible edge exists, it determines if they are similar. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is explicitly set to zero (making it non-visible). These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the system computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
5. The machine-readable medium of claim 2 , wherein this possible pair of nodes is similar if a similarity value for this possible pair of nodes is non-zero.
A system (non-transitory machine-readable medium with executable instructions for one or more processing units) for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The system receives graph information for multiple nodes, where some nodes are already connected by visible edges. It determines additional non-visible "metadata edges" for other node pairs not connected by visible edges by: for each possible node pair, if no visible edge exists, it determines if they are similar. Similarity is defined by a non-zero similarity value between the nodes. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the system computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
6. The machine-readable medium of claim 5 , wherein a similarity value is selected from the group consisting of atomic distance and geo-location.
A system (non-transitory machine-readable medium with executable instructions for one or more processing units) for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The system receives graph information for multiple nodes, where some nodes are already connected by visible edges. It determines additional non-visible "metadata edges" for other node pairs not connected by visible edges by: for each possible node pair, if no visible edge exists, it determines if they are similar. Similarity is defined by a non-zero similarity value, such as atomic distance or geo-location, between the nodes. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the system computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
7. The machine-readable medium of claim 1 , wherein the simulation is a force-directed layout.
A system (non-transitory machine-readable medium with executable instructions for one or more processing units) for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The system receives graph information for multiple nodes, where some nodes are already connected by visible edges. It then identifies additional "metadata edges" for other node pairs that lack visible connections. These metadata edges, which are themselves not visible, impose layout constraints on the inter-nodal distance, acting as forces in the layout computation. Each metadata edge has a strength based on the similarity between the node pair it connects and a default weight. Finally, the system computes a two-dimensional graph layout using a force-directed layout simulation that incorporates both the visible and the non-visible metadata edges, and presents this layout through a user interface.
8. A method to compute a graph using non-visible metadata edges, the method comprising: receiving graph information of the graph for a plurality of nodes, wherein a first subset of the plurality of nodes are connected by visible edges and the graph is a multi-dimensional graph of at least three dimensions; determining a plurality of metadata edges for a second subset of nodes that are not connected by visible edges, wherein the plurality of metadata edges constrains an inter-nodal distance layout for one or more pairs of nodes of the second subset of the plurality of nodes, each of the plurality of metadata edge are not visible, each of the plurality of metadata edges includes a layout constraint strength that represents a layout force for a node pair associated with that metadata edge and used for computing the graph layout, and each of the plurality of metadata edges is based on at least a similarity between a node pair associated with this metadata edge and a default weight; computing the graph layout of the graph using a simulation involving at least the visible edges and the plurality of metadata edges and the graph layout is a two-dimensional representation of the graph; and presenting the layout graph using a user interface.
A method for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The method involves receiving graph information for multiple nodes, where some nodes are already connected by visible edges. It then determines additional "metadata edges" for other node pairs that lack visible connections. These metadata edges, which are themselves not visible, impose layout constraints on the inter-nodal distance, acting as forces in the layout computation. Each metadata edge has a strength based on the similarity between the node pair it connects and a default weight. Finally, the method computes a two-dimensional graph layout using a simulation that incorporates both the visible and the non-visible metadata edges, and presents this layout through a user interface.
9. The method of claim 8 , wherein the determining of the plurality of metadata edge comprises: for each possible pair of the plurality of nodes, determining if the possible pair of nodes is connected with a visible edge, and if this possible pair of nodes is not connected with a visible edge, determining if this possible pair of nodes is similar, and if this possible pair of nodes is similar, setting this possible pair of nodes as connected, setting a weight for this possible pair of nodes, and setting an opacity for an edge of the possible pair of nodes to be non-visible.
A method for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The method involves receiving graph information for multiple nodes, where some nodes are already connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the method performs the following: for each possible node pair, if no visible edge exists, it determines if they are similar. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the method computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
10. The method of claim 9 , wherein the setting of the weight comprises: computing the weight based on at least a similarity value of this possible pair of nodes and the default weight.
A method for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The method involves receiving graph information for multiple nodes, where some nodes are already connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the method performs the following: for each possible node pair, if no visible edge exists, it determines if they are similar. If similar, the pair is set as connected, and a weight is computed for them based on their similarity value and a default weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the method computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
11. The method of claim 9 , wherein the non-visible opacity for an edge of the possible pair of nodes is zero.
A method for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The method involves receiving graph information for multiple nodes, where some nodes are already connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the method performs the following: for each possible node pair, if no visible edge exists, it determines if they are similar. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is explicitly set to zero (making it non-visible). These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the method computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
12. The method of claim 9 , wherein this possible pair of nodes is similar if a similarity value for this possible pair of nodes is non-zero.
A method for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The method involves receiving graph information for multiple nodes, where some nodes are already connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the method performs the following: for each possible node pair, if no visible edge exists, it determines if they are similar. Similarity is defined by a non-zero similarity value between the nodes. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the method computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
13. The method of claim 12 , wherein a similarity value is selected from the group consisting of atomic distance and geo-location.
A method for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The method involves receiving graph information for multiple nodes, where some nodes are already connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the method performs the following: for each possible node pair, if no visible edge exists, it determines if they are similar. Similarity is defined by a non-zero similarity value, such as atomic distance or geo-location, between the nodes. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. Finally, the method computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
14. The method of claim 8 , wherein the simulation is a force-directed layout.
A method for automatically laying out a graph, specifically designed for multi-dimensional graphs of at least three dimensions. The method involves receiving graph information for multiple nodes, where some nodes are already connected by visible edges. It then determines additional "metadata edges" for other node pairs that lack visible connections. These metadata edges, which are themselves not visible, impose layout constraints on the inter-nodal distance, acting as forces in the layout computation. Each metadata edge has a strength based on the similarity between the node pair it connects and a default weight. Finally, the method computes a two-dimensional graph layout using a force-directed layout simulation that incorporates both the visible and the non-visible metadata edges, and presents this layout through a user interface.
15. A device to compute a graph layout of a graph using non-visible metadata edges, the device comprising: a processor; a memory coupled to the processor though a bus; and a process executed from the memory by the processor that causes the process to receive graph information of the graph for a plurality of nodes, wherein a first subset of the plurality of nodes are connected by visible edges, determine a plurality of metadata edges for a second subset of nodes that are not connected by visible edges, compute the graph layout of the graph using a simulation involving at least the visible edges and the plurality of metadata edges, and present the graph using a user interface, wherein the plurality of metadata edges constrains an inter-nodal distance layout for one or more pairs of nodes of the second subset of the plurality of nodes, each of the plurality of metadata edge are not visible, and each of the plurality of metadata edges includes a layout constraint strength that represents a layout force for a node pair associated with that metadata edge and used for computing the graph layout, each of the plurality of metadata edges is based on at least a similarity between a node pair associated with this metadata edge and a default weight, the graph is a multi-dimensional graph of at least three dimension, and the graph layout is a two-dimensional representation of the graph.
A device comprising a processor and memory, configured to automatically lay out a multi-dimensional graph of at least three dimensions using non-visible metadata edges. The device receives graph information for multiple nodes, where some nodes are connected by visible edges. It determines additional non-visible "metadata edges" for other node pairs that lack visible connections. These metadata edges constrain inter-nodal distances, acting as layout forces, with each having a strength based on the node pair's similarity and a default weight. The device then computes a two-dimensional graph layout using a simulation involving both visible and metadata edges, and presents this layout via a user interface.
16. The device of claim 15 , wherein the processor further causes the process to determine of the plurality of metadata edge by, for each possible pair of the plurality of nodes, determining if the possible pair of nodes is connected with a visible edge, and if this possible pair of nodes is not connected with a visible edge, determining if this possible pair of nodes is similar, and if this possible pair of nodes is similar, setting this possible pair of nodes as connected, setting a weight for this possible pair of nodes, and setting an opacity for an edge of the possible pair of nodes to be non-visible.
A device comprising a processor and memory, configured to automatically lay out a multi-dimensional graph of at least three dimensions using non-visible metadata edges. The device receives graph information for multiple nodes, where some nodes are connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the processor causes the device to: for each possible node pair, if no visible edge exists, determine if they are similar. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. The device then computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
17. The device of claim 16 , wherein the processor further causes the process to setting of the weight by, computing the weight based on at least a similarity value of this possible pair of nodes and the default weight.
A device comprising a processor and memory, configured to automatically lay out a multi-dimensional graph of at least three dimensions using non-visible metadata edges. The device receives graph information for multiple nodes, where some nodes are connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the processor causes the device to: for each possible node pair, if no visible edge exists, determine if they are similar. If similar, the pair is set as connected, and a weight is computed for them based on their similarity value and a default weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. The device then computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
18. The device of claim 16 , wherein the non-visible opacity for an edge of the possible pair of nodes is zero.
A device comprising a processor and memory, configured to automatically lay out a multi-dimensional graph of at least three dimensions using non-visible metadata edges. The device receives graph information for multiple nodes, where some nodes are connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the processor causes the device to: for each possible node pair, if no visible edge exists, determine if they are similar. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is explicitly set to zero (making it non-visible). These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. The device then computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
19. The device of claim 16 , wherein this possible pair of nodes is similar if a similarity value for this possible pair of nodes is non-zero.
A device comprising a processor and memory, configured to automatically lay out a multi-dimensional graph of at least three dimensions using non-visible metadata edges. The device receives graph information for multiple nodes, where some nodes are connected by visible edges. To determine additional non-visible "metadata edges" for other node pairs not connected by visible edges, the processor causes the device to: for each possible node pair, if no visible edge exists, determine if they are similar. Similarity is defined by a non-zero similarity value between the nodes. If similar, the pair is set as connected, assigned a weight, and their edge's opacity is set to non-visible. These resulting metadata edges constrain inter-nodal distances, acting as layout forces with a strength based on node similarity and a default weight. The device then computes a two-dimensional graph layout using a simulation incorporating both visible and metadata edges, presenting it via a user interface.
20. The device of claim 15 , wherein the simulation is a force-directed layout.
A device comprising a processor and memory, configured to automatically lay out a multi-dimensional graph of at least three dimensions using non-visible metadata edges. The device receives graph information for multiple nodes, where some nodes are connected by visible edges. It then determines additional non-visible "metadata edges" for other node pairs that lack visible connections. These metadata edges constrain inter-nodal distances, acting as layout forces, with each having a strength based on the node pair's similarity and a default weight. The device then computes a two-dimensional graph layout using a force-directed layout simulation that incorporates both the visible and the non-visible metadata edges, and presents this layout via a user interface.
Unknown
July 28, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.