高级检索

    一种播存网络环境下的UCL协同过滤推荐方法

    A Collaborative Filtering Recommendation Method for UCL in Broadcast-Storage Network

    • 摘要: 信息资源在分发共享过程中存在带宽拥塞、内容冗余等问题,播存网络借助“一点对无限点”的物理广播分发共享信息资源,对解决此类问题有独特优势.播存网络采用统一内容标签(uniform content label, UCL)适配用户兴趣和推荐信息资源,用户如何高效地获得自己感兴趣的UCL是播存网络中的关键问题.针对该问题,提出一种播存网络环境下的UCL协同过滤推荐方法(unifying collaborative filtering with popularity and timing, UCF-PT).首先,通过设定一对相似度阈值来计算用户与UCL数据的稀疏情况,根据稀疏情况决定二者对UCL评分的影响权值,并基于二者权值预测用户对UCL的评分,生成推荐结果集.其次,依据UCL热度调整推荐结果集的UCL顺序,从而使热门UCL更容易推荐给用户;最后提出UCL价值衰减函数,保证较新的UCL具备较高的推荐优先级.实验结果表明:与传统推荐方法相比,该方法不仅具有良好的推荐精度,还可保证所推荐UCL的热度与时效性,更适用于在播存网络环境下推荐UCL.

       

      Abstract: Problems like bandwidth congestion, content redundancy exist in the sharing of information resources. Broadcast-Storage network has a particular advantage in solving these issues because of its unique feature of one to infinite by physical broadcast. Uniform content label, UCL, is used to express the needs of users and help users understand the information resources in Broadcast-Storage environment. Due to UCL’s large quantity, how to guide users to get their preferred UCLs efficiently is quite significant. To address this problem, this paper proposes a unifying collaborative filtering method with popularity and timing (UCF-PT) for UCL recommendation. First, a pair of thresholds are set to estimate the sparsity of users and UCLs in the dataset and determine the weights of users and UCLs in recommendation. Then UCF-PT predicts the ratings of users on UCLs based on the weights and generates a recommendation list. Moreover, the method makes popular and new UCLs more likely to be recommended by considering UCL popularity and using exponential decay in recommendation. Experiments show that, compared with traditional recommendation methods, the method proposed in this paper possesses better recommendation accuracy and ensures the popularity and novelty of recommended UCLs. Therefore, it is more suitable for recommending UCLs in Broadcast-Storage environment.

       

    /

    返回文章
    返回