Clustering with Spectral Methods

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:8183efba0c2c24a8931da9db9d910881

GAERTLER, Marco, 2002. Clustering with Spectral Methods [Master thesis]

@mastersthesis{Gaertler2002Clust-717, title={Clustering with Spectral Methods}, year={2002}, author={Gaertler, Marco} }

<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/717"> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:36Z</dc:date> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <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/717"/> <dcterms:issued>2002</dcterms:issued> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:contributor>Gaertler, Marco</dc:contributor> <dc:rights>deposit-license</dc:rights> <dcterms:title>Clustering with Spectral Methods</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/717/1/thesis.pdf"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:creator>Gaertler, Marco</dc:creator> <dc:format>application/pdf</dc:format> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/717/1/thesis.pdf"/> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:36Z</dcterms:available> <dcterms:abstract xml:lang="eng">Grouping and sorting are problems with a great tradition in the history of mankind. Clustering and cluster analysis is a small aspect in the wide spectrum. But these topics have applications in most scientific disciplines. Graph clustering is again a little fragment in the clustering area. Nevertheless it has the potential for new pioneering and innovative methods. One such method is the Markov Clustering presented by van Dongen in 'Graph Clustering by Flow Simulation'. We investigated the question, if there is a similar approach which involves the graph structure more directly and has a linear space complexity.</dcterms:abstract> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

thesis.pdf 96

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto