Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
| dc.contributor.author | Brandes, Ulrik | |
| dc.contributor.author | Pich, Christian | deu |
| dc.date.accessioned | 2011-03-24T15:59:43Z | deu |
| dc.date.available | 2011-03-24T15:59:43Z | deu |
| dc.date.issued | 2007 | |
| dc.description.abstract | We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs. It produces layouts that compare favorably with other methods for drawing large graphs, and it is among the fastest methods available. In addition, our approach allows for progressive computation, i.e. a rough approximation of the layout can be produced even faster, and then be refined until satisfaction. | eng |
| dc.description.version | published | |
| dc.format.mimetype | application/pdf | deu |
| dc.identifier.citation | First publ. in: Proceedings of the 14th International Symposium Graph Drawing (GD ´06) (LNCS 4372), 2007, pp. 42-53 | deu |
| dc.identifier.doi | 10.1007/978-3-540-70904-6_6 | |
| dc.identifier.ppn | 302324976 | deu |
| dc.identifier.uri | http://kops.uni-konstanz.de/handle/123456789/5741 | |
| dc.language.iso | eng | deu |
| dc.legacy.dateIssued | 2009 | deu |
| dc.rights | Attribution-NonCommercial-NoDerivs 2.0 Generic | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.0/ | |
| dc.subject.ddc | 004 | deu |
| dc.title | Eigensolver Methods for Progressive Multidimensional Scaling of Large Data | eng |
| dc.type | INPROCEEDINGS | deu |
| dspace.entity.type | Publication | |
| kops.citation.bibtex | @inproceedings{Brandes2007Eigen-5741,
year={2007},
doi={10.1007/978-3-540-70904-6_6},
title={Eigensolver Methods for Progressive Multidimensional Scaling of Large Data},
isbn={978-3-540-70903-9},
publisher={Springer Berlin Heidelberg},
address={Berlin, Heidelberg},
series={Lecture Notes in Computer Science},
booktitle={Graph Drawing},
pages={42--53},
editor={Kaufmann, Michael and Wagner, Dorothea},
author={Brandes, Ulrik and Pich, Christian}
} | |
| kops.citation.iso690 | BRANDES, Ulrik, Christian PICH, 2007. Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. In: KAUFMANN, Michael, ed., Dorothea WAGNER, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 42-53. Lecture Notes in Computer Science. ISBN 978-3-540-70903-9. Available under: doi: 10.1007/978-3-540-70904-6_6 | deu |
| kops.citation.iso690 | BRANDES, Ulrik, Christian PICH, 2007. Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. In: KAUFMANN, Michael, ed., Dorothea WAGNER, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 42-53. Lecture Notes in Computer Science. ISBN 978-3-540-70903-9. Available under: doi: 10.1007/978-3-540-70904-6_6 | 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/5741">
<dc:language>eng</dc:language>
<dc:contributor>Brandes, Ulrik</dc:contributor>
<dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Pich, Christian</dc:contributor>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:43Z</dc:date>
<dcterms:bibliographicCitation>First publ. in: Proceedings of the 14th International Symposium Graph Drawing (GD ´06) (LNCS 4372), 2007, pp. 42-53</dcterms:bibliographicCitation>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:43Z</dcterms:available>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5741/1/bp_empmdsld_06.pdf"/>
<dcterms:title>Eigensolver Methods for Progressive Multidimensional Scaling of Large Data</dcterms:title>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:issued>2007</dcterms:issued>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5741"/>
<dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5741/1/bp_empmdsld_06.pdf"/>
<dc:creator>Pich, Christian</dc:creator>
<dcterms:abstract xml:lang="eng">We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs. It produces layouts that compare favorably with other methods for drawing large graphs, and it is among the fastest methods available. In addition, our approach allows for progressive computation, i.e. a rough approximation of the layout can be produced even faster, and then be refined until satisfaction.</dcterms:abstract>
<dc:creator>Brandes, Ulrik</dc:creator>
<dc:format>application/pdf</dc:format>
</rdf:Description>
</rdf:RDF> | |
| kops.description.openAccess | openaccessgreen | |
| kops.flag.knbibliography | true | |
| kops.identifier.nbn | urn:nbn:de:bsz:352-opus-73423 | deu |
| kops.opus.id | 7342 | deu |
| kops.sourcefield | KAUFMANN, Michael, ed., Dorothea WAGNER, ed.. <i>Graph Drawing</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 42-53. Lecture Notes in Computer Science. ISBN 978-3-540-70903-9. Available under: doi: 10.1007/978-3-540-70904-6_6 | deu |
| kops.sourcefield.plain | KAUFMANN, Michael, ed., Dorothea WAGNER, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 42-53. Lecture Notes in Computer Science. ISBN 978-3-540-70903-9. Available under: doi: 10.1007/978-3-540-70904-6_6 | deu |
| kops.sourcefield.plain | KAUFMANN, Michael, ed., Dorothea WAGNER, ed.. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 42-53. Lecture Notes in Computer Science. ISBN 978-3-540-70903-9. Available under: doi: 10.1007/978-3-540-70904-6_6 | eng |
| relation.isAuthorOfPublication | fa1660c9-a071-4d01-9bdd-7adcd0e2d7d7 | |
| relation.isAuthorOfPublication.latestForDiscovery | fa1660c9-a071-4d01-9bdd-7adcd0e2d7d7 | |
| source.bibliographicInfo.fromPage | 42 | |
| source.bibliographicInfo.toPage | 53 | |
| source.contributor.editor | Kaufmann, Michael | |
| source.contributor.editor | Wagner, Dorothea | |
| source.identifier.isbn | 978-3-540-70903-9 | |
| source.publisher | Springer Berlin Heidelberg | |
| source.publisher.location | Berlin, Heidelberg | |
| source.relation.ispartofseries | Lecture Notes in Computer Science | |
| source.title | Graph Drawing |
Dateien
Originalbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- bp_empmdsld_06.pdf
- Größe:
- 2.63 MB
- Format:
- Adobe Portable Document Format
