Novel Web community recommendation based on user neighborhood and topic

被引：0
|
作者：
Yu Q. [2 ]
Peng Z.-Y. [1 ,2 ]
Hong L. [3 ]
Wan Y.-L. [2 ]
机构：
[1] State Key Laboratory of Software Engineering (Wuhan University), Wuhan
[2] School of Computer, Wuhan University, Wuhan
[3] School of Information Management, Wuhan University, Wuhan
来源：
Ruan Jian Xue Bao/Journal of Software | 2016年 / 27卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Novel recommendation; Topic taxonomy; User neighborhood; Web community;
D O I：
10.13328/j.cnki.jos.004882
中图分类号：
学科分类号：
摘要：
Community recommendation has become increasingly important in sifting valuable communities from massive amounts of communities on the Internet. In recent years novel recommendation is attracting attention, because of the limitation of accurate recommendation which purely pursues accuracy. Existing novel recommendation methods are not suitable for Web community as they fail to utilize unique features of Web community, including the social network established by interactions between users, and the topics of Web community. In this paper, a novel recommendation method, NovelRec, is proposed to suggest communities that users have not seen but are potentially interested in, in order to better broaden users' horizons and improve the development of communities. Specifically, the method explores neighborhood relationships and topical associations from the aforementioned features. First, NovelRec identifies candidate communities for users based on neighborhood relationships between users, and computes accuracy of the candidates using topical associations between users. Next, NovelRec computes novelty of the candidates based on a new metric of user-community distance, and the distance metric is defined by associations between users and communities on both user neighborhood and topic taxonomy. Finally, NovelRec balances novelty with accuracy for the candidates to improve the overall recommendation quality. Experimental results on a real data set of Douban communities show that the proposed method outperforms competitors on the recommendation novelty, and guarantees the recommendation accuracy. © Copyright 2016, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：1266 / 1284
页数：18
相关论文
共 26 条
  • [1] Deshpande M., Karypis G., Item-Based top-n recommendation algorithms, ACM Trans. on Information Systems, 22, 1, pp. 143-177, (2004)
  • [2] Castagnos S., Boyer A., A client/server user-based collaborative filtering algorithm: Model and implementation, Proc. of the European Conf. on Artificial Intelligence, pp. 617-621, (2006)
  • [3] Wang J., De Vries A.P., Reinders M.J.T., Unifying user-based and item-based collaborative filtering approaches by similarity fusion, Proc. of the Int'l ACM SIGIR Conf. on Research and Development in Information Retrieval, pp. 501-508, (2006)
  • [4] Chen W.Y., Chu J.C., Luan J., Bai H., Wang Y., Chang E.Y., Collaborative filtering for orkut communities: Discovery of user latent behavior, Proc. of the Int'l Conf. on World Wide Web, pp. 681-690, (2009)
  • [5] Konstas I., Stathopoulos V., Jose J.M., On social networks and collaborative recommendation, Proc. of the Int'l ACM SIGIR Conf. on Research and Development in Information Retrieval, pp. 195-202, (2009)
  • [6] Jiang M., Cui P., Liu R., Yang Q., Wang F., Zhu W., Yang S.Q., Social contextual recommendation, Proc. of the ACM Int'l Conf. on Information and Knowledge Management, pp. 45-54, (2012)
  • [7] Mcnee S.M., Riedl J., Konstan J.A., Being accurate is not enough: How accuracy metrics have hurt recommender systems, Proc. of the CHI 2006 Extended Abstracts on Human Factors in Computing Systems, pp. 1097-1101, (2006)
  • [8] Oh J., Park S., Yu H., Song M., Park S.T., Novel recommendation based on personal popularity tendency, Proc. of the Int'l Conf. on Data Mining, pp. 507-516, (2011)
  • [9] Yin H.Z., Cui B., Li J., Yao J.J., Chen C., Challenging the long tail recommendation, Proc. of the VLDB Endowment, pp. 896-907, (2012)
  • [10] Onuma K., Tong H.H., Faloutsos C., TANGENT: A novel, "Surprise me", recommendation algorithm, Proc. of the ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp. 657-666, (2009)
123