首页> 外文期刊>Research journal of applied science, engineering and technology >Inspecting the Proficiency of Novel Algorithms on Sparse Data Domains for Efficient Recommendation-A Glance
【24h】

Inspecting the Proficiency of Novel Algorithms on Sparse Data Domains for Efficient Recommendation-A Glance

机译:检查针对有效推荐的稀疏数据域上新算法的熟练程度-概览

获取原文
           

摘要

Recommender systems have played a major role in almost all the domains today where human interaction happens with system. Depending on the user's choice, a recommender system presents some promising suggestions by observing all the activities of the user on the web and thus, helps to find out similar users and interested products. All the ratings provided by the user is stored in a rating matrix. Sometimes it so happens that the users may view the item, but not always rate it; which makes the dataset sparse. Performing operations on such sparse datasets by recommender engines may not give precise suggestions to the user. This study aims to make such sparse datasets denser by applying the two novel methods, FST and UTAOS; and thereby implementing any of the collaborative filtering techniques upon it to showcase the efficiency in recommendation. Results reveal that FST outperforms the UTAOS approach in terms of sparse datasets which paves the way for an efficient recommendation.
机译:推荐系统已在当今几乎所有与系统进行人机交互的领域中发挥了重要作用。根据用户的选择,推荐系统通过观察用户在Web上的所有活动来提出一些有前途的建议,从而有助于发现相似的用户和感兴趣的产品。用户提供的所有评分都存储在评分矩阵中。有时,用户可能会查看该项目,但并不总是对其进行评分;这会使数据集稀疏。推荐器引擎对此类稀疏数据集执行操作可能无法向用户提供准确的建议。本研究旨在通过应用FST和UTAOS这两种新方法来使这种稀疏数据集更加密集。从而在其上实施任何协作式过滤技术以展示推荐的效率。结果表明,就稀疏数据集而言,FST优于UTAOS方法,这为有效推荐铺平了道路。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号