Skip to main content
SpringerLink
Log in

Identifikation von Clustern in Graphen

  • HAUPTBEITRAG
  • IDENTIFIKATION VON CLUSTERN IN GRAPHEN
  • Published:
Informatik-Spektrum Aims and scope

Zusammenfassung

Algorithm Engineering für Graphclustern beinhaltet mehr als die Entwicklung gut funktionierender Algorithmen für konkrete Anwendungen oder Datensätze. Es geht vielmehr um den systematischen Entwurf von Algorithmen für formal sauber gefasste Probleme und deren Analyse und Evaluation unter Betrachtung angemessener Qualitätsmaße. Die Wahl eines Qualitätsmaßes und eine dementsprechend saubere Formulierung eines Optimierungsproblems ist bereits für das intuitiv nahe liegende Paradigma eines starken Zusammenhangs innerhalb der Cluster gegenüber einem schwachen Zusammenhang zwischen den Clustern eine Herausforderung. Umso bedeutender ist der Erkenntnisgewinn, der aus der Methodik des Algorithm Engineering für Graphclustern erzielt werden kann. Viele Aspekte, die in diesem Artikel nur kurz angerissen werden, sind in der Arbeit [9] ausführlich beschrieben.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Bader DA, Meyerhenke H, Sanders P, Schulz C, Schumm A, Wagner D (2012) A benchmarking set for graph clustering and partitioning. In: Rokne J, Alhajj R (eds) Encyclopedia of Social Network Analysis and Mining. Springer, to appear

  2. Brandes U, Delling D, Gaertler M, Görke R, Höfer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE T Knowl Data En 20(2):172–188

    Article  Google Scholar 

  3. Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(066111), online article

  4. de Montgolfier F, Soto M, Viennot L (2011) Asymptotic modularity of some graph classes. In: Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC’11), Lecture Notes in Computer Science, vol 7074, Springer, pp 435–444

  5. Delling D, Gaertler M, Görke R, Wagner D (2008) Engineering comparators for graph clusterings. In: Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM’08), Lecture Notes in Computer Science, vol 5034, Springer, pp 131–142

  6. Flake GW, Tarjan RE, Tsioutsiouliklis K (2004) Graph clustering and minimum cut trees. Internet Math 1(4):385–408

    Article  MathSciNet  MATH  Google Scholar 

  7. Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174

    Article  MathSciNet  Google Scholar 

  8. Gomory RE, Hu TC (1961) Multi-terminal network flows. Internet Math 9(4):551–570

    MathSciNet  MATH  Google Scholar 

  9. Görke R (2010) An Algorithmic Walk from Static to Dynamic Graph Clustering. PhD thesis, Department of Informatics, Karlsruhe Institute of Technology, Karlsruhe, February

  10. Görke R, Schumm A, Wagner D (2011) Density-constrained graph clustering. In: Proceedings of the 12th International Symposium on Algorithms and Data Structures (WADS’11), Lecture Notes in Computer Science, vol 6844, Springer, pp 679–690

  11. Görke R, Schumm A, Wagner D (2012) Experiments on density-constrained graph clustering. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX’12), SIAM, 2012, 1–15

  12. Guimerà R, Sales-Pardo M, Nunes Amaral LA (2004) Modularity from fluctuations in random graphs and complex networks. Phys Rev E 70(025101), online article

  13. Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(026113):1–16

    Google Scholar 

  14. Ovelgönne M, Geyer-Schulz A (2010) Cluster cores and modularity maximization. In: 2010 IEEE International Conference on Data Mining Workshops (ICDMW), December 2010, IEEE Computer Society, pp 1204–1213

  15. Rotta R, Noack A (2011) Multilevel local search algorithms for modularity clustering. ACM J Exper Algorithm 16:2.3:2.1–2.3:2

    MathSciNet  Google Scholar 

  16. Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(3–5):452–473

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, Karlsruher Institut für Technologie, Karlsruhe, Deutschland

    Robert Görke, Tanja Hartmann, Andrea Kappes & Dorothea Wagner

Authors
  1. Robert Görke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tanja Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrea Kappes
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dorothea Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dorothea Wagner.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Görke, R., Hartmann, T., Kappes, A. et al. Identifikation von Clustern in Graphen. Informatik Spektrum 36, 144–152 (2013). https://doi.org/10.1007/s00287-013-0685-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-013-0685-0

Search

Navigation