Search

Recommender Systems (RSs) have recently emerged as a practical solution to the information overload problem users face when searching for digital content. In general, RSs provide their respective users with specialized advice and guidance in order to make informed decisions on the selection of suitable digital content. This paper is a systematic literature review of recent (2011–2023) publications on RSs designed and developed in the context of education to support teachers in particular—one of the target groups least frequently addressed by existing RSs. A body of 61 journal papers is selected and analyzed to answer research questions focusing on experimental studies that include RS evaluation and report evaluation results. This review is expected to help teachers in better exploiting RS technology as well as new researchers/developers in this field in better designing and developing RSs for the benefit of teachers. An interesting result obtained through this study is that the recent employment of machine learning algorithms for the generation of recommendations has brought about significant RS quality and performance improvements in terms of recommendation accuracy, personalization and timeliness. [ABSTRACT FROM AUTHOR]

The study presents a Cluster-Based Cab Recommender System (CBCRS) designed to optimize cab services by suggesting the nearest locations with a higher likelihood of finding passengers. To achieve this, the system employs advanced clustering techniques to cluster historical cab pickup locations, identifying areas with higher passenger possibilities at specific times and days. The research aims to develop an algorithmic framework for CBCRS based on a hybrid clustering technique. The objectives of the study are twofold: first, to identify current clustering techniques used in clustering cab pickup geo-points, and second, to propose a framework for CBCRS based on the most efficient clustering technique. This framework will accept the current location of the cab driver and recommend the next nearest passenger pickup location. Additionally, the study compares and contrasts the proposed system with other clustering techniques using three standard datasets, evaluating them based on intrinsic measures such as the Calinski-Harabasz Index and Silhouette-Score. The paper concludes by evaluating and contrasting the proposed CBCRS framework with different clustering techniques, analyzing the results using statistical parameters. The findings reveal that the proposed CBCRS system generates better recommendations for the cab drivers using CBCRS hybrid clustering technique as compared to K-Means, BIRCH, DBSCAN clustering algorithms. [ABSTRACT FROM AUTHOR]

In recent times, recommender systems have acquired significant popularity as a solution to the issue of information overload. These systems offer personalised recommendations to users. The superiority of multi-criteria recommender systems over their single-criterion counterparts has been demonstrated, as the former are able to provide more precise recommendations by taking into account multiple dimensions of user preferences when rating items. The prevalent recommendation technique, matrix factorization of collaborative filtering, is hindered by the data sparsity problem of the user-item matrix. On the other hand, it is noteworthy that deep learning techniques have demonstrated significant potential in various research domains, including but not limited to image processing, pattern recognition, computer vision, and natural language processing. In recent times, there has been a surge in the utilisation of deep learning techniques in recommender systems, yielding promising outcomes. This study presents a novel approach to multi-criteria recommender systems through the utilisation of deep learning algorithms to mitigate the data sparsity issue. Specifically, deep autoencoders are utilised to uncover complex, non-linear, and latent relationships between users' multi-criteria preferences followed by matrix factorization technique, ultimately leading to more precise recommendations. The proposed model is evaluated by conducting the experiments on the multi-criteria dataset of Yahoo! Movies. According to the outcomes, the proposed approach outperforms the state of the art recommendation methods by generating more accurate and personalized recommendations. Also, it reduces the data sparsity up to 11% from the multi-criteria dataset. [ABSTRACT FROM AUTHOR]

