Experiments on Graph Clustering Algorithms

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:66d16d07e53c574aa92877b74f1bc32d

BRANDES, 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, pp. 568-579. ISBN 978-3-540-20064-2. Available under: doi: 10.1007/978-3-540-39658-1_52

@inproceedings{Brandes2003Exper-5843, title={Experiments on Graph Clustering Algorithms}, year={2003}, doi={10.1007/978-3-540-39658-1_52}, number={2832}, isbn={978-3-540-20064-2}, address={Berlin, Heidelberg}, publisher={Springer 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 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/rdf/resource/123456789/5843"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Wagner, Dorothea</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Brandes, Ulrik</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:format>application/pdf</dc:format> <dc:contributor>Brandes, Ulrik</dc:contributor> <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> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:34Z</dc:date> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5843/1/bgw_egca_03.pdf"/> <dcterms:issued>2003</dcterms:issued> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 11th European Symposium on Algorithms (ESA ´03) (LNCS 2832), 2003, pp. 568-579</dcterms:bibliographicCitation> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5843"/> <dc:contributor>Wagner, Dorothea</dc:contributor> <dc:contributor>Gaertler, Marco</dc:contributor> <dc:rights>deposit-license</dc:rights> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5843/1/bgw_egca_03.pdf"/> <dcterms:title>Experiments on Graph Clustering Algorithms</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Gaertler, Marco</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:34Z</dcterms:available> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

bgw_egca_03.pdf 761

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto