Title :
Link prediction by de-anonymization: How We Won the Kaggle Social Network Challenge
Author :
Narayanan, Arvind ; Shi, Elaine ; Rubinstein, Benjamin I P
Author_Institution :
Dept. of Comput. Sci., Stanford Univ., Stanford, CA, USA
fDate :
July 31 2011-Aug. 5 2011
Abstract :
This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on real-world link prediction, and the dataset was a graph obtained by crawling the popular Flickr social photo sharing website, with user identities scrubbed. By de-anonymizing much of the competition test set using our own Flickr crawl, we were able to effectively game the competition. Our attack represents a new application of de-anonymization to gaming machine learning contests, suggesting changes in how future competitions should be run. We introduce a new simulated annealing-based weighted graph matching algorithm for the seeding step of de-anonymization. We also show how to combine de-anonymization with link prediction-the latter is required to achieve good performance on the portion of the test set not de-anonymized-for example by training the predictor on the de-anonymized portion of the test set, and combining probabilistic predictions from de-anonymization and link prediction.
Keywords :
graph theory; learning (artificial intelligence); simulated annealing; social networking (online); Flickr social photo sharing Website; IJCNN 2011 social network challenge; Kaggle social network challenge; deanonymization; machine learning; realworld link prediction; simulated annealing-based weighted graph matching algorithm; Accuracy; Electronic mail; Image edge detection; Machine learning; Simulated annealing; Social network services; Training;
Conference_Titel :
Neural Networks (IJCNN), The 2011 International Joint Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
978-1-4244-9635-8
DOI :
10.1109/IJCNN.2011.6033446