Publikation:

Experiments on Graph Clustering Algorithms

Lade...
Vorschaubild

Dateien

bgw_egca_03.pdf
bgw_egca_03.pdfGröße: 312.66 KBDownloads: 2477

Datum

2003

Autor:innen

Gaertler, Marco
Wagner, Dorothea

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

COSIN
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

DI BATTISTA, Giuseppe, ed., Uri ZWICK, ed.. Algorithms - ESA 2003. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 568-579. Lecture Notes in Computer Science. 2832. ISBN 978-3-540-20064-2. Available under: doi: 10.1007/978-3-540-39658-1_52

Zusammenfassung

A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on particular aspects of this rather vague concept have been proposed no conclusive argument on their appropriateness has been given. As a first step towards understanding the consequences of particular conceptions, we conducted an experimental evaluation of graph clustering approaches. By combining proven techniques from graph partitioning and geometric clustering, we also introduce a new approach that compares favorably.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BRANDES, Ulrik, Marco GAERTLER, Dorothea WAGNER, 2003. Experiments on Graph Clustering Algorithms. In: DI BATTISTA, Giuseppe, ed., Uri ZWICK, ed.. Algorithms - ESA 2003. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 568-579. Lecture Notes in Computer Science. 2832. ISBN 978-3-540-20064-2. Available under: doi: 10.1007/978-3-540-39658-1_52
BibTex
@inproceedings{Brandes2003Exper-5843,
  year={2003},
  doi={10.1007/978-3-540-39658-1_52},
  title={Experiments on Graph Clustering Algorithms},
  number={2832},
  isbn={978-3-540-20064-2},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Algorithms - ESA 2003},
  pages={568--579},
  editor={Di Battista, Giuseppe and Zwick, Uri},
  author={Brandes, Ulrik and Gaertler, Marco and Wagner, Dorothea}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5843">
    <dcterms:issued>2003</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:34Z</dc:date>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dcterms:abstract xml:lang="eng">A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on particular aspects of this rather vague concept have been proposed no conclusive argument on their appropriateness has been given. As a first step towards understanding the consequences of particular conceptions, we conducted an experimental evaluation of graph clustering approaches. By combining proven techniques from graph partitioning and geometric clustering, we also introduce a new approach that compares favorably.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5843/1/bgw_egca_03.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:bibliographicCitation>First publ. in: Proceedings of the 11th European Symposium on Algorithms (ESA ´03) (LNCS 2832), 2003, pp. 568-579</dcterms:bibliographicCitation>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:format>application/pdf</dc:format>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5843/1/bgw_egca_03.pdf"/>
    <dc:contributor>Gaertler, Marco</dc:contributor>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dcterms:title>Experiments on Graph Clustering Algorithms</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:34Z</dcterms:available>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5843"/>
    <dc:creator>Gaertler, Marco</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen