Survey: Graph clustering

  • Authors:
  • Satu Elisa Schaeffer

  • Affiliations:
  • Laboratory for Theoretical Computer Science, Helsinki University of Technology TKK, P.O. Box 5400, FI-02015 TKK, Finland

  • Venue:
  • Computer Science Review
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this survey we overview the definitions and methods for graph clustering, that is, finding sets of ''related'' vertices in graphs. We review the many definitions for what is a cluster in a graph and measures of cluster quality. Then we present global algorithms for producing a clustering for the entire vertex set of an input graph, after which we discuss the task of identifying a cluster for a specific seed vertex by local computation. Some ideas on the application areas of graph clustering algorithms are given. We also address the problematics of evaluating clusterings and benchmarking cluster algorithms.