首页> 外文期刊>Circuits and Systems >Alleviating the Cold Start Problem in Recommender Systems Based on Modularity Maximization Community Detection Algorithm
【24h】

Alleviating the Cold Start Problem in Recommender Systems Based on Modularity Maximization Community Detection Algorithm

机译:基于模块化最大化社区检测算法的推荐系统冷启动问题缓解

获取原文
           

摘要

Recommender system (RS) has become a very important factor in many eCommerce sites. In our daily life, we rely on the recommendation from other persons either by word of mouth, recommendation letters, movie, item and book reviews printed in newspapers, etc. The typical Recommender Systems are software tools and techniques that provide support to people by identifying interesting products and services in online store. It also provides a recommendation for certain users who search for the recommendations. The most important open challenge in Collaborative filtering recommender system is the cold start problem. If the adequate or sufficient information is not available for a new item or users, the recommender system runs into the cold start problem. To increase the usefulness of collaborative recommender systems, it could be desirable to eliminate the challenge such as cold start problem. Revealing the community structures is crucial to understand and more important with the increasing popularity of online social networks. The community detection is a key issue in social network analysis in which nodes of the communities are tightly connected each other and loosely connected between other communities. Many algorithms like Givan-Newman algorithm, modularity maximization, leading eigenvector, walk trap, etc., are used to detect the communities in the networks. To test the community division is meaningful we define a quality function called modularity. Modularity is that the links within a community are higher than the expected links in those communities. In this paper, we try to give a solution to the cold-start problem based on community detection algorithm that extracts the community from the social networks and identifies the similar users on that network. Hence, within the proposed work several intrinsic details are taken as a rule of thumb to boost the results higher. Moreover, the simulation experiment was taken to solve the cold start problem.
机译:推荐系统(RS)已成为许多电子商务站点中非常重要的因素。在我们的日常生活中,我们依靠别人的建议,包括口口相传,推荐信,电影,物品和报纸上印制的书评等。典型的推荐系统是通过识别他人为人们提供支持的软件工具和技术。在线商店中有趣的产品和服务。它还为搜索建议的某些用户提供建议。协同过滤推荐器系统中最重要的公开挑战是冷启动问题。如果没有足够的或足够的信息可用于新项目或新用户,则推荐系统会遇到冷启动问题。为了增加协作推荐系统的有用性,可能希望消除诸如冷启动问题之类的挑战。揭示社区结构对于理解至关重要,并且随着在线社交网络的日益普及而变得更加重要。社区检测是社交网络分析中的关键问题,在社区网络分析中,社区的节点彼此紧密连接,而其他社区之间则松散地连接。许多算法(例如Givan-Newman算法,模块化最大化,前导特征向量,步行陷阱等)用于检测网络中的社区。为了测试社区划分是否有意义,我们定义了一个称为模块化的质量函数。模块化是,社区中的链接高于这些社区中的预期链接。在本文中,我们尝试提供一种基于社区检测算法的冷启动问题解决方案,该算法从社交网络中提取社区并识别该网络上的相似用户。因此,在拟议的工作中,以一些固有的细节作为经验法则,以提高结果的准确性。此外,通过仿真实验解决了冷启动问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号