Sentence examples for graph comparison from inspiring English sources

As this process relies on graph behaviour comparison, in this paper, we describe different algorithms for graph comparison, and demonstrate, through empirical evaluation in a particular test domain, that we can provide structure-based similarity for graphs that preserves behaviour similarity and can be computed at reasonable cost.

The graph comparison approach tends to be more accurate in calculating structural similarity but is more computationally expensive [50].

Metabolic Tinker [28] uses a heuristic based on similarity of functional groups of atoms and bonds between the current compound and the target compound identified using a graph comparison technique similar to the one described in [47].

Unlike chemical fingerprints, where a pre-determined set of chemical characteristics are used to compare two compounds, the graph comparison approach directly compares the chemical structure of two compounds against each other.

In other words, there would still be more competition for attention when salient features appeared on different objects than on the same object; thus, in either case, people need to be able to focus on the task-relevant feature to make a specific type of graph comparison.

Specifically, we propose that extracting a between-value graph comparison (e.g., "Are there more X than Y?") elicits a serial operation that we refer to as a visual routine (Cavanagh, 2004; Ullman, 1984) in which attention shifts to at least one of the objects in the relation to guide the comparison process.

As a defense mechanism, for the first time, we propose a graph comparison-based approach for identifying anomalies in an electric network DB.

These results are consistent with the proposal that visual routines do not merely facilitate graph comparisons by deploying attention to data points over time; rather, specific visual routines are associated with specific graph interpretations.

By attending to graphs using a task-relevant visual routine and implementing that routine systematically, students may be able to improve their ability to focus on relevant graph comparisons.

Among the algorithms for graph comparisons, graph kernels compare graphs by decomposing the graphs to nontrivial subunits.

A summary of different strategies used for graph comparisons is provided in Table 1.