Tourism is an important sector, serving as an avenue to show the natural resources of a country and inhabitants' hospitality. This sector creates several opportunities for building a potential market and enhancing economic activities where tourist spots and activities flourish. Despite the numerous benefits, tourism still requires significant improvement, particularly in the Philippines, where there are abundant beautiful places. Therefore, this study aimed to develop a recommender system based on users and content collaborative filtering to provide local and foreign tourists with viable information for experience improvement. The investigation focused on improving tourist satisfaction based on three aspects such as preferences, ratings, and reviews that add options for tourist spots, activities/itineraries, destinations, and others. The machine algorithm-based journey assistant (MAJA) was designed as an interface and agent in providing help to tourists. The mean average precision (MAP) and recall were used as evaluation metrics to better understand the ability of MAJA to offer personalized experiences to unique users. The results showed that integration of the system into tourism provided a smart platform for enhancing tourist experience and destination competitiveness. Consequently, successful implementation of the system is measured by two criteria, namely the degree of tourists' pleasure during trip and the capacity of MAJA to effectively transfer tourism to less popular and less "accessible" sector. [ABSTRACT FROM AUTHOR]

Recommender systems position themselves as powerful tools in the support of relevance and personalization, presenting remarkable potential in the area of marketing. The cold-start customer problematic presents a challenge within this topic, leading to the need of distinguishing user features and preferences based on a restricted set of transactional information. This paper proposes a hybrid recommender system that aims to leverage transactional and portfolio information as indicating characteristics of customer behaviour. Four independent systems are combined through a parallelised weighted hybrid design. The first individual system utilises the price, target age, and brand of each product to develop a content-based recommender system, identifying item similarities. Secondly, a keyword-based content system uses product titles and descriptions to identify related groups of items. The third system utilises transactional data, defining similarity between products based on purchasing patterns, categorised as a collaborative model. The fourth system distinguishes itself from the previous approaches by leveraging association rules, using transactional information to establish antecedent and precedence relationships between items through a market basket analysis. Two datasets were analysed: product portfolio and transactional datasets. The product portfolio had 17,118 unique products and the included 4,408,825 instances from 2 June 2021 until 2 June 2022. Although the collaborative system demonstrated the best evaluation metrics when comparing all systems individually, the hybridisation of the four systems surpassed each of the individual systems in performance, with a 8.9% hit rate, 6.6% portfolio coverage, and with closer targeting of customer preferences and smaller bias. [ABSTRACT FROM AUTHOR]

The widespread use of E-commerce websites has drastically increased the need for automatic recommendation systems with machine learning. In recent years, many ML-based recommenders and analysers have been built; however, their scope is limited to using a single filtering technique and processing with clustering-based predictions. This paper aims to provide a systematic year-wise survey and evolution of these existing recommenders and analysers in specific deep learning-based hybrid filtering categories using movie datasets. They are compared to others based on their problem analysis, learning factors, data sets, performance, and limitations. Most contributions are found with collaborative filtering using user or item similarity and deep learning for the IMDB datasets. In this direction, this paper introduces a new and efficient Hybrid Filtering based Recommendation System using Deep Learning (HFRS-DL), which includes multiple layers and stages to provide a better solution for generating recommendations. [ABSTRACT FROM AUTHOR]

In the futuristic Industry framework, user interactions with the product are seamlessly integrated with the product life cycle which results in Information overload. The shopbots were proposed in Industry 4.0 where the more focus was on process automation. In this research work, we propose recommender system for industry 5.0 which is based on collaboration of human beings and machines with more focus on user's personalization. Recommender system can be considered as an information filtering tool that provides suggestions to users about products, music, friend, topic, etc. This suggestion is based on the interest of users. Several research works have been carried out to improve recommendation accuracy by using matrix factorization, trust-based, hybrid-based, machine learning, and deep learning techniques. However, very few existing works have leveraged textual opinions for the recommendation to the best of our knowledge. Existing research works have focused only on numerical ratings, which do not reflect actual user behaviour. In this research work, sentiments of textual opinions are analysed for an in-depth analysis of user's behaviour. Recommendation accuracy is improved by using the proposed score Recop which is calculated from opinion sentiments. Furthermore, the sparsity issue is resolved by using our proposed approach. Amazon and Yelp review datasets are used for Experiment analysis. Mean absolute error (MAE) and root mean square error (RMSE) values are improved significantly using the proposed approach compared to the existing approaches. MAE and RMSE scores on the Yelp dataset are 0.85 and 1.51, respectively. Additionally, MAE and RMSE scores on the Amazon dataset are 0.66 and 0.93, respectively, which clearly reflects the significant contribution of our proposed approach. [ABSTRACT FROM AUTHOR]

