Access the full text.
Sign up today, get DeepDyve free for 14 days.
Sofus Macskassy, F. Provost (2003)
A Simple Relational Classifier
Soumen Chakrabarti, B. Dom, P. Indyk (1998)
Enhanced hypertext categorization using hyperlinks
Wanying Luo, Qi Xie, U. Hengartner (2009)
FaceCloak: An Architecture for User Privacy on Social Networking Sites2009 International Conference on Computational Science and Engineering, 3
Xiaowei Ying, Xintao Wu
Under Consideration for Publication in Knowledge and Information Systems on Link Privacy in Randomizing Social Networks
Daniel Gayo-Avello (2010)
Nepotistic relationships in Twitter and their impact on rank prestige algorithmsInf. Process. Manag., 49
E. Zheleva, L. Getoor (2009)
To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles
(2008)
flyByNight : Mitigating the Privacy Risks of Social Networking
Lawrence Page, S. Brin, R. Motwani, T. Winograd (1999)
The PageRank Citation Ranking : Bringing Order to the Web, 98
E. Zheleva, L. Getoor (2008)
How friendship links and group memberships affect the privacy of individuals in social networks
M. McPherson, L. Smith-Lovin, J. Cook (2001)
Birds of a Feather: Homophily in Social NetworksReview of Sociology, 27
Luke McDowell, K. Gupta, D. Aha (2009)
Cautious Collective ClassificationJ. Mach. Learn. Res., 10
Jack Lindamood, R. Heatherly, Murat Kantarcioglu, B. Thuraisingham (2009)
Inferring private information using social network data
Jennifer Neville, David Jensen (2000)
Iterative Classification in Relational Data
Carlos Matusevich (2018)
Privacy in Social Networks
C. Jernigan, Behram Mistree (2009)
Gaydar: Facebook Friendships Expose Sexual OrientationFirst Monday, 14
Zoltán Gyöngyi, H. Garcia-Molina, Jan Pedersen (2004)
Combating Web Spam with TrustRank
S. Guha, Kevin Tang, P. Francis (2008)
NOYB: privacy in online social networks
Jian Hu, Hua-Jun Zeng, Hua Li, Cheng Niu, Zheng Chen (2007)
Demographic prediction based on user's browsing behavior
H. Borko (1981)
Automatic indexing
All Liaisons are Dangerous When All Your Friends are Known to Us Daniel Gayo-Avello University of Oviedo Despacho 57, planta baja, Edi cio de Ciencias C/Calvo Sotelo s/n 33007 Oviedo (SPAIN) dani@uniovi.es ABSTRACT Online Social Networks (OSNs) are used by millions of users worldwide. Academically speaking, there is little doubt about the usefulness of demographic studies conducted on OSNs and, hence, methods to label unknown users from small labeled samples are very useful. However, from the general public point of view, this can be a serious privacy concern. Thus, both topics are tackled in this paper: First, a new algorithm to perform user pro ling in social networks is described, and its performance is reported and discussed. Secondly, the experiments conducted on information usually considered sensitive reveal that by just publicizing one s contacts privacy is at risk and, thus, measures to minimize privacy leaks due to social graph data mining are outlined. In that context, labeling algorithms can exploit a property of social networks: the tendency of people to relate more likely with those sharing similar traits, or homophily. This phenomenon is pervasive to very di erent social networks, and it has been revealed that a
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.