Mahout
  1. Mahout
  2. MAHOUT-741

MapReduce job to compute the local clustering coefficient in an undirected graph

    Details

    • Type: New Feature New Feature
    • Status: Closed
    • Priority: Major Major
    • Resolution: Fixed
    • Affects Version/s: 0.6
    • Fix Version/s: 0.6
    • Component/s: Graph
    • Labels:
      None

      Description

      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.

      1. MAHOUT-741.patch
        17 kB
        Sebastian Schelter

        Activity

        No work has yet been logged on this issue.

          People

          • Assignee:
            Sebastian Schelter
            Reporter:
            Sebastian Schelter
          • Votes:
            0 Vote for this issue
            Watchers:
            1 Start watching this issue

            Dates

            • Created:
              Updated:
              Resolved:

              Development