A Preference Prediction Method Based on the Optimization of Basic Similarity Space Distribution

被引:0
|
作者
Gao L. [1 ,2 ]
Gao Q. [1 ]
Wang H. [2 ]
Wang W. [2 ]
Yang K. [2 ]
机构
[1] College of Computer Science, Xi'an Polytechnic University, Xi'an
[2] School of Information Science and Technology, Northwest University, Xi'an
来源
| 2018年 / Science Press卷 / 55期
基金
中国国家自然科学基金;
关键词
Average nearest neighbor; Basic similarity space; Preference center; Recommender system; Similarity modify;
D O I
10.7544/issn1000-1239.2018.20160924
中图分类号
学科分类号
摘要
The similarity measure methods of preference behavior in the existing collaborative filtering based recommender systems are unable to acquire the real nearest neighbors, which have influenced the prediction accuracy. To solve this problem, an users' preference prediction method based on the optimization of basic similarity space distribution is proposed. In the beginning, this method uses cosine similarity, constrained cosine similarity and Pearson correlation coefficient to get the original similarities among users. Secondly, it generates the preference center based on the distribution characteristic of users' preference similarity, and then it get the average similarity range based on the behavior distance between other preference behavior and preference center to build the basic similarity space. Finally, the method generates the modified model based on average nearest neighbors and abnormal ratings to optimize the basic similarity space, and basing on which generate predictions for users. The authors present empirical experiments by using a real extensive data set. Experimental results show that the proposed method can achieve lower MAE about 12.8% and 9.7% compared with WSCF and OTCF, and the coverage rate is increased about 5.79% and 3.83%, and the diversity is the same with WSCF and is increased about 4.3% compared with OTCF, which indicates that the proposed method can efficiently improve recommendation quality. © 2018, Science Press. All right reserved.
引用
收藏
页码:977 / 985
页数:8
相关论文
共 19 条
  • [1] Liu Q., Chen E., Xiong H., Et al., Enhancing collaborative filtering by user interest expansion via personalized ranking, IEEE Trans on Systems Man and Cybernetics Part B Cybernetics, 42, 1, pp. 218-233, (2012)
  • [2] Das M.S., Amer Y.G., Mri: Meaningful interpretations of collaborative ratings, Processing of the VLDB Endowment, 4, 11, pp. 122-132, (2014)
  • [3] Fouss F., Pirotte A., Renders M., Et al., Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation, IEEE Trans on Knowledge and Data Engineering, 19, 3, pp. 355-369, (2014)
  • [4] Ma H., An experimental study on implicit social recommendation, Proc of the 36th Int ACM SIGIR Conf on Research and Development in Information Retrieval, pp. 73-82, (2013)
  • [5] Chen W., Hsu W., Lee M.L., Modeling user's receptiveness over time for recommendation, Proc of the 36th Int ACM SIGIR Conf on Research and Development in Information Retrieval, pp. 373-382, (2013)
  • [6] Zhu X., Song A., Dong F., Et al., A collaborative filtering recommendation mechanism for cloud computing, Journal of Computer Research and Development, 51, 10, pp. 2255-2269, (2014)
  • [7] Linden G., Smith B., York J., Amazon. com recommenda-tions: Item-to-item collaborative filtering, Internet Computing, 7, 1, pp. 76-80, (2003)
  • [8] Wang P., Wang J., Yu N., A kernel and user-based collaborative filtering recommendation algorithm, Journal of Computer Research and Development, 50, 7, pp. 1144-1151, (2013)
  • [9] Xue A.Y., Qi J., Xie X., Et al., Solving the data sparsity problem in destination prediction, Very Large Data Bases, 24, 2, pp. 219-243, (2015)
  • [10] Guo G., Zhang J., Thalmann D., Merging trust in collaborative filtering to alleviate data sparsity and cold start, Knowledge Based Systems, 57, 4, pp. 57-68, (2014)