MapReduce job to compute the local clustering coefficient in an undirected graph
--------------------------------------------------------------------------------
Key: MAHOUT-741
URL: https://issues.apache.org/jira/browse/MAHOUT-741
Project: Mahout
Issue Type: New Feature
Components: Graph
Affects Versions: 0.6
Reporter: Sebastian Schelter
Assignee: Sebastian Schelter
Distributed computation of the local clustering coefficient of the vertices of
an undirected graph. The local clustering coefficient is a measure for the
"connectedness" of a vertex in its neighborhood and is computed by dividing the
number of closed triangles with a vertex neighbors by the number of possible
triangles of this vertex with it's neighbours.
http://en.wikipedia.org/wiki/Clustering_coefficient#Local_clustering_coefficient
This measure is easy to compute when we already have enumerated the triangles
of the graph.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
