Experiments on Graph Clustering Algorithms
| dc.contributor.author | Brandes, Ulrik | |
| dc.contributor.author | Gaertler, Marco | deu |
| dc.contributor.author | Wagner, Dorothea | deu |
| dc.date.accessioned | 2011-03-24T16:00:34Z | deu |
| dc.date.available | 2011-03-24T16:00:34Z | deu |
| dc.date.issued | 2003 | |
| dc.description.abstract | 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. | eng |
| dc.description.version | published | |
| dc.format.mimetype | application/pdf | deu |
| dc.identifier.citation | First publ. in: Proceedings of the 11th European Symposium on Algorithms (ESA ´03) (LNCS 2832), 2003, pp. 568-579 | deu |
| dc.identifier.doi | 10.1007/978-3-540-39658-1_52 | |
| dc.identifier.ppn | 304382205 | deu |
| dc.identifier.uri | http://kops.uni-konstanz.de/handle/123456789/5843 | |
| dc.language.iso | eng | deu |
| dc.legacy.dateIssued | 2009 | deu |
| dc.rights | terms-of-use | deu |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | deu |
| dc.subject.ddc | 004 | deu |
| dc.title | Experiments on Graph Clustering Algorithms | eng |
| dc.type | INPROCEEDINGS | deu |
| dspace.entity.type | Publication | |
| kops.citation.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}
} | |
| kops.citation.iso690 | 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, 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 | deu |
| kops.citation.iso690 | 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, 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 | eng |
| kops.citation.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> | |
| kops.description.openAccess | openaccessgreen | |
| kops.flag.knbibliography | true | |
| kops.identifier.nbn | urn:nbn:de:bsz:352-opus-77705 | deu |
| kops.opus.id | 7770 | deu |
| kops.relation.uniknProjectTitle | COSIN | |
| kops.sourcefield | DI BATTISTA, Giuseppe, ed., Uri ZWICK, ed.. <i>Algorithms - ESA 2003</i>. 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 | deu |
| kops.sourcefield.plain | 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 | deu |
| kops.sourcefield.plain | 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 | eng |
| relation.isAuthorOfPublication | fa1660c9-a071-4d01-9bdd-7adcd0e2d7d7 | |
| relation.isAuthorOfPublication.latestForDiscovery | fa1660c9-a071-4d01-9bdd-7adcd0e2d7d7 | |
| source.bibliographicInfo.fromPage | 568 | |
| source.bibliographicInfo.seriesNumber | 2832 | |
| source.bibliographicInfo.toPage | 579 | |
| source.contributor.editor | Di Battista, Giuseppe | |
| source.contributor.editor | Zwick, Uri | |
| source.identifier.isbn | 978-3-540-20064-2 | |
| source.publisher | Springer Berlin Heidelberg | |
| source.publisher.location | Berlin, Heidelberg | |
| source.relation.ispartofseries | Lecture Notes in Computer Science | |
| source.title | Algorithms - ESA 2003 |
Dateien
Originalbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- bgw_egca_03.pdf
- Größe:
- 312.66 KB
- Format:
- Adobe Portable Document Format
