For the local cluster analyses, we used the distance band identified at the global clustering step that showed maximum spatial clustering of FSAs with high non-smoothed SIRs (see Global clustering (Getis-Ord General G) subsection).
global clustering coefficient.
Kernel k-Means is a basis for many state of the art global clustering approaches.
Thus, the quantitative evolution with global clustering validity index permits a correction of each possible grouping.
The exchanged representatives are used to compute representatives for the global clustering solution in a collaborative way.
GCC, which stands for the global clustering coefficient, is a measure of clustering property of a graph.
We use real graph data to evaluate the performance of the LRW global clustering algorithm on heterogeneous graphs.
The global clustering coefficient is computed as the number of triangles divided by the number of connected triplets.
First, when used as a global clustering algorithm, the computational complexity can be high, especially when the graph cluster structure is weak.
This happens because the co-authorship networks are larger (i.e., more nodes and links), and have more complicated topologies (i.e., larger path lengths and higher global clustering coefficients).
(a) Global clustering coefficient of the network and (b) average final overlap of added edges as a function of aggregation time, for the first 2 months.
