[
https://issues.apache.org/jira/browse/FLINK-3768?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15248425#comment-15248425
]
Greg Hogan commented on FLINK-3768:
-----------------------------------
The global clustering coefficient is simple to compute but fitting this all
together is the challenge. From the Wikipedia page, the global CC is {{3 *
number of triangles / number of connected triplets}}. Triplets can be counted
by summing over {{(vertex degree choose 2)}} and counting triangles already
uses vertex degree.
We can store the triangle count in an accumulator. We can write a graph
algorithm to read vertex degrees and store the triplet count in an accumulator.
And we can create a class which will set this up and then after the user has
executed the program will retrieve the accumulator values and compute the score.
> Clustering Coefficient
> ----------------------
>
> Key: FLINK-3768
> URL: https://issues.apache.org/jira/browse/FLINK-3768
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 1.1.0
> Reporter: Greg Hogan
> Assignee: Greg Hogan
> Fix For: 1.1.0
>
>
> The local clustering coefficient measures the connectedness of each vertex's
> neighborhood. Values range from 0.0 (no edges between neighbors) to 1.0
> (neighborhood is a clique).
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
