期刊文献+

An Entity-Association-Based Matrix Factorization Recommendation Algorithm 被引量:2

下载PDF
导出
摘要 Collaborative filtering is the most popular approach when building recommender systems,but the large scale and sparse data of the user-item matrix seriously affect the recommendation results.Recent research shows the user’s social relations information can improve the quality of recommendation.However,most of the current social recommendation algorithms only consider the user's direct social relations,while ignoring potential users’interest preference and group clustering information.Moreover,project attribute is also important in item rating.We propose a recommendation algorithm which using matrix factorization technology to fuse user information and project information together.We first detect the community structure using overlapping community discovery algorithm,and mine the clustering information of user interest preference by a fuzzy clustering algorithm based on the project category information.On the other hand,we use project-category attribution matrix and user-project score matrix to get project comprehensive similarity and compute project feature matrix based on Entity Relation Decomposition.Fusing the user clustering information and project information together,we get Entity-Association-based Matrix Factorization(EAMF)model which can be used to predict user ratings.The proposed algorithm is compared with other algorithms on the Yelp dataset.Experimental studies show that the proposed algorithm leads to a substantial increase in recommendation accuracy on Yelp data set.
出处 《Computers, Materials & Continua》 SCIE EI 2019年第1期101-120,共20页 计算机、材料和连续体(英文)
基金 This work was supported by the National Natural Science Foundation of China(61772337,61472248 ,U1736207) the SJTU-Shanghai Songheng Content Analysis Joint Lab,and program of Shanghai Technology Research Leader(Grant No.16XD1424400).
  • 相关文献

参考文献1

二级参考文献23

  • 1Ma H, King I, Lyu M. Learning to recommend with social trust ensemble[CJ //Proc of the 32nd ACM Int Conf on Research and Development in Information Retrieval. New York: ACM, 2009: 203-210.
  • 2Ma H, Yang H, Lyu M, et al. Sorce. Social recommendation using probabilistic matrix factorization[CJ I/Proc of the 17th ACM Conf on Information and Knowledge Management. New York: ACM, 2008: 931-940.
  • 3Yeung A C, Iwata T. Strength of social influence in trust networks in product review sites[C] I/Proc of the 4th ACM Int Conf on Web Search and Data Mining. New York: ACM, 2011: 495-504.
  • 4Yang X, Steck H, Liu Y. Circle-based recommendation in online social networks[CJ I/Proc of the 18th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2013: 1267-1275.
  • 5Jamali M, Ester M. A matrix factorization technique with trust propagation for recommendation in social networks[CJ I/Proc of the 4th ACM Conf on Recommender Systems. New York: ACM, 2010: 135-142.
  • 6lin R, ChaiJ, Si L. An automatic weighting scheme for collaborative filtering[C] //Proc of the 27th Annual Int ACM SIGIR Conf on Research and Development in Information Retrieval. New York: ACM, 2004: 337-344.
  • 7Xue G, Lin C, Yang Q, et al. Scalable collaborative filtering using cluster-based smoothing[CJ //Proc of the 28th Annual Int ACM SIGIR Conf on Research and Development in Information Retrieval. New York: ACM, 2005: 114-121.
  • 8Sarwar B, Karypis G, KonstanJ, et al. Item-based collaborative filtering recommendation algorithms[CJ IIProc of the 10th Int Conf on World Wide Web. New York: ACM, 2001: 285-295.
  • 9CannyJ. Collaborative filtering with privacy via factor analysis[CJ IIProc of the 25th Annual Int ACM SIGIR Conf on Research and Development in Information Retrieval. New York: ACM, 2002: 238-245.
  • 10Hofmann T. Collaborative filtering via gaussian probabilistic latent semantic analysis[CJ //Proc of the 26th Annual Int ACM SIGIR Conf on Research and Development in Informaion Retrieval. New York: ACM, 2003: 259-266.

共引文献39

同被引文献11

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部