A programming interface and platform support for developing recommendation algorithms on large-scale social networks

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Friend recommendation algorithms in large-scale social networks such as Facebook or Twitter usually require the exploration of huge user graphs. In current solutions for parallelizing graph algorithms, the burden of dealing with distributed concerns falls on algorithm developers. In this paper, a simple yet powerful programming interface (API) to implement distributed graph traversal algorithms is presented. A case study on implementing a followee recommendation algorithm for Twitter using the API is described. This case study not only illustrates the simplicity offered by the API for developing algorithms, but also how different aspects of the distributed solutions can be treated and experimented without altering the algorithm code. Experiments evaluating the performance of different job scheduling strategies illustrate the flexibility or our approach. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Corbellini, A., Godoy, D., Mateos, C., Zunino, A., & Schiaffino, S. (2014). A programming interface and platform support for developing recommendation algorithms on large-scale social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8658 LNCS, pp. 67–74). Springer Verlag. https://doi.org/10.1007/978-3-319-10166-8_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free