Recommender Systems (RS) are used to generate recommendations of items that a user may be interested in. Several commercial wine recommender systems exist but are largely tailored to consumers outside of South Africa (SA). Consequently, these systems are of limited use to novice wine consumers in SA. In this research, a system soMLier (a combination of the terms 'sommelier' and 'Machine Learning') is developed for SA consumers that yields high-quality wine recommendations, maximises the accuracy of predicted ratings for those recommendations and provides insights into why those suggestions were made. This system is developed using two datasets – a database containing several attributes of SA wines and the corresponding numeric 5-star ratings made by users on Vivino.com. Using these datasets, several recommendation methodologies are investigated and it is found that collaborative filtering succeeds at generating lists of relevant wine recommendations, matrix factorisation techniques accurately predict ratings and content-based methods are most appropriate for explaining wine recommendations. These methods are optimally combined in the soMLier system. Though it would benefit from more explicit user data to establish a richer model of user preferences, soMLier can assist consumers in discovering wines they will likely enjoy and understanding their preferences of SA wine. Abbreviations: SA: South Africa(n); RS: Recommender System(s); IBCF: Item-basedCollaborative Filtering; CB: Content-Based; MF: Matrix Factorisation; RMSE: RootMean Square Error; COV: Coverage; PER: Personalistion; ARHR: Average ReciporcalHit Rate [ABSTRACT FROM AUTHOR]

Recommender System is a information filtering tool to filter the relevant information from given information in the present era of big data. Movie Recommender System is machine learning based autonomous tool that filters the movies from big movie database like netflix, amazon etc according to user preferences. The main focus of this paper is Partitional Weighted co-clustering for Movie Recommender System. The primary objective of this research article is to fine tune the parameters of user and movie neighborhoods by setting different values for row clusters number and column clutsers number parameters of co-clustering. Test results obtained from the Movie database show that the proposed method can bring more accurate personalized recommendations for the movie as compared to existing methods of the order of 7.91%. [ABSTRACT FROM AUTHOR]

Literature survey shows that the recommendation systems have been largely adapted and evaluated in various domains. Due to low performances from various cyber attacks, the adoption of recommender system is in the initial stage of defense systems. One of the most common attacks for recommender system is shilling attack. There are some existing techniques for identifying the shilling attacks built in the user ratings patterns. The performance of ratings on target items differs between the attack user profiles and actual user profiles. To differentiate the certain profiles, the affected profiles are known as attack profiles. Besides the shilling attacks, real cyber attacks are taking place in the community which are being solved by Petri Net methods. These attacks can be falsely predicted (shilling attacks) by the users which can raise security threats. For identifying various shilling attacks without a priori knowledge, Recommendation System suffers from low accuracy. Basically, recommendation attack is split into nuke and push attack that encourage and discourage the recommended target item. The strength of shilling attack is usually measured by filler size and attack size. An experiment over unsupervised machine learning algorithms with filler size 3% over 3%, 5%, 8% and 10% attack sizes is presented for Netflix dataset. Furthermore, we conducted an experiment on data of 26 K videos on the Trending YouTube Video Statistics, to predict the user preferences for a particular genre of videos using Machine Learning Algorithms. Based on the results, it observed that the Boosted Decision tree performs the best with an accuracy of 99 percent. [ABSTRACT FROM AUTHOR]

Summary: The collaborative filtering (CF) recommendation algorithm predicts the purchases of specific users based on their characteristics and purchase history. This study empirically analyzes the possibility of applying CF to the insurance industry using real customer data from South Korea. Using three different CF models, we examined the relevance of applying the CF model to insurance products under various situations by comparing them with logistic‐regression‐based recommendation models. Through experiments, we empirically show that CF models apply to the insurance industry, especially when customer purchase information is added to the model. [ABSTRACT FROM AUTHOR]

Recommender systems are efficient tools for filtering online information, which is widespread owing to the changing habits of computer users, personalization trends, and emerging access to the internet. Even though the recent recommender systems are eminent in giving precise recommendations, they suffer from various limitations and challenges like scalability, cold-start, sparsity, etc. Due to the existence of various techniques, the selection of techniques becomes a complex work while building application-focused recommender systems. In addition, each technique comes with its own set of features, advantages and disadvantages which raises even more questions, which should be addressed. This paper aims to undergo a systematic review on various recent contributions in the domain of recommender systems, focusing on diverse applications like books, movies, products, etc. Initially, the various applications of each recommender system are analysed. Then, the algorithmic analysis on various recommender systems is performed and a taxonomy is framed that accounts for various components required for developing an effective recommender system. In addition, the datasets gathered, simulation platform, and performance metrics focused on each contribution are evaluated and noted. Finally, this review provides a much-needed overview of the current state of research in this field and points out the existing gaps and challenges to help posterity in developing an efficient recommender system. [ABSTRACT FROM AUTHOR]

Breast cancer is the second popular cause of the women's death. There are some existing techniques for identifying the breast cancer and one of them is mammography screening, for identifying the breast cancer under the age of 40 to 50 years. For medical diagnosis applications such as breast cancer, the recommender system is very helpful. There is a large number of records or datasets available for diagnosis of human diseases. In this article, we have presented an in-depth study of breast cancer predictions to take the remedial actions. Then experiments are carried out in Microsoft Azure on the breast cancer dataset which is available on Kaggle. The training and testing are done on 70% and 30% of the data. The evaluations are conducted by using machine learning algorithms, Locally Deep SVM, Boosted Decision Tree, Averaged Perception, Bayes Point and Decision Forest to predict Breast Cancer. We conducted an experiment on 18 K breast cancer image dataset. A hybrid machine learning algorithm (HMLA) based on decision tree and average perceptron algorithms is proposed. Based on the experimental evaluation, it is analyzed that proposed algorithm has performed well with 98.1% of accuracy and predicting the accurate results with 95.0% of sensitivity and specificity of 99.0% on the Breast Cancer prediction. [ABSTRACT FROM AUTHOR]

Summary: The frequent user interactions happening in the form of textual contents like reviews, ratings, tags, blogs, testimonials, and so forth transformed the social media platform into a contextualized and personalized data warehouse focusing its users' unique likes and dislikes. The huge volume of social media content makes it difficult for the end users to consume relevant information by themselves. The need of a tool to deal with such scenario leads to the development of recommendation systems. This work proposes an ensemble multi‐stage recommender system with sentiment based clustering to deal with social media text corpus where each stage performing unique functionalities of information retrieval, natural language processing, user segmentation, prediction, and recommendation generation. The proposed system leverages a hybrid approach of content‐based, collaborative, and demographic filtering techniques to predict and recommend contents, products, or services according to user interests. The experimental results gathered using standard datasets are promising and found more efficient than the traditional approaches. [ABSTRACT FROM AUTHOR]

Recommender systems represent one of the most successful applications of machine learning in B2C online services, to help the users in their choices in many web services. Recommender system aims to predict the user preferences from a huge amount of data, basically the past behaviour of the user, using an efficient prediction algorithm. One of the most used is the matrix-factorization algorithm. Like many machine learning algorithms, its effectiveness goes through the tuning of its hyper-parameters, and the associated optimization problem also called hyper-parameter optimization. This represents a noisy time-consuming black-box optimization problem. The related objective function maps any possible hyper-parameter configuration to a numeric score quantifying the algorithm performance. In this work, we show how Bayesian optimization can help the tuning of three hyper-parameters: the number of latent factors, the regularization parameter, and the learning rate. Numerical results are obtained on a benchmark problem and show that Bayesian optimization obtains a better result than the default setting of the hyper-parameters and the random search. [ABSTRACT FROM AUTHOR]

