Abstract
Social big data is large scale of data due to exponential popularity of social network and social media. Researchers can use social big data and social network for their observations if they analyse those in an intelligent manner. The target of intelligent decision is to find the most credible user in social network, who has the highest influence. A very large number of users are connected in social networks, implicitly friends-of-friends or explicitly mutual friends. They are able to communicate with each other and share their likes or dislikes on different topics. If users want to analyse any topic or purchase product like movie, book, they are populated with a lot of choices. Information overload due to large number of choices available to users limits effective product selection and hence results in reduced users’ satisfaction. Recommendation models are solution for providing better suggestion to users. Product’s recommendation at Amazon, friend’s recommendation at Facebook and music recommendation at iTunes are some of the popular examples of suggestions made on the basis of user’s interests. Recommendation models ease the user by reducing search space in social network graph. The main purpose of this paper is to improve social recommendations so that better and more appropriate choices are available for users. In this paper, an efficient technique for social recommendations using hyperedge and transitive closure is proposed. Social big data is processed and analysed in the form of social graphs. User–user and user–item connections are represented in the form of matrices. We have exploited homophily so that large number of connected users have trust on each other. Our model provides better recommendation to users by leveraging increased trust. The proposed model overcomes the limitations of traditional recommender systems like sparsity, cold start. It also improves prediction accuracy. The proposed model is evaluated through different metrics like MAE, precision, recall and RMSE. Empirical analysis shows significant improvement in recommendations. We have used Mahout library for improving recommendation accuracy and also handling large volume of data. SNAP library is also used for analysis of social big graphs. The proposed recommendation model is evaluated using Epinions and FilmTrust datasets. These datasets contain user’s ratings for various products in the scale of 1–5. Through analysis it is verified that the proposed model boosts the performance significantly. We have formulated recommendation model using manipulated social graph as per our proposed technique. This manipulated graph is mentioned as influence product graph (IPG) throughout this paper. IPG increases social trust value between connected users and this effect in recommending products in an effective and efficient manner.





