Web3Recommend: Decentralised recommendations with trust and relevance (2307.01411v1)
Abstract: Web3Recommend is a decentralized Social Recommender System implementation that enables Web3 Platforms on Android to generate recommendations that balance trust and relevance. Generating recommendations in decentralized networks is a non-trivial problem because these networks lack a global perspective due to the absence of a central authority. Further, decentralized networks are prone to Sybil Attacks in which a single malicious user can generate multiple fake or Sybil identities. Web3Recommend relies on a novel graph-based content recommendation design inspired by GraphJet, a recommendation system used in Twitter enhanced with MeritRank, a decentralized reputation scheme that provides Sybil-resistance to the system. By adding MeritRank's decay parameters to the vanilla Social Recommender Systems' personalized SALSA graph algorithm, we can provide theoretical guarantees against Sybil Attacks in the generated recommendations. Similar to GraphJet, we focus on generating real-time recommendations by only acting on recent interactions in the social network, allowing us to cater temporally contextual recommendations while keeping a tight bound on the memory usage in resource-constrained devices, allowing for a seamless user experience. As a proof-of-concept, we integrate our system with MusicDAO, an open-source Web3 music-sharing platform, to generate personalized, real-time recommendations. Thus, we provide the first Sybil-resistant Social Recommender System, allowing real-time recommendations beyond classic user-based collaborative filtering. The system is also rigorously tested with extensive unit and integration tests. Further, our experiments demonstrate the trust-relevance balance of recommendations against multiple adversarial strategies in a test network generated using data from real music platforms.
- R. Lu, H. Zhu, X. Liu, J. K. Liu, and J. Shao, “Toward efficient and privacy-preserving computing in big data era,” IEEE Network, vol. 28, no. 4, pp. 46–50, 2014.
- F. O. Isinkaye, Y. O. Folajimi, and B. A. Ojokoh, “Recommendation systems: Principles, methods and evaluation,” Egyptian informatics journal, vol. 16, no. 3, pp. 261–273, 2015.
- D. Shenk, “Data smog: Surviving the information glut,” 1999.
- D. Bawden and L. Robinson, “Information overload: An overview,” 2020.
- P. Hemp, “Death by information overload,” Harvard business review, vol. 87, pp. 82–9, 121, 10 2009.
- Admin, “Tiktok statistics - everything you need to know [mar 2023 update],” Mar 2023. [Online]. Available: https://wallaroomedia.com/blog/social-media/tiktok-statistics/
- P. Gupta, A. Goel, J. Lin, A. Sharma, D. Wang, and R. Zadeh, “Wtf: The who to follow service at twitter,” in Proceedings of the 22nd international conference on World Wide Web, 2013, pp. 505–514.
- D. Das, L. Sahoo, and S. Datta, “A survey on recommendation system,” International Journal of Computer Applications, vol. 160, no. 7, 2017.
- I. Guy and D. Carmel, “Social recommender systems,” in Proceedings of the 20th international conference companion on World wide web, 2011, pp. 283–284.
- A. Sharma, J. Jiang, P. Bommannavar, B. Larson, and J. Lin, “Graphjet: Real-time content recommendations at twitter,” Proceedings of the VLDB Endowment, vol. 9, no. 13, pp. 1281–1292, 2016.
- R. Lempel and S. Moran, “Salsa: the stochastic approach for link-structure analysis,” ACM Transactions on Information Systems (TOIS), vol. 19, no. 2, pp. 131–160, 2001.
- A. Chaabane, Y. Ding, R. Dey, M. A. Kaafar, and K. W. Ross, “A closer look at third-party osn applications: are they leaking your personal information?” in Passive and Active Measurement: 15th International Conference, PAM 2014, Los Angeles, CA, USA, March 10-11, 2014, Proceedings 15. Springer, 2014, pp. 235–246.
- A. Hassan, “Replication and availability in decentralised online social networks,” 2017.
- J. Bambacht and J. Pouwelse, “Web3: A decentralized societal infrastructure for identity, trust, money, and data,” arXiv preprint arXiv:2203.00398, 2022.
- B. Nasrulin, G. Ishmaev, and J. Pouwelse, “Meritrank: Sybil tolerant reputation for merit-based tokenomics,” in 2022 4th Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS). IEEE, 2022, pp. 95–102.
- T. Wissel, “Fairness and freedom for artists: Towards a robot economy for the music industry,” 2021.
- J. N. Gray, “An approach to decentralized computer systems,” IEEE Transactions on Software Engineering, no. 6, pp. 684–692, 1986.
- J. R. Douceur, “The sybil attack,” in Peer-to-Peer Systems: First InternationalWorkshop, IPTPS 2002 Cambridge, MA, USA, March 7–8, 2002 Revised Papers 1. Springer, 2002, pp. 251–260.
- M. Apte, G. K. Palshikar, and S. Baskaran, “Frauds in online social networks: A review,” Social networks and surveillance for society, pp. 1–18, 2019.
- Contributor, “Stat gaming services come to youtube,” Aug 2007. [Online]. Available: https://techcrunch.com/2007/08/23/myspace-style-profile-gaming-comes-to-youtube/
- H. Yu, C. Shi, M. Kaminsky, P. B. Gibbons, and F. Xiao, “Dsybil: Optimal sybil-resistance for recommendation systems,” in 2009 30th IEEE Symposium on Security and Privacy. IEEE, 2009, pp. 283–298.
- K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova, “Monte carlo methods in pagerank computation: When one iteration is sufficient,” SIAM Journal on Numerical Analysis, vol. 45, no. 2, pp. 890–904, 2007.
- J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, “Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters,” 2008.
- A. M. Rashid, I. Albert, D. Cosley, S. K. Lam, S. M. McNee, J. A. Konstan, and J. Riedl, “Getting to know you: learning new user preferences in recommender systems,” in Proceedings of the 7th international conference on Intelligent user interfaces, 2002, pp. 127–134.
- L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.” Stanford InfoLab, Tech. Rep., 1999.
- A. Borodin, G. O. Roberts, J. S. Rosenthal, and P. Tsaparas, “Finding authorities and hubs from link structures on the world wide web,” in Proceedings of the 10th International Conference on World Wide Web, ser. WWW ’01. New York, NY, USA: Association for Computing Machinery, 2001, p. 415–429. [Online]. Available: https://doi-org.tudelft.idm.oclc.org/10.1145/371920.372096
- D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós, “Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments,” Internet Mathematics, vol. 2, no. 3, pp. 333–358, 2005.
- A. Blum, T. H. Chan, and M. R. Rwebangira, “A random-surfer web-graph model,” in 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO). SIAM, 2006, pp. 238–246.
- B. Bahmani, A. Chowdhury, and A. Goel, “Fast incremental and personalized pagerank,” arXiv preprint arXiv:1006.2880, 2010.
- J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” Journal of the ACM (JACM), vol. 46, no. 5, pp. 604–632, 1999.
- P. Baran, “On distributed communications networks,” IEEE Transactions on Communications Systems, vol. 12, no. 1, pp. 1–9, 1964.
- G. Korpal and D. Scott, “Decentralization and web3 technologies,” 5 2022. [Online]. Available: https://www.techrxiv.org/articles/preprint/Decentralization_and_web3_technologies/19727734
- J. Pouwelse, P. Garbacki, J. Wang, A. Bakker, J. Yang, A. Iosup, D. Epema, M. Reinders, M. van Steen, and H. Sips, “Tribler: a social‐based peer‐to‐peer system,” Concurrency and Computation: Practice and Experience, vol. 20, pp. 127 – 138, 02 2008.
- T. O’reilly, “What is web 2.0: Design patterns and business models for the next generation of software,” Communications & strategies, no. 1, p. 17, 2007.
- “Home · solid.” [Online]. Available: https://solidproject.org/
- G. Wood. [Online]. Available: http://gavwood.com/dappsweb3.html
- S. Kamvar, M. Schlosser, and H. Garcia-molina, “The eigentrust algorithm for reputation management in p2p networks,” The EigenTrust Algorithm for Reputation Management in P2P Networks, 04 2003.
- P. Kollock et al., “The production of trust in online markets,” Advances in group processes, vol. 16, no. 1, pp. 99–123, 1999.
- B. Nasrulin, G. Ishmaev, and J. Pouwelse, “Meritrank: Sybil tolerant reputation for merit-based tokenomics,” 2022. [Online]. Available: https://arxiv.org/abs/2207.09950
- N. Borisov, “Computational puzzles as sybil defenses,” in Sixth IEEE International Conference on Peer-to-Peer Computing (P2P’06). IEEE, 2006, pp. 171–176.
- E. Damiani, D. C. di Vimercati, S. Paraboschi, P. Samarati, and F. Violante, “A reputation-based approach for choosing reliable resources in peer-to-peer networks,” in Proceedings of the 9th ACM conference on Computer and communications security, 2002, pp. 207–216.
- H. Rowaihy, W. Enck, P. McDaniel, and T. La Porta, “Limiting sybil attacks in structured p2p networks,” in IEEE INFOCOM 2007-26th IEEE International Conference on Computer Communications. IEEE, 2007, pp. 2596–2600.
- R. A. Bazzi and G. Konjevod, “On the establishment of distinct identities in overlay networks,” in Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, 2005, pp. 312–320.
- P. Resnick, K. Kuwabara, R. Zeckhauser, and E. Friedman, “Reputation systems,” Communications of the ACM, vol. 43, no. 12, pp. 45–48, 2000.
- P. Resnick, R. Zeckhauser, J. Swanson, and K. Lockwood, “The value of reputation on ebay: A controlled experiment,” Experimental economics, vol. 9, pp. 79–101, 2006.
- H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman, “Sybilguard: defending against sybil attacks via social networks,” in Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, 2006, pp. 267–278.
- H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao, “Sybillimit: A near-optimal social network defense against sybil attacks,” in 2008 IEEE Symposium on Security and Privacy (sp 2008). IEEE, 2008, pp. 3–17.
- A. Mislove, A. Post, P. Druschel, and P. K. Gummadi, “Ostra: Leveraging trust to thwart unwanted communication.” in Nsdi, vol. 8, 2008, pp. 15–30.
- D. N. Tran, B. Min, J. Li, and L. Subramanian, “Sybil-resilient online content voting.” in NSDI, vol. 9, no. 1, 2009, pp. 15–28.
- P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire, “The nonstochastic multiarmed bandit problem,” SIAM journal on computing, vol. 32, no. 1, pp. 48–77, 2002.
- L. Li, W. Chu, J. Langford, and R. E. Schapire, “A contextual-bandit approach to personalized news article recommendation,” in Proceedings of the 19th international conference on World wide web, 2010, pp. 661–670.
- L. Guo, J. Ma, Z. Chen, and H. Zhong, “Learning to recommend with social contextual information from implicit feedback,” Soft Computing, vol. 19, pp. 1351–1362, 2015.
- J. Bobadilla, F. Ortega, A. Hernando, and A. Gutiérrez, “Recommender systems survey,” Knowledge-based systems, vol. 46, pp. 109–132, 2013.
- H. A. Kurdi, “Honestpeer: An enhanced eigentrust algorithm for reputation management in p2p systems,” Journal of King Saud University-Computer and Information Sciences, vol. 27, no. 3, pp. 315–322, 2015.
- M. Ripeanu, “Peer-to-peer architecture case study: Gnutella network,” in Proceedings first international conference on peer-to-peer computing. IEEE, 2001, pp. 99–100.
- D. Michail, J. Kinable, B. Naveh, and J. V. Sichi, “Jgrapht—a java library for graph data structures and algorithms,” ACM Transactions on Mathematical Software (TOMS), vol. 46, no. 2, pp. 1–29, 2020.
- M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. Van Steen, “Gossip-based peer sampling,” ACM Transactions on Computer Systems (TOCS), vol. 25, no. 3, pp. 8–es, 2007.
- R. Baraglia, P. Dazzi, M. Mordacchini, and L. Ricci, “A peer-to-peer recommender system for self-emerging user communities based on gossip overlays,” Journal of Computer and System Sciences, vol. 79, no. 2, pp. 291–308, 2013.
- A. Crespo and H. Garcia-Molina, “Semantic overlay networks for p2p systems,” in International Workshop on Agents and P2P Computing. Springer, 2004, pp. 1–13.
- Y. Ma, B. Narayanaswamy, H. Lin, and H. Ding, “Temporal-contextual recommendation in real-time,” in Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, 2020, pp. 2291–2299.
- B. Zhang and B. Yuan, “Improved collaborative filtering recommendation algorithm of similarity measure,” in AIP Conference Proceedings, vol. 1839, no. 1. AIP Publishing LLC, 2017, p. 020167.
- I. Cohen, Y. Huang, J. Chen, J. Benesty, J. Benesty, J. Chen, Y. Huang, and I. Cohen, “Pearson correlation coefficient,” Noise reduction in speech processing, pp. 1–4, 2009.
- T. Bertin-Mahieux, D. P. Ellis, B. Whitman, and P. Lamere, “The million song dataset,” 2011.
- B. McFee, T. Bertin-Mahieux, D. P. Ellis, and G. R. Lanckriet, “The million song dataset challenge,” in Proceedings of the 21st International Conference on World Wide Web, ser. WWW ’12 Companion. New York, NY, USA: Association for Computing Machinery, 2012, p. 909–916. [Online]. Available: https://doi-org.tudelft.idm.oclc.org/10.1145/2187980.2188222
- W. Webber, A. Moffat, and J. Zobel, “A similarity measure for indefinite rankings,” ACM Transactions on Information Systems (TOIS), vol. 28, no. 4, pp. 1–38, 2010.