Network ensemble clustering using latent roles

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:ea7144b38d618b606c9e7bab2adfa91f

BRANDES, Ulrik, Jürgen LERNER, Uwe NAGEL, 2010. Network ensemble clustering using latent roles. In: Advances in Data Analysis and Classification. 5(2), pp. 81-94. ISSN 1862-5347. Available under: doi: 10.1007/s11634-010-0074-3

@article{Brandes2010Netwo-325, title={Network ensemble clustering using latent roles}, year={2010}, doi={10.1007/s11634-010-0074-3}, number={2}, volume={5}, issn={1862-5347}, journal={Advances in Data Analysis and Classification}, pages={81--94}, author={Brandes, Ulrik and Lerner, Jürgen and Nagel, Uwe} }

<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/325"> <dcterms:bibliographicCitation>First publ. in: Advances in Data Analysis and Classification 5 (2011), 2, pp. 81-94</dcterms:bibliographicCitation> <dc:format>application/pdf</dc:format> <dcterms:title>Network ensemble clustering using latent roles</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Lerner, Jürgen</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/325/1/Brandes.pdf"/> <dc:rights>deposit-license</dc:rights> <dc:creator>Nagel, Uwe</dc:creator> <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/325"/> <dcterms:abstract xml:lang="eng">We present a clustering method for collections of graphs based on the assumptions that graphs in the same cluster have a similar role structure and that the respective roles can be founded on implicit vertex types. Given a network ensemble (a collection of attributed graphs with some substantive commonality), we start by partitioning the set of all vertices based on attribute similarity. Projection of each graph onto the resulting vertex types yields feature vectors of equal dimensionality, irrespective of the original graph sizes. These feature vectors are then subjected to standard clustering methods. This approach is motivated by social network concepts, and we demonstrate its utility on an ensemble of personal networks of migrants, where we extract structurally similar groups and show their resemblance to predicted acculturation strategies.</dcterms:abstract> <dcterms:issued>2010</dcterms:issued> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:creator>Lerner, Jürgen</dc:creator> <dc:contributor>Nagel, Uwe</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-06-20T09:51:20Z</dc:date> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/325/1/Brandes.pdf"/> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-03-31T22:25:05Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Brandes.pdf 106

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto