Publikation: Investigating Link Inference in Partially Observable Networks : Friendship Ties and Interaction
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
While privacy preserving mechanisms, such as hiding one's friends list, may be available to withhold personal information on online social networking sites, it is not obvious whether to which degree a user's social behavior renders such an attempt futile. In this paper, we study the impact of additional interaction information on the inference of links between nodes in partially covert networks. This investigation is based on the assumption that interaction might be a proxy for connectivity patterns in online social networks. For this purpose, we use data collected from 586 Facebook profiles consisting of friendship ties (conceptualized as the network) and comments on wall posts (serving as interaction information) by a total of 64 000 users. The link-inference problem is formulated as a binary classification problem using a comprehensive set of features and multiple supervised learning algorithms. Our results suggest that interactions reiterate the information contained in friendship ties sufficiently well to serve as a proxy when the majority of a network is unobserved.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
NASIM, Mehwish, Raphael CHARBEY, Christophe PRIEUR, Ulrik BRANDES, 2016. Investigating Link Inference in Partially Observable Networks : Friendship Ties and Interaction. In: IEEE Transactions on Computational Social Systems. 2016, 3(3), pp. 113-119. eISSN 2329-924X. Available under: doi: 10.1109/TCSS.2016.2618998BibTex
@article{Nasim2016-09Inves-36638,
year={2016},
doi={10.1109/TCSS.2016.2618998},
title={Investigating Link Inference in Partially Observable Networks : Friendship Ties and Interaction},
number={3},
volume={3},
journal={IEEE Transactions on Computational Social Systems},
pages={113--119},
author={Nasim, Mehwish and Charbey, Raphael and Prieur, Christophe and Brandes, Ulrik}
}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/36638">
<dc:creator>Charbey, Raphael</dc:creator>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Prieur, Christophe</dc:contributor>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/36638"/>
<dc:contributor>Charbey, Raphael</dc:contributor>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:title>Investigating Link Inference in Partially Observable Networks : Friendship Ties and Interaction</dcterms:title>
<dcterms:issued>2016-09</dcterms:issued>
<dc:contributor>Brandes, Ulrik</dc:contributor>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:creator>Nasim, Mehwish</dc:creator>
<dc:creator>Brandes, Ulrik</dc:creator>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-01-12T15:53:40Z</dc:date>
<dcterms:abstract xml:lang="eng">While privacy preserving mechanisms, such as hiding one's friends list, may be available to withhold personal information on online social networking sites, it is not obvious whether to which degree a user's social behavior renders such an attempt futile. In this paper, we study the impact of additional interaction information on the inference of links between nodes in partially covert networks. This investigation is based on the assumption that interaction might be a proxy for connectivity patterns in online social networks. For this purpose, we use data collected from 586 Facebook profiles consisting of friendship ties (conceptualized as the network) and comments on wall posts (serving as interaction information) by a total of 64 000 users. The link-inference problem is formulated as a binary classification problem using a comprehensive set of features and multiple supervised learning algorithms. Our results suggest that interactions reiterate the information contained in friendship ties sufficiently well to serve as a proxy when the majority of a network is unobserved.</dcterms:abstract>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-01-12T15:53:40Z</dcterms:available>
<dc:language>eng</dc:language>
<dc:creator>Prieur, Christophe</dc:creator>
<dc:contributor>Nasim, Mehwish</dc:contributor>
</rdf:Description>
</rdf:RDF>
