Link Prediction and Hybrid Strategies for Updating a Social Graph Snapshot via a Limited API
Pages 207 - 216
Abstract
We study the problem of updating a social network snapshot when the social system provides a limited public API to access the graph. We propose novel link prediction and hybrid strategies that beat a state-of-the-art competing graph strategy [1]. Our strategies make educated guesses for edge removals and creations based on graph “fingerprints”. We also propose an improved baseline strategy and more accurate cost analysis. Our experimental results are based on 12 large weekly snapshots, allowing us to study staleness and refresh frequency issues. Our new strategies are robust to staleness, and the runtime grows linearly as a snapshot becomes staler. Our strategies can reduce API calls by an order of magnitude with minimal error.
References
[1]
N. Vesdapunt and H. Garcia-Molina, “Updating an existing social graph snapshot via a limited api,” in Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM '16, (New York, NY, USA), ACM, 2016.
[2]
E. David and K. Jon, Networks, Crowds, and Markets: Reasoning About a Highly Connected World. New York, NY, USA: Cambridge University Press, 2010.
[3]
J. Leskovec, A. Rajaraman, and J. D. Ullman, Mining of massive datasets. Cambridge University Press, 2014.
[4]
N. Vesdapunt, “Entity resolution and tracking on social networks (phd thesis),” technical report, Stanford University, [Online] http://ilpubs.stanford.edu:8090/1144/.
[6]
D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” J. Am. Soc. Inf. Sci. Technol., vol. 58, pp. 1019–1031.May 2007.
[7]
G. Jeh and J. Widom, “Simrank: a measure of structural-context similarity,” in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 538–543, ACM, 2002.
[8]
L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: bringing order to the web.,” 1999.
[9]
T. H. Haveliwala, “Topic-sensitive pagerank,” in Proceedings of the 11th International Conference on World Wide Web, WWW '02, (New York, NY, USA), pp. 517–526, ACM, 2002.
[11]
S. Delzio, “The future of google+, what new research reveals.” http://www.socialmediaexaminer.com/the-future-of-google-what-new-research-reveals, 2015.
[12]
P. Lofgren, S. Banerjee, and A. Goel, “Personalized pagerank estimation and search: A bidirectional approach,” in Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, WSDM '16, (New York, NY, USA), pp. 163–172, ACM, 2016.
[13]
J. Yang and J. Leskovec, “Overlapping community detection at scale: A nonnegative matrix factorization approach,” in Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM'13, (New York, NY, USA), pp. 587–596, ACM, 2013.
[14]
J. Mcauley and J. Leskovec, “Discovering social circles in ego networks,” ACM Trans. Knowl. Discov. Data, vol. 8, pp. 4:1–4:28, Feb. 2014.
[15]
D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, vol. 393, pp. 440–442, 1998.
[16]
S. Wasserman and P. Pattison, “Logit models and logistic regressions for social networks: I. an introduction to markov graphs andp,” Psychometrika, vol. 61, no. 3, pp. 401–425, 1996.
[17]
P. D. Hoff, A. E. Raftery, and M. S. Handcock, “Latent space approaches to social network analysis,” Journal of the american Statistical association, vol. 97, no. 460, pp. 1090–1098, 2002.
[18]
M. Kim and J. Leskovec, “Multiplicative attribute graph model of realworld networks,” Internet Mathematics, vol. 8, no. 1–2, pp. 113–160, 2012.
[19]
J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins, “Microscopic evolution of social networks,” in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '08, (New York, NY, USA), pp. 462–470, ACM, 2008.
Recommendations
Updating an Existing Social Graph Snapshot via a Limited API
CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge ManagementWe study the problem of graph tracking with limited information. In this paper, we focus on updating a social graph snapshot. Say we have an existing partial snapshot, G1, of the social graph stored at some system. Over time G1 becomes out of date. We ...
Facebook Linked Data via the Graph API
Facebook's Graph API is an API for accessing objects and connections in Facebook's social graph. To give some idea of the enormity of the social graph underlying Facebook, it was recently announced that Facebook has 901 million users, and the social ...
Comments
Information & Contributors
Information
Published In
Aug 2017
613 pages
Copyright © 2017.
Publisher
IEEE Press
Publication History
Published: 04 August 2017
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in