Neighborhood-based top-N recommendation techniques for implicit users ' inte raction data are ranking models, of which similarity functions are the important ingredients. Traditional similarity functions suffer from two major issues: sparse data and high dimensional data. Sparse data hinder the recommendation system from scoring on smooth neighborhood, high dimensional data causes the curse of dimensionality problem. This paper proposed a representation-based approach named multi object representation learning ( MO) for recommendation, MO was a bipartite node representation learning algorithm, which embedded the different level of network structures and item ordering information into nodes representations to help leverage the recommendation performance. Experimental results on three real data sets of different scales show that the algorithm has higher accuracy and recall than the commonly used recommendation model based on implicit feedback, especially for large-scale data sets, which can effectively alleviate the problems of matrix sparsity and dimensionality disaster, and improve the recommended performance. [ABSTRACT FROM AUTHOR]

It is becoming increasingly difficult to find a particular app on a smartphone due to the increasing number of apps installed. Consequently, it is important to be able to quickly and accurately predict the next app to be used. Two problems arise in predicting next-app usage from the app usage history. One is that some algorithms do not consider the increasing amount of training data available over time, which causes the prediction accuracy to decrease over time. The other is that although some algorithms do consider the aggregation of training data over time, they rebuild their models using all historical data once the amount of new data has reached a certain limit, thus greatly increasing the remodeling time. To reduce the remodeling time, we utilize an modified incremental k-nearest neighbours (IkNN) algorithm to implement a recommender system called Predictor. When the IkNN is used for predicting next-app usage, a new problem is found. When modeling the training data, the classification accuracy decreases as the number of app features increases. After studying the relationships among the contextual features of apps, we design a cluster effective value (CEV), which can compensate for the error induced by multidimensional features, to improve the classification accuracy. It is shown that the IkNN algorithm with the CEV achieves a higher and more stable prediction accuracy compared with that of the algorithm without the CEV. Furthermore, we proposed a the Cold Start strategy: an efficient dynamic collaborative filtering fusion algorithm that provides app Cold Start prediction. Large-scale experiments show that Predictor offers a reduced remodeling time and an improved prediction accuracy. [ABSTRACT FROM AUTHOR]

Many bipartite networks describe systems where an edge represents a relation between a user and an item. Measuring the similarity between either users or items is the basis of memory-based collaborative filtering, a widely used method to build a recommender system with the purpose of proposing items to users. When the edges of the network are unweighted, the popular common neighbors-based approaches, allowing only positive similarity values, neglect the possibility and the effect of two users (or two items) being very dissimilar. Moreover, they underperform with respect to model-based (machine learning) approaches, although providing a higher interpretability. Inspired by the functioning of Decision Trees, we propose a method to compute similarity that allows also negative values, the Sapling Similarity. The key idea is to look at how the information that a user is connected to an item influences our prior estimation of the probability that another user is connected to the same item: if it is reduced, then the similarity between the two users will be negative, otherwise it will be positive. We show that, when used to build memory-based collaborative filtering, Sapling Similarity provides better recommendations than existing similarity metrics. Then we compare the Sapling Similarity Collaborative Filtering (SSCF, an hybrid of the item-based and the user-based) with state-of-the-art models using standard datasets. Even if SSCF depends on only one straightforward hyperparameter, it has comparable or higher recommending accuracy, and outperforms all other models on the Amazon-Book dataset, while retaining the high explainability of memory-based approaches. [ABSTRACT FROM AUTHOR]

