Computer Science – Cryptography and Security
Scientific paper
2011-02-22
Computer Science
Cryptography and Security
11 pages, 13 figures; submitted to IJCNN'2011
Scientific paper
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.
Narayanan Arvind
Rubinstein Benjamin I. P.
Shi Elaine
No associations
LandOfFree
Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-557656