基于序列挖掘的兴趣点推荐算法

    Sequence Mining-based Interest Point Recommendation Algorithm

    • 摘要: 为了降低隐式反馈、数据稀疏性和内容多元化等因素对兴趣点(point of interest,POI)推荐算法的影响,提升推荐准确性,提出基于序列挖掘的兴趣点推荐算法.首先在数据预处理阶段,使用负采样法生成数据集中不存在的数据作为负样本,然后通过矩阵分解法学习用户和地点各自的隐特征向量,并根据地点之间的影响关系排列出候选推荐点.在公开数据集FourSquare和Gowalla上实现2个POI访问序列上的实验验证,结果表明:该算法的准确率比传统方法有很大的提升.

       

      Abstract: To reduce the influence of implicit feedback, data sparsity and content diversification on the recommendation algorithm of interest points and improve the accuracy of recommendation, a point of interest (POI) recommendation algorithm based on sequence mining was proposed in this paper. First, in the data preprocessing stage, the negative sampling method was used to generate data that does not exist in the data set as negative samples. Then, the matrix decomposition method was used to learn the implicit feature vectors of users and locations, and arrange candidate recommendation points according to the relationship between sites.Experiments on two POI access sequences were implemented on the open dataset FourSquare and Gowalla. Results show that the accuracy of the algorithm is much higher than that of the traditional method.

       

    /

    返回文章
    返回