首页> 外文期刊>Journal of Software Engineering and Applications >A Hybrid Web Recommendation System Based on the Improved Association Rule Mining Algorithm
【24h】

A Hybrid Web Recommendation System Based on the Improved Association Rule Mining Algorithm

机译:基于改进关联规则挖掘算法的混合Web推荐系统

获取原文
       

摘要

As the growing interest of web recommendation systems those are applied to deliver customized data for their users, we started working on this system. Generally the recommendation systems are divided into two major categories such as collaborative recommendation system and content based recommendation system. In case of collaborative recommendation systems, these try to seek out users who share same tastes that of given user as well as recommends the websites according to the liking given user. Whereas the content based recommendation systems tries to recommend web sites similar to those web sites the user has liked. In the recent research we found that the efficient technique based on association rule mining algorithm is proposed in order to solve the problem of web page recommendation. Major problem of the same is that the web pages are given equal importance. Here the importance of pages changes according to the frequency of visiting the web page as well as amount of time user spends on that page. Also recommendation of newly added web pages or the pages that are not yet visited by users is not included in the recommendation set. To overcome this problem, we have used the web usage log in the adaptive association rule based web mining where the association rules were applied to personalization. This algorithm was purely based on the Apriori data mining algorithm in order to generate the association rules. However this method also suffers from some unavoidable drawbacks. In this paper we are presenting and investigating the new approach based on weighted Association Rule Mining Algorithm and text mining. This is improved algorithm which adds semantic knowledge to the results, has more efficiency and hence gives better quality and performances as compared to existing approaches.
机译:随着Web推荐系统对这些应用的日益增长的兴趣,这些推荐系统可用于为其用户提供自定义数据,因此我们开始研究此系统。通常,推荐系统分为两大类,例如协作推荐系统和基于内容的推荐系统。在协作推荐系统的情况下,这些尝试寻找具有与给定用户相同品味的用户,并根据喜欢的给定用户来推荐网站。基于内容的推荐系统试图推荐与用户喜欢的网站相似的网站。在最近的研究中,我们发现为了解决网页推荐问题,提出了一种基于关联规则挖掘算法的高效技术。相同的主要问题是网页具有同等的重要性。这里,页面的重要性根据访问网页的频率以及用户在该页面上花费的时间而变化。另外,对新添加的网页或用户尚未访问的页面的推荐也不包括在推荐集中。为了克服这个问题,我们在基于自适应关联规则的Web挖掘中使用了Web使用日志,其中将关联规则应用于个性化。该算法完全基于Apriori数据挖掘算法,以生成关联规则。然而,该方法还具有一些不可避免的缺点。在本文中,我们将介绍和研究基于加权关联规则挖掘算法和文本挖掘的新方法。这是一种改进的算法,与现有方法相比,该算法将语义知识添加到结果中,具有更高的效率,因此具有更好的质量和性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号