Search

Nowadays, the recommendation is an important task in the decision-making process about the selection of items especially when item space is large, diverse, and constantly updating. As a challenge in the recent systems, the preference and interest of users change over time, and existing recommender systems do not evolve optimal clustering with sufficient accuracy over time. Moreover, the behavior history of the users is determined by their neighbours. The purpose of the time parameter for this system is to extend the time-based priority. This paper has been carried out a time-aware recommender systems based on memetic evolutionary clustering algorithm called RecMem for recommendations. In this system, clusters that evolve over time using the memetic evolutionary algorithm and extract the best clusters at every timestamp, and improve the memetic algorithm using the chaos criterion. The system provides appropriate suggestions to the user based on optimum clustering. The system uses optimal evolutionary clustering using item attributes for the cold-start item problem and demographic information for the cold start user problem. The results show that the proposed method has an accuracy of approximately 0.95, which is more effective than existing systems. [ABSTRACT FROM AUTHOR]

Social annotation systems (SAS) allow users to annotate different online resources with keywords (tags). These systems help users in finding, organizing, and retrieving online resources to significantly provide collaborative semantic data to be potentially applied by recommender systems. Previous studies on SAS had been worked on tag recommendation. Recently, SAS-based resource recommendation has received more attention by scholars. In the most of such systems, with respect to annotated tags, searched resources are recommended to user, and their recent behavior and click-through is not taken into account. In the current study, to be able to design and implement a more precise recommender system, because of previous users' tagging data and users' current click-through, it was attempted to work on the both resource (such as web pages, research papers, etc.) and tag recommendation problem. Moreover, by applying heat diffusion algorithm during the recommendation process, more diverse options would present to the user. After extracting data, such as users, tags, resources, and relations between them, the recommender system so called 'Swallow' creates a graph-based pattern from system log files. Eventually, following the active user path and observing heat conduction on the created pattern, user further goals are anticipated and recommended to him. Test results on SAS data set demonstrate that the proposed algorithm has improved the accuracy of former recommendation algorithms. [ABSTRACT FROM AUTHOR]

Abstract: Web usage mining has become the subject of exhaustive research, as its potential for Web-based personalized services, prediction of user near future intentions, adaptive Web sites, and customer profiling are recognized. Recently, a variety of recommendation systems to predict user future movements through Web usage mining have been proposed. However, the quality of recommendations in the current systems to predict user future requests in a particular Web site is below satisfaction. To effectively provide online prediction, we have developed a recommendation system called WebPUM, an online prediction using Web usage mining system and propose a novel approach for classifying user navigation patterns to predict users’ future intentions. The approach is based on the new graph partitioning algorithm to model user navigation patterns for the navigation patterns mining phase. Furthermore, longest common subsequence algorithm is used for classifying current user activities to predict user next movement. The proposed system has been tested on CTI and MSNBC datasets. The results show an improvement in the quality of recommendations. Furthermore, experiments on scalability prove that the size of dataset and the number of the users in dataset do not significantly contribute to the percentage of accuracy. [Copyright &y& Elsevier]