scholarly journals RECOMMENDER SYSTEMS: AN OVERVIEW

2021 ◽  
Vol 5 (3) ◽  
pp. 2-12
Author(s):  
Alisher Rustamov ◽  
◽  
Fayzi Bekkamov

Background. In this article, we look at the key advances in collaborative filtering recommender systems, focusing on the evolution from research focused solely on algorithms to research focused on the broad set of issues surrounding user experience with the recommender. The Internet provides a huge a

In recent years there is a drastic increase in information over the internet. Users get confused to find out best product on the internet of one’s interest. Here the recommender system helps to filter the information and gives relevant recommendations to users so that the user community can find the item(s) of their interest from huge collection of available data. But filtering information from the users reviews given for various items seems to be a challenging task for recommending the user interested things. In general similarities between the users are considered for recommendations in collaborative filtering techniques. This paper describes a new collaborative filtering technique called Adaptive Similarity Measure Model [ASMM] to identify similarity between users for the selection of unseen items. Out of all the available items most similarities would be sorted out by ASMM for recommendation which varies from user to user


2018 ◽  
Vol 45 (3) ◽  
pp. 387-397 ◽  
Author(s):  
Elias Pimenidis ◽  
Nikolaos Polatidis ◽  
Haralambos Mouratidis

This article identifies the factors that have an impact on mobile recommender systems. Recommender systems have become a technology that has been widely used by various online applications in situations where there is an information overload problem. Numerous applications such as e-Commerce, video platforms and social networks provide personalised recommendations to their users and this has improved the user experience and vendor revenues. The development of recommender systems has been focused mostly on the proposal of new algorithms that provide more accurate recommendations. However, the use of mobile devices and the rapid growth of the Internet and networking infrastructure have brought the necessity of using mobile recommender systems. The links between web and mobile recommender systems are described along with how the recommendations in mobile environments can be improved. This work is focused on identifying the links between web and mobile recommender systems and to provide solid future directions that aim to lead in a more integrated mobile recommendation domain.


Author(s):  
Dawn E. Holmes

Since the use of computers became feasible in commercial enterprise, there has been interest in using computers to improve efficiency, cut costs, and generate profits. When IBM launched the IBM-PC in 1981, with the use of floppy disks for data storage, the idea really took off for business, but it was the widespread adoption of the Internet that made e-commerce a practical proposition. ‘Big data, big business’ considers pay-per-click advertising, cookies, targeted advertising, recommender systems, and collaborative filtering used by a wide range of businesses. Alongside the analysis of business practices it provides case studies on Amazon and Netflix, each highlighting different features of marketing using big data.


2021 ◽  
pp. 1-23
Author(s):  
Fabio Aiolli ◽  
Mauro Conti ◽  
Stjepan Picek ◽  
Mirko Polato

Nowadays, online services, like e-commerce or streaming services, provide a personalized user experience through recommender systems. Recommender systems are built upon a vast amount of data about users/items acquired by the services. Such knowledge represents an invaluable resource. However, commonly, part of this knowledge is public and can be easily accessed via the Internet. Unfortunately, that same knowledge can be leveraged by competitors or malicious users. The literature offers a large number of works concerning attacks on recommender systems, but most of them assume that the attacker can easily access the full rating matrix. In practice, this is never the case. The only way to access the rating matrix is by gathering the ratings (e.g., reviews) by crawling the service’s website. Crawling a website has a cost in terms of time and resources. What is more, the targeted website can employ defensive measures to detect automatic scraping. In this paper, we assess the impact of a series of attacks on recommender systems. Our analysis aims to set up the most realistic scenarios considering both the possibilities and the potential attacker’s limitations. In particular, we assess the impact of different crawling approaches when attacking a recommendation service. From the collected information, we mount various profile injection attacks. We measure the value of the collected knowledge through the identification of the most similar user/item. Our empirical results show that while crawling can indeed bring knowledge to the attacker (up to 65% of neighborhood reconstruction on a mid-size dataset and up to 90% on a small-size dataset), this will not be enough to mount a successful shilling attack in practice.


2012 ◽  
Vol 267 ◽  
pp. 87-90
Author(s):  
Pu Wang

E-commerce recommendation system is one of the most important and the most successful application field of information intelligent technology. Recommender systems help to overcome the problem of information overload on the Internet by providing personalized recommendations to the customers. Recommendation algorithm is the core of the recommendation system. Collaborative filtering recommendation algorithm is the personalized recommendation algorithm that is used widely in e-commerce recommendation system. Collaborative filtering has been a comprehensive approach in recommendation system. But data are always sparse. This becomes the bottleneck of collaborative filtering. Collaborative filtering is regarded as one of the most successful recommender systems within the last decade, which predicts unknown ratings by analyzing the known ratings. In this paper, an electronic commerce collaborative filtering recommendation algorithm based on product clustering is given. In this approach, the clustering of product is used to search the recommendation neighbors in the clustering centers.


2020 ◽  
Vol 10 (4) ◽  
pp. 1257 ◽  
Author(s):  
Liang Zhang ◽  
Quanshen Wei ◽  
Lei Zhang ◽  
Baojiao Wang ◽  
Wen-Hsien Ho

Conventional recommender systems are designed to achieve high prediction accuracy by recommending items expected to be the most relevant and interesting to users. Therefore, they tend to recommend only the most popular items. Studies agree that diversity of recommendations is as important as accuracy because it improves the customer experience by reducing monotony. However, increasing diversity reduces accuracy. Thus, a recommendation algorithm is needed to recommend less popular items while maintaining acceptable accuracy. This work proposes a two-stage collaborative filtering optimization mechanism that obtains a complete and diversified item list. The first stage of the model incorporates multiple interests to optimize neighbor selection. In addition to using conventional collaborative filtering to predict ratings by exploiting available ratings, the proposed model further considers the social relationships of the user. A novel ranking strategy is then used to rearrange the list of top-N items while maintaining accuracy by (1) rearranging the area controlled by the threshold and by (2) maximizing popularity while maintaining an acceptable reduction in accuracy. An extensive experimental evaluation performed in a real-world dataset confirmed that, for a given loss of accuracy, the proposed model achieves higher diversity compared to conventional approaches.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 41782-41798 ◽  
Author(s):  
Santiago Alonso ◽  
Jesus Bobadilla ◽  
Fernando Ortega ◽  
Ricardo Moya

2013 ◽  
Vol 756-759 ◽  
pp. 3899-3903
Author(s):  
Ping Sun ◽  
Zheng Yu Li ◽  
Zi Yang Han ◽  
Feng Ying Wang

Recommendation algorithm is the most core and key point in recommender systems, and plays a decisive role in type and performance evaluation. At present collaborative filtering recommendation not only is the most widely useful and successful recommend technology, but also is a promotion for the study of the whole recommender systems. The research on the recommender systems is coming into a focus and critical problem at home and abroad. Firstly, the latest development and research in the collaborative filtering recommendation algorithm are introduced. Secondly, the primary idea and difficulties faced with the algorithm are explained in detail. Some classical solutions are used to deal with the problems such as data sparseness, cold start and augmentability. Thirdly, the particular evaluation method of the algorithm is put forward and the developments of collaborative filtering algorithm are prospected.


Sign in / Sign up

Export Citation Format

Share Document