首页> 外文期刊>Neural computing & applications >Web page recommendation via twofold clustering: considering user behavior and topic relation
【24h】

Web page recommendation via twofold clustering: considering user behavior and topic relation

机译:通过双重聚类网页建议:考虑用户行为和主题关系

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

摘要

Web page recommendations have attracted increasing attention in recent years. Web page recommendation has different characteristics compared to the classical recommenders. For example, the recommender cannot simply use the user-item utility prediction method as e-commerce recommendation, which would face the repeated item cold-start problem. Recent researches generally classify the web page articles before recommending. But classification often requires manual labors, and the size of each category may be too large. Some studies propose to utilize clustering method to preprocess the web page corpus and achieve good results. But there are many differences between different clustering methods. For instance, some clustering methods are of high time complexity; in addition, some clustering methods rely on initial parameters by iterative computing whose results probably aren't stable. In order to solve the above issues, we propose a web page recommendation based on twofold clustering by considering both effectiveness and efficiency, and take the popularity and freshness factors into account. In our proposed clustering, we combined the strong points of density-based clustering and the k-means clustering. The core idea is that we used the density-based clustering in sample data to get the number of clusters and the initial center of each cluster. The experimental results show that our method performs better diversity and accuracy compared to the state-of-the-art approaches.
机译:网页建议近年来引起了不断的关注。与经典推荐相比,网页建议具有不同的特性。例如,推荐人不能简单地使用用户项实用程序预测方法作为电子商务推荐,这将面临重复的项目冷启动问题。最近的研究通常在推荐之前对网页文章进行分类。但分类通常需要手动劳动力,并且每个类别的大小可能太大。一些研究建议利用聚类方法预处理网页语料库并实现良好的效果。但不同聚类方法之间存在许多差异。例如,某些聚类方法具有很大的复杂性;此外,某些聚类方法通过迭代计算依赖初始参数,其结果可能不稳定。为了解决上述问题,我们通过考虑效率和效率,提出基于双重聚类的网页推荐,并考虑到普及和新鲜因素。在我们提出的聚类中,我们组合了基于密度的聚类和K-Means聚类的强点。核心思想是,我们使用示例数据中的基于密度的聚类来获取每个群集的群集数和初始中心。实验结果表明,与最先进的方法相比,我们的方法具有更好的多样性和准确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号