Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Call For Paper : Vol 11, Issue 08, August 2024

Call for Paper

Vol 11, Issue 08, August 2024

Indexing

Social Recommendation with Cross-Domain Transferable Knowledge

Author : Ajin Brabasher A 1 MadhanKumar M 2 VeeraKumar M 3 Krishna Moorthi R 4

PDF

Date of Publication :7th April 2016

Abstract: Social recommendation forms a specific type of information filtering technique that attempts to suggest information (blog, news, music, travel plans, web pages, images, tags, etc.) that are likely to interest the users.Social recommendation involves the investigation of collective intelligence by using computational techniques such as machine learning, data mining, natural language processing, etc. Social behavior data collected from the blogs, wikis, recommender systems, question & answer communities, query logs, tags, etc. from areas such as social networks, social search, social media, social bookmarks, social news, social knowledge sharing, and social games. In this tutorial, it will introduce collaborative filtering (CF) techniques, social recommendation and hybrid random walk (HRW) method.The social recommendation system is conducted according to the messages and social structure of target users. The similarity of the discovered features of users and products will then be calculated as the essence of the recommendation engine. A case study will be included to present how the recommendation system works based on real data.

Reference :

    1. Social Recommendation withCross-Domain Transferable Knowledge,vol27,nov 2015.
    2. H. Ma, D. Zhou, C. Liu, M. R. Lyu, and I. King, “Recommender system with social regularization,” in Proc. 4th ACM Int. Conf. Web Search Data Mining, 2011, pp. 287–296.
    3. I. Konstas, V. Stathopoulos, and J. M. Jose, “On social networks and collaborative recommendation,” in Proc. 32nd Annu. Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2009, pp. 195–202.
    4. J. Wang, H. Zeng, Z. Chen, H. Lu, L. Tao, and W. Ma, “ReCoM: Reinforcement clustering of multi-type interrelated data objects,” in Proc. Annu. Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2003, pp. 274–281
    5. J. Brown, A. J. Broderick, and N. Lee, “Word of mouths communi-cation within online communities: Conceptualizing the online social network,” J. Interactive Marketing, vol. 21, pp. 2–20, 2007.
    6. J. Leskovec, A. Singh, and J. Kleinberg, “Patterns of influence in a recommendation network,” in Proc. 10th Pacific-Asia Conf. Knowl. Discovery Data Mining, 2006, vol. 3918, pp. 380–389.
    7. X. Yang, H. Steck, and Y. Liu, “Circle-based recommendation in online social networks,” in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2012, pp. 1267–1275.
    8. X. Qian, H. Feng, G. Zhao, and T. Mei, “Personalized recommen-dation combining user interest and social circle,” IEEE Trans. Knowl. Data Eng., vol. 26, no. 7, pp. 1763–1777, Jul. 2014.
    9. P. Massa and P. Avesani, “Trust-aware recommender systems,” in Proc. ACM Conf. Recommender Syst., 2007, pp. 17–24. pp.M. Jamali and M. Ester, “TrustWalker: A random walk model for combining trust-based and itembased recommendation,” in Proc. 15th ACM SIGKDD Int. Conf. Knowl.
    10. N. N. Liu, M. Zhao, and Q. Yang, “Probabilistic latent preference analysis for collaborative filtering,” in Proc. 18th ACM Conf. Inf. Knowl. Manage., 2009, pp. 759– 766.
    11. M. Harvey, M. J. Carman, I. Ruthven, and F. Crestanig, “Bayesian latent variable models for collaborative item rating prediction,” in Proc. ACM Conf. Inf. Knowl. Manage., 2011, pp. 699– 708.
    12. J. Noel, S. Sanner, K. N. Tran, P. Christen, L. Xie, E. V. Bonilla, E. Abbasnejad, and E. D. Penna, “New objective functions for social collaborative filtering,” in Proc. 21st Int. Conf. World Wide Web, 2012, pp. 859– 868.
    13. H. Ma, H. Yang, M. R. Lyu, and I. King, “SoRec: Social recommen-dation using probabilistic matrix factorization,” in Proc. ACM Conf. Inf. Knowl. Manage., 2008, pp. 931–940.
    14. M. Jiang, P. Cui, R. Liu, F. Wang, W. Zhu, and S. Yang, “Scalable recommendation with social contextual information,” IEEE Trans. Knowl. Data Eng., vol. 26, no. 11, pp. 2789–2802, Nov. 2014.
    15. P. Winoto and T. Tang, “If you like the devil wears prada the book, will you also enjoy the devil wears prada the movie? a study of cross-domain recommendations,” New Generation Comput., vol. 26, no. 3, pp. 209–225, 2008.
    16. J. Tang, S. Wu, J. Sun, and H. Su, “Cross-domain collaboration rec-ommendation,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2012, pp. 1285–1293.
    17. C. Li and S. Lin, “Matching users and items across domains to improve the recommendation quality,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2014, pp. 801–810.
    18. Y. Shi, M. Larson, and A. Hanjalic, “Collaborative filtering beyond the user-item matrix: A survey of the state of the art and future challenges,” ACM Comput. Surv., vol. 47, no. 1, p. 3, 2014.
    19. S. Berkovsky, T. Kuflik, and F. Ricci, “Crossdomain mediation in collaborative filtering,” in Proc. 11th Int. Conf. User Model., 2007, 355–359.S. Gao, H. Luo, D. Chen, S. Li, P. Gallinari, and J. Guo, “Cross-domain recommendation via clusterlevel latent factor model,” in Proc. Mach. Learn. Knowl. Discovery Databases, 2013, pp. 161–176.
    20. W. Chen, W. Hsu, and M. L. Lee, “Making recommendations from multiple domains,” in Proc. ACM SIGKDD Int. Conf. Knowl. Dis-covery Data Mining, 2013, pp. 892–900.
    21. J. Tang, X. Hu, H. Gao, and H. Liu, “Exploiting local and global social context for recommendation,” in Proc. 23rd Int. Joint Conf. Artif. Intell., 2013, pp. 2712–2718.
    22. J. Tang, X. Hu, and H. Liu, “Social recommendation: A review,” Soc. Netw. Anal. Mining, vol. 3, no. 4, pp. 1113–1133, 2013.
    23. S. Sedhain, S. Sanner, L. Xie, R. Kidd, K. N. Tran, and P. Christen, “Social affinity filtering: Recommendation through fine-grained analysis of user interactions and activities,” in Proc. 1st ACM Conf. Online Soc. Netw., 2013, pp. 51–62
    24. B. Shapira, L. Rokach, and S. Freilikhman, “Facebook single and cross domain data for recommendation systems,” User Model. UserAdapted Interaction, vol. 23, no. 2-3, pp. 211–247, 2013
    25. S. Sedhain, S. Sanner, D. Braziunas, L. Xie, and J. Christensen, “Social collaborative filtering for coldstart recommendations.” in Proc. ACM Conf. Recommender Syst., 2014, pp. 345–348.
    26. Y. Chen, Y. Lin, Y. Shen, and S. Lin, “A modified random walk framework for handling negative ratings and generating explan-ations,” ACM Trans. Intell. Syst. Technol., vol. 4, no. 1, p. 12, 2013.
    27. G. Adomavicius and A. Tuzhilin, “Toward the next generation of recommender systems: A survey of the state-of-the-art and possi-ble extensions,” IEEE Trans. Knowl. Data Eng., vol. 17, no. 6, 734–749, Jun. 2005.
    28. S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE Trans. Knowl. Data Eng., vol. 22, no. 10, pp. 1345–1359, Oct. 2010.
    29. B. Cao, N. N. Liu, and Q. Yang, “Transfer learning for collective link prediction in multiple heterogeneous domains,” in Proc. Int. Conf. Mach. Learn., 2010, pp. 159–166.
    30. Y. Zhu, Y. Chen, Z. Lu, S. J. Pan, G.-R. Xue, Y. Yu, and Q. Yang, “Heterogeneous transfer learning for image classification,” in Proc. 25th AAAI Conf. Artif. Intell., 2011, pp. 1–9.
    31. O. Moreno, B. Shapira, L. Rokach, and G. Shani, “Talmud: Trans-fer learning for multiple domains,” in Proc. ACM Conf. Inf. Knowl. Manage., 2012, pp. 425–434.
    32. Z. Lu, W. Pan, E. W. Xiang, Q. Yang, L. Zhao, and E. Zhong, “Selective transfer learning for cross domain recommendation,” in Proc. 13th SIAM Int. Conf. Data Mining, 2013, pp. 641–649.
    33. B. Tan, E. Zhong, M. K. Ng, and Q. Yang, “Mixedtransfer: Trans-fer learning over mixed graphs,” in Proc. 14th SIAM Int. Conf. Data Mining, 2014, pp. 208–216.
    34. W. Pan, E. W. Xiang, N. N. Liu, and Q. Yang, “Transfer learning in collaborative filtering for sparsity reduction,” in Proc. 25th AAAI Conf. Artif. Intell., 2010, pp. 230–235.
    35. B. Li, Q. Yang, and X. Xue, “Can movies and books collaborate? cross-domain collaborative filtering for sparsity reduction,” in Proc. 21st Int. Jont Conf. Artif. Intell., 2009, vol. 9, pp. 2052–2057.
    36. H. Jing, A.-C. Liang, S.-D. Lin, and Y. Tsao, “A transfer probabilis-tic collective factorization model to handle sparse data in collabo-rative filtering,” in Proc. Int. Conf. Data Mining, 2014, pp. 250–259.
    37. H. Tong, C. Faloutsos, and J. Pan, “Fast random walk with restart and its applications,” in Proc. Int. Conf. Data Mining, 2006, 613–622.
    38. M. Gori and A. Pucci, “ItemRank: A random-walk based scoring algorithm for recommender engines,” in Proc. Int. Jont Conf. Artif. Intell., 2007, pp. 2766–2771.
    39. B. Gao, T. Liu, X. Zheng, Q. Cheng, and W. Ma, “Consistent bipar-tite graph co-partitioning for starstructured high-order heteroge-neous data coclustering,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2005, pp. 41–50
    40. B. Gao, T. Liu, and W. Ma, “Star-structured highorder heteroge-neous data co-clustering based on consistent information theory,” in Proc. Int. Conf. Data Mining, 2006, pp. 880–884.
    41. C. Avin and B. Krishnamachari, “The power of choice in random walks: An empirical study,” Comput. Netw., vol. 52, no. 1, pp. 44– 60, 2008.
    42. Safro, P. D. Hovland, J. Shin, and M. M. Strout, “Improving ran-dom walk performance,” in Proc. Int. Conf. Sci. Comput., 2009,

Recent Article