Link prediction with social vector clocks

dc.contributor.authorLee, Conraddeu
dc.contributor.authorNick, Bobo
dc.contributor.authorBrandes, Ulrik
dc.contributor.authorCunningham, Padraigdeu
dc.date.accessioned2013-10-11T09:46:19Zdeu
dc.date.available2014-08-30T22:25:04Zdeu
dc.date.issued2013
dc.description.abstractState-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.eng
dc.description.versionpublished
dc.identifier.citationKDD'13 : The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ; Chicago, IL, USA - August 11 - 14, 2013 / Inderjit S. Dhillon ... (eds.). - New York : ACM, 2013. - S. 784-792. - ISBN 978-1-4503-2174-7deu
dc.identifier.doi10.1145/2487575.2487615deu
dc.identifier.ppn394253132deu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/24821
dc.language.isoengdeu
dc.legacy.dateIssued2013-10-11deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subject.ddc510deu
dc.titleLink prediction with social vector clockseng
dc.typeINPROCEEDINGSdeu
dspace.entity.typePublication
kops.citation.bibtex
@inproceedings{Lee2013predi-24821,
  year={2013},
  doi={10.1145/2487575.2487615},
  title={Link prediction with social vector clocks},
  isbn={978-1-4503-2174-7},
  publisher={ACM Press},
  address={New York, New York, USA},
  booktitle={Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13},
  pages={784--792},
  author={Lee, Conrad and Nick, Bobo and Brandes, Ulrik and Cunningham, Padraig}
}
kops.citation.iso690LEE, Conrad, Bobo NICK, Ulrik BRANDES, Padraig CUNNINGHAM, 2013. Link prediction with social vector clocks. 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13. Chicago, Illinois, USA, 11. Aug. 2013 - 14. Aug. 2013. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13. New York, New York, USA: ACM Press, 2013, pp. 784-792. ISBN 978-1-4503-2174-7. Available under: doi: 10.1145/2487575.2487615deu
kops.citation.iso690LEE, Conrad, Bobo NICK, Ulrik BRANDES, Padraig CUNNINGHAM, 2013. Link prediction with social vector clocks. 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13. Chicago, Illinois, USA, Aug 11, 2013 - Aug 14, 2013. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13. New York, New York, USA: ACM Press, 2013, pp. 784-792. ISBN 978-1-4503-2174-7. Available under: doi: 10.1145/2487575.2487615eng
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/24821">
    <dc:contributor>Cunningham, Padraig</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24821"/>
    <dcterms:bibliographicCitation>KDD'13 : The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ; Chicago, IL, USA - August 11 - 14, 2013 / Inderjit S. Dhillon ... (eds.). - New York : ACM, 2013. - S. 784-792. - ISBN 978-1-4503-2174-7</dcterms:bibliographicCitation>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24821/1/Lee_248217.pdf"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24821/1/Lee_248217.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:contributor>Nick, Bobo</dc:contributor>
    <dc:creator>Nick, Bobo</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-10-11T09:46:19Z</dc:date>
    <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>
    <dc:creator>Lee, Conrad</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2014-08-30T22:25:04Z</dcterms:available>
    <dc:creator>Cunningham, Padraig</dc:creator>
    <dcterms:issued>2013</dcterms:issued>
    <dc:contributor>Lee, Conrad</dc:contributor>
    <dcterms:title>Link prediction with social vector clocks</dcterms:title>
    <dc:language>eng</dc:language>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
  </rdf:Description>
</rdf:RDF>
kops.conferencefield19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13, 11. Aug. 2013 - 14. Aug. 2013, Chicago, Illinois, USAdeu
kops.date.conferenceEnd2013-08-14
kops.date.conferenceStart2013-08-11
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-248217deu
kops.location.conferenceChicago, Illinois, USA
kops.sourcefield<i>Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13</i>. New York, New York, USA: ACM Press, 2013, pp. 784-792. ISBN 978-1-4503-2174-7. Available under: doi: 10.1145/2487575.2487615deu
kops.sourcefield.plainProceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13. New York, New York, USA: ACM Press, 2013, pp. 784-792. ISBN 978-1-4503-2174-7. Available under: doi: 10.1145/2487575.2487615deu
kops.sourcefield.plainProceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13. New York, New York, USA: ACM Press, 2013, pp. 784-792. ISBN 978-1-4503-2174-7. Available under: doi: 10.1145/2487575.2487615eng
kops.submitter.emailanja.seitz@uni-konstanz.dedeu
kops.title.conference19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13
relation.isAuthorOfPublication730a7f0b-fd5e-4a63-852b-a850bbe55283
relation.isAuthorOfPublicationfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
relation.isAuthorOfPublication.latestForDiscovery730a7f0b-fd5e-4a63-852b-a850bbe55283
source.bibliographicInfo.fromPage784
source.bibliographicInfo.toPage792
source.identifier.isbn978-1-4503-2174-7
source.publisherACM Press
source.publisher.locationNew York, New York, USA
source.titleProceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Lee_248217.pdf
Größe:
603.56 KB
Format:
Adobe Portable Document Format
Lee_248217.pdf
Lee_248217.pdfGröße: 603.56 KBDownloads: 367

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
1.92 KB
Format:
Plain Text
Beschreibung:
license.txt
license.txtGröße: 1.92 KBDownloads: 0