Context-aware recommender systems (CARS) exploit multiple contexts to improve user experience in embracing new information and services. Tensor factorization (TF), a type of latent factor model, has achieved remarkable performance in CARS. TF learns latent representations of contexts by decomposing an observed rating tensor and combines the latent representations as a vector form to represent contextual influence on users and items. However, due to the limitation of the contextual expression power, they have difficulties in effectively capturing complex correlations among multiple contexts, and also the meaning of each context is diluted. To address the issue, we propose a reliable TF-based recommender system based on a proposed context tensor (CT-CARS), which incorporates a variety of correlations among contexts. CT-CARS contains a novel recommendation rating function and a learning algorithm. Specifically, the proposed context tensor elaborately captures the influences of both individual contexts and context combinations. Moreover, we introduce a novel parameter initialization based on past-learned results to improve the reliability of recommendations. The overall time complexity of our parameter learning algorithm grows linearly as dataset size increases. Experiments on six real-world datasets including two large-scaled datasets show that CT-CARS outperforms the existing state-of-the-art models in terms of both accuracy and reliability. [ABSTRACT FROM AUTHOR]

This paper proposes a collaborative filtering algorithm based on user group interest. A novel co-clustering method (BalClust) and various weighted non-negative matrix factorization algorithms are used in the proposed method. The BalClust method is used to divide the raw rating matrix into clusters, which are smaller than the original matrix. Then, the balance factor is introduced to consider the user weight and the item-based CF (collaborative filtering). To predict the rating of the unknown items in the cluster, the non-negative matrix factorization algorithm was used. The proposed method achieves higher predicting accuracy and efficiency on low dimensional and homogeneous sub-matrices, and the method also reduces the computational complexity by combining the user and item-based CF. Based on the proposed method, this paper proposed an incremental learning method to ensure data accuracy and timeliness to overcome the problem brought by data updates. The experimental results show the proposed methods outperformed traditional CF algorithms, and the completion time is reduced. [ABSTRACT FROM AUTHOR]

• A probabilistic model is proposed to evaluate user's rating profile. • Temporal reliability and confidence measures are used to design recommender systems. • Changing of users' preferences over time is considered in the proposed method. • The reliability measure is used to evaluate the quality of the predictions. • The confidence measure is used to identify ineffective users from neighbors set. Recommender systems use intelligent algorithms to learn a user's preferences and provide them relevant suggestions. Lack of sufficient ratings – also known as data sparsity problem – often results in poor recommendation performance. The existing recommendation methods have mainly focused on designing recommenders with high accuracy without paying much attention to the reliability of the recommendations. On the other hand, the users' preferences may vary over time and considering the time factor in the design process is crucial, which has been largely ignored in most of the existing recommenders. To deal with these issues, a novel recommendation method is proposed in this paper which incorporates temporal reliability and confidence measures into the recommendation process. First, the effectiveness of the users' rating is measured using a probabilistic approach and ineffective rating profiles are enriched by adding some implicit ratings to them. The quality of the predictions is evaluated using a temporal reliability measure taking into account the changes of users' preferences over time. Then, the ratings with low reliability values are recalculated using a novel procedure, which updates the target user's neighborhood by removing ineffective users. This leads to a temporal confidence measure that is used to update the neighborhood to provide more reliable and accurate recommendations. The superiority of the proposed method over state-of-the-art recommendation methods is shown by conducting extensive experiments on three benchmark datasets. [ABSTRACT FROM AUTHOR]

Recommendation systems aim to predict users interests and recommend items most likely to interest them. In this paper, we propose a new intelligent recommender system that combines collaborative filtering (CF) with the popular unsupervised machine learning algorithm K-means clustering. Also, we use certain user demographic attributes such as the gender and age to create segmented user profiles, when items (movies) are clustered by genre attributes using K-means and users are classified based on the preference of items and the genres they prefer to watch. To recommend items to an active user, Collaborative Filtering approach then is applied to the cluster where the user belongs. Following the experimentation for well known movies, we show that the proposed system satisfies the predictability of the CF algorithm in GroupLens. In addition, our proposed system improves the performance and time response speed of the traditional collaborative Filtering technique and the Content-Based technique too. [ABSTRACT FROM AUTHOR]