Similar content being viewed by others
References
Bello-Orgaz G, Jung J, Camacho D (2016) Social big data: recent achievements and new challenges. Inf Fusion 28:45–59
Tang J, Sun J, Wang C, Yang Z (2009) Social influence analysis in large-scale networks. In: Proceedings of Knowledge Discovery and Data Mining, pp 807–816
Huang Z, Chung W, Chen H (2004) A graph model for E-commerce recommender systems. J Am Soc Inf Sci Technol 55(3):259–274
Pan W, Zhong H, Xu C, Ming Z (2015) Adaptive Bayesian personalized ranking for heterogeneous implicit feedbacks. Knowl Based Syst 73:173–180
Guo G, Zhang J, Smith N (2016) A novel recommendation model regularized with user trust and item ratings. IEEE Trans Knowl Data Eng 28(7):1607–1620
Leskovec J, Singh A, Kleinberg J (2006) Patterns of Influence in a Recommendation Network. In: Ng WK, Kitsuregawa M, Li J, Chang K (eds) Advances in knowledge discovery and data mining. PAKDD 2006. Lecture notes in Computer Science, vol 3918. Springer, Berlin, Heidelberg
Su X, Khoshgoftaar T (2009) A survey of collaborative filtering techniques. Adv Artif Intell 2009:421425
Ishikawa H (2015) Social big data mining. CRC Press, Boca Raton
Balabonovic M, Shoham Y (1997) Fab : content-based, collaborative recommendation. Commun ACM 40(3):66–72
Resnick P, Varian H (1997) Recommender systems. Commun ACM 40(3):56–58
Koren Y (2010) Factor in the neighbors: scalable and accurate collaborative filtering. ACM Trans Knowl Discov Data 4(1):1
Linden G, Smith B, York J (2003) Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Comput 7(1):76–80
Deshpande M, Karypis G (2004) Item-based top-N recommendation. ACM Trans Inf Syst 22(1):143–177
Jiang M, Cui P, Chen X, Wang F, Zhu W, Yang S (2015) Social recommendation with cross-domain transferable knowledge. IEEE Trans Knowl Data Eng 27(11):3084–3097
Chen H, Li X, Huang Z (2005) Link prediction approach to collaborative filtering. In: Proceedings of 5th ACM/IEEE-CS Joint conference on Digital Libraries, pp 141–142
Herlocker J, Konstan L, Terveen L, Riedl J (2004) Evaluating collaborative filtering recommender systems. ACM Trans Inf Syst 22(1):5–53
Ma H, Yang H, Lyu M, King I (2008) Sorec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp 931–940
Bedi P, Kaur H, Marwaha S (2007) Trust based recommender system for semantic web. In: Proceedings of International Joint Conference on Artificial Intelligence, pp 2677–2682
Huang J, Cheng X, Guo J, Shen H, Yang K (2010) Social recommendation with interpersonal influence. In: Proceedings of European Conference on Artificial Intelligence. pp 601–606
Ma H, Zhou T, Lyu M, King I (2011) Improving recommender systems by incorporating social contextual information. ACM Trans Inf Syst 29(2):9
Guy I, Zwerdling N, Carmel D, Ronen I, Uziel E, Yogev S, Ofek-Koifman S (2009) Personalized recommendation of social software items based on social relations. In: Proceedings of Third ACM Conference on Recommender Systems, pp 53–60
Amatriain X, Jaimes A, Oliver N, Pujol J (2011) Data mining methods for recommender system . Recommender Systems Handbook Springer pp 39–71
Ma H, King I, Lyu M (2007) Effective missing data prediction for collaborative filtering. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp 39–46
Than C, Han S (2014) Improving recommender systems by incorporating similarity, trust and reputation. J Internet Serv Inf Sec 4(1):64–76
Kschischang F, Frey B, Loeliger H (2001) Factor graphs and the sum-product algorithm. IEEE Trans Inf Theory 47(2):498–519
Yin Z, Gupta M, Weninger T, Han J (2010) LINKREC: a unified framework for link recommendation with user attributes and graph structure. In: Proceedings of 19th International Conference on World Wide Web, ACM, pp 1211–1212
Roy S, Ravindran B (2015) Measuring network centrality using hypergraphs. In: Proceedings of the Second ACM IKDD Conference on Data Sciences, pp 59–68
Ma H, Zhou D, Liu C, Lyu M, King I (2011) Recommender systems with social regularization. In: Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM), pp 287–296
Jamali M, Ester M (2010) A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of the ACM Conference on Recommender Systems(RecSys), pp 135–142
Yang B, Lei Y, Liu D, Liu J (2013) Social collaborative filtering by trust. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp 2747–2753
Adomavicius G, Tuzhilin A (2005) Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng 17(6):734–749
Mello Neto W, Nowe A (2012) Insights on social recommender system. In: Beyond RMSE ACM RecSys, International Workshop on Recommendation Utility Evaluation
Resnic P, Iacovou N, Suchak M, Bergstrom P, Riedl J (1994) Grouplens: an open architecture for collaborative filering of netnews. In: Proceedings of ACM Conference on Computer Supported Cooperative Work
Yang S, Long B, Smola A, Sadagopan N, Zheng Z, Zha H (2011) Like like alike: joint friendship and interest propagation in social networks. In: Proceedings on International Conference on World Wide Web, ACM, pp 537–546
Yuan Q, Chen L, Zhao S (2011) Factorization vs regularization: fusing heterogeneous social relationships in top-n recommendation. In: Proceedings of the 5th ACM Conference on Recommender Systems, pp 245–252
Jamali M, Ester M (2009) TrustWalker: a random walk model for combining trust-based and item-based recommendations. In: Proceedings of Knowledge Discovery Data Mining, pp 397–406
Wu X, Zhu X, Wu G, Ding W (2014) Data mining with big data. IEEE Trans Knowl Data Eng 26(1):97–107
Lin J, Ryaboy D (2013) Scaling big data mining infrastructure: the twitter experience. Proc SIGKDD 14(2):6–19
Elser B, Montresor A (2013) An evaluation study of big data frameworks for graph processing. In: Proceedings of IEEE International Conference on Big Data, pp 60–67
Seo S, Yoon EJ, Kim J, Jin S, Kim JS, Maeng S (2010) Hama: an efficient matrix computation with the mapreduce framework. In: Proceedings of the Second International Conference of Cloud Computing Technology and Science IEEE, pp 721–726
Wang G, Shen Y, Ouyang M (2008) A vector partitioning approach to detecting community structure in complex networks. Comput Math Appl 55(12):2746–2752
Mukkamala R,Hussain A, Vatrapu R (2014) Towards a set theoretical approach to big data analytics. In: Proceedings of IEEE International Congress on Big Data, pp 629–636
Herlocker J, Konstan J, Borchers A, Riedl J (1999) An algorithmic framework for performing collaborative filtering. In: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp 230–237
Zhao Z, Lu H, Cai D, He X, Zhuang Y (2016) User preference learning for online social recommendation. IEEE Trans Knowl Eng 28(9):2522–2534
Bell R, Koren Y, Volinsky C (2007) Modeling relationships at multiple scales to improve accuracy of large recommender systems. In: Proceedings of International SIGKDD Conference on Knowledge Discovery and Data Mining, pp 95–104
Jamali M, Ester M (2009) Using a trust network to improve top-N recommendation. In: Proceedings of the Third ACM Conference on Recommender Systems, pp 181–188
Bellogin A, Parapar J (2012) Using graph partitioning techniques for neighbour selection in user-based collaborative filtering. In: Proceedings of the Sixth ACM Conference on Recommender Systems, pp 213–216
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bathla, G., Aggarwal, H. & Rani, R. A graph-based model to improve social trust and influence for social recommendation. J Supercomput 76, 4057–4075 (2020). https://doi.org/10.1007/s11227-017-2196-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-017-2196-2