【24h】

Prediction of Preferences through Optimizing Users and Reducing Dimension in Collaborative Filtering System

机译:协同过滤系统中通过优化用户和缩小维度来预测偏好

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Collaborative filtering systems employ statistical techniques to find a set of users known as neighbors, who have a history of agreeing with the target user. However, the problems associated with high dimensionality in the recommender systems have been discussed in several studies. In addition, the degree of correlation is computed between only two users. Although the preference correlation of two users may not be very high, their preferences can serve as useful data for preference prediction. The preference information of the two users, however, cannot be used to give a recommendation because the degree of their mutual correlation is low. The users preferences in collaborative filtering systems are not necessarily accurate information. Carelessly entered information stored in the collaborative filtering database must be excluded. In this paper, Entropy is used for optimizing users. Bayesian classification shall be used to classify items to lower the dimension of the user-item matrix in this paper. To extract the features of items this paper uses association word mining. Since this method is representing document as a set of association words, it prevents users from being confused by word sense disambiguation. Also, the users can be put into clusters by using the genetic algorithm on the classified items to solve the problems of previous clustering algorithm such as the need to predefine the number of clusters, the high sensitivity to noise in data, and the possibility their resulting data would converge with the region's optimal solution. Finally, it predicts typical preferences by using entropy to solve the problem depending on the correlation match between only two users. The typical preferences mean pseudo preferences that represent preferences of items within the group. A dynamic recommendation for an item is made using the typical preference. To give dynamic recommendations to users, the process of classifying users receiving recommendations into the most suitable group takes precedence.
机译:协作过滤系统采用统计技术来查找称为邻居的一组用户,这些用户具有与目标用户一致的历史记录。但是,在一些研究中已经讨论了与推荐系统中的高维度相关的问题。另外,仅在两个用户之间计算相关度。尽管两个用户的偏好相关性可能不是很高,但是他们的偏好可以用作有用的数据,以进行偏好预测。但是,由于两个用户的相互关联度低,因此不能用于推荐。协作过滤系统中的用户偏好不一定是准确的信息。必须排除存储在协作过滤数据库中的粗心输入的信息。在本文中,熵用于优化用户。本文采用贝叶斯分类对项目进行分类,以降低用户-项目矩阵的维数。为了提取项目的特征,本文使用关联词挖掘。由于此方法将文档表示为一组关联词,因此可以防止用户因词义歧义而感到困惑。此外,可以通过对分类项目使用遗传算法将用户置于集群中,以解决以前的集群算法的问题,例如需要预先定义集群的数量,对数据噪声的高敏感性以及由此产生的可能性。数据将与该区域的最佳解决方案融合。最后,它仅通过两个用户之间的相关匹配,使用熵来解决问题,从而预测出典型的偏好。典型首选项是指伪首选项,代表组中项目的首选项。使用典型首选项对项目进行动态推荐。为了向用户提供动态建议,将接收建议的用户分类为最合适的组的过程优先。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号