Link Prediction with Social Vector Clocks

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:42444af2894bc40c41c3a1ed3f127b1b

LEE, Conrad, Bobo NICK, Ulrik BRANDES, Pádraig CUNNINGHAM, 2013. Link Prediction with Social Vector Clocks

@unpublished{Lee2013Predi-24496, title={Link Prediction with Social Vector Clocks}, year={2013}, author={Lee, Conrad and Nick, Bobo and Brandes, Ulrik and Cunningham, Pádraig} }

<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/24496"> <dc:creator>Brandes, Ulrik</dc:creator> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:issued>2013</dcterms:issued> <dc:rights>deposit-license</dc:rights> <dc:creator>Cunningham, Pádraig</dc:creator> <dc:contributor>Nick, Bobo</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24496/1/Lee_244964.pdf"/> <dc:contributor>Lee, Conrad</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-10-11T09:33:50Z</dc:date> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">State-of-the-art link prediction utilizes combinations of complex features derived from network panel data. We here show that computationally less expensive features can achieve the same performance in the common scenario in which the data is available as a sequence of interactions. Our features are based on social vector clocks, an adaptation of the vector-clock concept introduced in distributed computing to social interaction networks. In fact, our experiments suggest that by taking into account the order and spacing of interactions, social vector clocks exploit different aspects of link formation so that their combination with previous approaches yields the most accurate predictor to date.</dcterms:abstract> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Link Prediction with Social Vector Clocks</dcterms:title> <dc:creator>Nick, Bobo</dc:creator> <dc:contributor>Cunningham, Pádraig</dc:contributor> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24496/1/Lee_244964.pdf"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24496"/> <dc:creator>Lee, Conrad</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-10-11T09:33:50Z</dcterms:available> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Lee_244964.pdf 110

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto