Cold-start problem, which arises upon the new users arrival, is one of the fundamental problems in today's recommender approaches. Moreover, in some domains as TV or multime-dia-items take long time to experience by users, thus users usually do not provide rich preference information. In this paper we analyze the minimal amount of ratings needs to be done by a user over a set of items, in order to solve or reduce the cold-start problem. In our analysis we applied clustering data mining technique in order to identify minimal amount of item's ratings required from recommender system's users, in order to be assigned to a correct cluster. In this context, cluster quality is being monitored and in case of reaching certain cluster quality threshold, the rec-ommender system could start to generate recommendations for given user, as in this point cold-start problem is considered as resolved. Our proposed approach is applicable to any domain in which user preferences are received based on explicit items rating. Our experiments are performed within the movie and jokes recommendation domain using the MovieLens and Jester dataset.
翻译:新用户抵达后出现的冷点启动问题,是当今推荐方法的根本问题之一。此外,在电视或多米dia-dia-ite项目需要很长时间才能让用户体验到的一些领域,用户通常不会提供丰富的偏好信息。在本文件中,我们分析用户对一组项目的最低评级量,以解决或减少冷点启动问题。在我们的分析中,我们应用了数据挖掘技术,以便确定推荐系统用户需要的最低数量的项目评级,以便分配到正确的组群。在这方面,正在对集群质量进行监测,如果达到某些组群质量门槛,则校正组合系统可以开始为特定用户产生建议,因为在此点,冷点启动问题被认为已经解决了。我们提出的方法适用于根据明确的项目评级而获得用户偏好的任何领域。我们的实验是在电影Lens和Jester数据集的电影和笑话建议域内进行。