Scalable and Explainable Friend Recommendation in Campus Social Network System
In the recent years, social networks have been growing in popularity and importance and to a certain degree contributing to a change in human life style. In a social network system, it’s essential to offer well-designed and effective friend recommendation service for achieving high loyalty of users. Although Friend-Of-a-Friend (FOF) is widely used and proved to be effective, the straight-forward implementation of FOF needs large amount of computation power which is a heavy burden for lightweight social network taking into account the restriction of resources. We propose a FOF-based friend recommendation algorithm in a campus social network system which is explainable and efficient. On one hand, we take multiple relationship factors into account for recommendation. On the other hand, we use incremental relationship data instead of the entire relationship data to generate latest recommendation list and detailed explanations. Ultimately, it achieves better performance in complexity and scalability.
KeywordsFriend recommendation Campus social network FOF Scalable and explainable
This work is supported by the National Basic Research Program of China (No. 2012CB316000) and the Beijing Education and Science “Twelfth Five-Year Plan” (No. CJA12134).
- 3.Chen J, Geyer W, Dugan C, Muller M, Guy I (2009) Make new friends, but keep the old—recommending people on social networking sites. In: Proceedings of ACM conference on human factors in computer systems (CHI 09). ACM Press, New York, pp 201–210. doi: 10.1145/1518701.1518735
- 4.Silva NB, Tsang I-R, Cavalcanti GDC, Tsang I-J (2010) A graph-based friend recommendation system using genetic algorithm. In: Proceedings of IEEE congress on evolutionary computation (CEC 10). IEEE Computer Society, pp 1–7. doi: 10.1109/CEC.2010.5586144
- 5.Lo S, Lin C (2006) WMR—a graph-based algorithm for friend recommendation. In: Proceedings IEEE/wic/acm international conference on web intelligence (WI 06). IEEE Computer Society, pp 121–128. doi: 10.1109/WI.2006.202
- 6.Zhang L, Fang H, Ng WK, Zhang J (2011) In trank: interaction ranking-based trustworthy friend recommendation. In: Proceedings IEEE international conference on trust, security and privacy in computing and communications (Trust Com 11). IEEE Computer Society, pp 266–273. doi: 10.1109/TrustCom.2011.36
- 8.Kunegis J, Lommatzsch A, Bauckhage C (2009) The slashdot zoo: mining a social network with negative edges. In: Proceedings international word wide web conference (WWW 09). ACM Press, New York, pp 741–750. doi: 10.1145/1526709.1526809
- 9.Zhao D, Xiaolong F, Can Z, Ting L (2012) University campus social network system for knowledge sharing. In: Proceedings of international conference on systems and informatics (ICSAI 12), in pressGoogle Scholar