Search

In existing sequential recommendation systems, user behavior data are directly used as training data for the model to complete the training process and address recommendation tasks. However, user-generated behavioral data inevitably contains noise, and the use of the Transformer's recommendation model may lead to overfitting on such noisy data. To address this issue, we introduce a sequence recommendation algorithm model named FAT-Rec, which incorporates fusion filters and converters through joint training. By employing joint training methods, we establish both a transformer prediction layer and a CTR prediction layer. Toward the end of the model, we assign weights and sum up the losses from the Transformer and CTR prediction layers to derive the final loss function. Experimental results on two widely used datasets, MovieLens and Goodbooks, demonstrate a significant enhancement in the performance of the proposed FAT-Rec recommendation algorithm compared with seven comparative models. This validates the efficacy of the fusion filter and transformer within the context of sequence recommendation tasks under the joint training mechanism. [ABSTRACT FROM AUTHOR]

The advent of the information age has made accurate search for information a challenge. In this paper, we analyze intelligent recommendations for innovative entrepreneurial projects based on collaborative filtering algorithms. Collaborative filtering is one of the most widely used and successful techniques in recommendation systems. In this paper, an interest migration function plus time is introduced to address the shortcomings of traditional collaborative filtering recommendation algorithms. Meanwhile, this paper builds an intelligent recommendation engine system for innovative entrepreneurial projects based on the Hadoop open-source distributed computing framework, sustainable PSCM, and Mahout collaborative filtering recommendation engine technology. This paper uses experiments to test and evaluate the overall performance of the distributed recommendation platform and the improved collaborative filtering recommendation algorithm. It is found that the algorithm outperforms similar algorithms in terms of data volume and coverage of recommended innovation and entrepreneurship projects. This is sufficient to show that the collaborative filtering algorithm and sustainable PSCM are useful for the intelligent recommendation analysis of innovative entrepreneurial projects. [ABSTRACT FROM AUTHOR]

Recommender systems apply machine learning and data mining techniques for filtering unseen information, and they can provide an opportunity to predict whether a user would be interested in a given item. The main types of recommender systems are collaborative filtering (CF) and content-based filtering, which suffer from scalability and data sparsity resulting in poor quality recommendations and reduced coverage. There are two incremental algorithms based on Singular Value Decomposition (SVD) with high scalability for recommender systems which are named the incremental SVD algorithm and incremental Approximating the Singular Value Decomposition (ApproSVD) algorithm. In both mentioned methods, the estimated value of rank for approximating the recommender systems' data matrix is chosen experimentally in the related literature. In this paper, we investigate the role of singular values for estimating a more reliable amount of rank in the mentioned dimensionality reduction techniques to improve the recommender systems' performance. In other words, we offered a strategy for choosing the optimal rank that approximates the data matrix more accurately in incremental algorithms with the help of singular values. The numerical results illustrate that the suggested strategy improves the accuracy of the recommendations and run times of both algorithms when employs for Movielens, Netflix, and Jester dataset. [ABSTRACT FROM AUTHOR]

Recently, the e-learners are drastically increased from the last two decades. Everything is learnt through internet without help of the tutor as well. For this purpose, the e-learners are required more e-learning applications that are able to supply optimal and satisfied data based on their capability. No content recommendation system is available for recommending suitable contents to the learners. For this purpose, this paper proposes a new semantic and fuzzy aware content recommendation system for retrieving the suitable content for the users. In this content recommendation system, we propose two content pre-processing algorithms namely Target Keyword based Data Pre-processing Algorithm (TKDPA) and Intelligent Anova-T Residual Algorithm (IAATRA) for selecting the more relevant features from the document. Moreover, a new Fuzzy rule based Similarity Matching algorithm (FRSMA) is proposed and used in this system for finding the similarity between the two terms and also rank them by using the newly proposed Similarity and Temporal aware Weighted Document Ranking Algorithm (STWDRA). In addition, a content clustering process is also incorporated for gathering relevant content. Finally, a new Fuzzy, Target Keyword and Similarity Score based Content Recommendation Algorithm (FTKSCRA) is also proposed for recommending the more relevant content to the learners accurately. The experiments have been conducted for evaluating the proposed content recommendation system and proved as better than the existing recommendation systems in terms of precision, recall, f-measure and prediction accuracy. [ABSTRACT FROM AUTHOR]

A large number of practical applications of the recommendation system found that the novelty of the recommendation results and the user satisfaction are more closely related, making the novelty recommendation recently widely concerned and studied. Many novelty recommendation algorithms used the popularity of the item to measure novelty, but this method is too simple, and the change of item popularity is more reflective of its novelty. According to the product life cycle theory (PLC), this study proposed a novelty recommendation algorithm that recommends item that be not popular now and may be popular in the future to improve the novelty of the recommendation results, The time change of the popularity of the items to be recommended is analyzed, and the future popularity of the items are predicted by analogy. Two strategies for selecting recommended selection are selecting future popular items (the predicting popularity-based filtering Algorithm, PP algorithm) and excluding future recession items (the Excluding Recession-based filtering algorithm, ER algorithm), according to the definition of novelty of the item, recommended the novelty items to the target user. The effectiveness of the proposed algorithm was verified through an offline experiment. Results indicate that PP algorithm can significantly improve the accuracy and novelty, but seriously sacrifice the coverage and reduce the ability of the recommendation system to mine the long tail items when the number of alternative items N is small, the novelty of the recommendation list of the ER algorithm is remarkably higher than that of traditional algorithms, the novelty is high when the quantity of alternative sets reaches around 350, where the average popularity of the recommendation list declines by 40%, and the coverage is elevated by 150%, thereby improving the ability of the proposed system to extract all kinds of items. This study serves as reference for the improvement of user satisfaction with recommendation systems. [ABSTRACT FROM AUTHOR]

Matrix factorization (MF) models are effective and easy to expand and are widely used in industry, such as rating prediction and item recommendation. The basic MF model is relatively simple. In practical applications, side information such as attributes or implicit feedback is often combined to improve accuracy by modifying the model and optimizing the algorithm. In this paper, we propose an attribute interaction-aware matrix factorization (AIMF) method for recommendation tasks. We partition the original rating matrix into different sub-matrices according to the attribute interactions, train each sub-matrix independently, and merge all the latent vectors to generate the final score. Since the generated sub-matrices vary in size, an adaptive regularization coefficient optimization strategy and an adaptive latent vector dimension optimization strategy are proposed for sub-matrix training, and a variety of latent vector merging methods are put forward. The method AIMF has two advantages. When the original rating matrix is particularly large, the training time complexity of the MF-based model becomes higher and the update cost of the model is also higher. In AIMF, because each sub-matrix is usually much smaller than the original rating matrix, the training time complexity is greatly reduced after using parallel computing technology. Secondly, in AIMF, it is not necessary to modify the matrix factorization model to incorporate attributes and their interactive information into the model to improve the performance. The experimental results on the two classic public datasets MovieLens 1M and MovieLens 100k show that AIMF can not only effectively improve the accuracy of recommendation, but also make full use of parallel computing technology to improve training efficiency without modifying the matrix factorization model. [ABSTRACT FROM AUTHOR]

With the increase of online businesses, recommendation algorithms are being researched a lot to facilitate the process of using the existing information. Such multi-criteria recommendation (MCRS) helps a lot the end-users to attain the required results of interest having different selective criteria – such as combinations of implicit and explicit interest indicators in the form of ranking or rankings on different matched dimensions. Current approaches typically use label correlation, by assuming that the label correlations are shared by all objects. In real-world tasks, however, different sources of information have different features. Recommendation systems are more effective if being used for making a recommendation using multiple criteria of decisions by using the correlation between the features and items content (content-based approach) or finding a similar user rating to get targeted results (Collaborative filtering). To combine these two filterings in the multicriteria model, we proposed a features-based fb-knn multi-criteria hybrid recommendation algorithm approach for getting the recommendation of the items by using multicriteria features of items and integrating those with the correlated items found in similar datasets. Ranks were assigned to each decision and then weights were computed for each decision by using the standard deviation of items to get the nearest result. For evaluation, we tested the proposed algorithm on different datasets having multiple features of information. The results demonstrate that proposed fb-knn is efficient in different types of datasets. [ABSTRACT FROM AUTHOR]

Context-Aware Recommender System (CARS) suggests more relevant services by adapting them to the user's specific context situation. Nevertheless, the use of many contextual factors can increase data sparsity while few context parameters fail to introduce the contextual effects in recommendations. Moreover, several CARSs are based on similarity algorithms, such as cosine and Pearson correlation coefficients. These methods are not very effective in the sparse datasets. This paper presents a context-aware model to integrate contextual factors into prediction process when there are insufficient co-rated items. The proposed algorithm uses Latent Dirichlet Allocation (LDA) to learn the latent interests of users from the textual descriptions of items. Then, it integrates both the explicit contextual factors and their degree of importance in the prediction process by introducing a weighting function. Indeed, the PSO algorithm is employed to learn and optimize weights of these features. The results on the Movielens 1 M dataset show that the proposed model can achieve an F-measure of 45.51% with precision as 68.64%. Furthermore, the enhancement in MAE and RMSE can respectively reach 41.63% and 39.69% compared with the state-of-the-art techniques. [ABSTRACT FROM AUTHOR]

The existing recommender system provides personalized recommendation service for users in online shopping, entertainment, and other activities. In order to improve the probability of users accepting the system's recommendation service, compared with the traditional recommender system, the interpretable recommender system will give the recommendation reasons and results at the same time. In this paper, an interpretable recommendation model based on XGBoost tree is proposed to obtain comprehensible and effective cross features from side information. The results are input into the embedded model based on attention mechanism to capture the invisible interaction among user IDs, item IDs and cross features. The captured interactions are used to predict the match score between the user and the recommended item. Cross-feature attention score is used to generate different recommendation reasons for different user-items.Experimental results show that the proposed algorithm can guarantee the quality of recommendation. The transparency and readability of the recommendation process has been improved by providing reference reasons. This method can help users better understand the recommendation behavior of the system and has certain enlightenment to help the recommender system become more personalized and intelligent. [ABSTRACT FROM AUTHOR]

Recommender systems can recommend products by analyzing the interests and habits of users. To make more efficient recommendation, the contextual information should be collected in recommendation algorithms. In the restaurant recommendation, the location and the current time of customers should also be considered to facilitate restaurants to find potential customers and give accurate and timely recommendations. However, the existing recommendation approaches often lack the consideration of the influence of time and location. Besides, the data sparsity is an inherent problem in the collaborative filtering algorithm. To address these problems, this paper proposes a recommendation approach which combines the contextual information including time, price and location. Instead of constructing the user-restaurant scoring matrix, the proposed approach clusters price tags and generates the user-price scoring matrix to alleviate the sparsity of data. The experiment on Foursquare dataset shows that the proposed approach has a better performance than traditional ones. [ABSTRACT FROM AUTHOR]

In this research, we combine relational learning with multi-domain to develop a formal framework for a recommendation system. The design of our framework aims at: (i) constructing general rules for recommendations, (ii) providing suggested items with clear and understandable explanations, (iii) delivering a broad range of recommendations including novel and unexpected items. We use relational learning to find all possible relations, including novel relations, and to form the general rules for recommendations. Each rule is represented in relational logic, a formal language, associating with probability. The rules are used to suggest the items, in any domain, to the user whose preferences or other properties satisfy the conditions of the rule. The information described by the rule serves as an explanation for the suggested item. It states clearly why the items are chosen for the users. The explanation is in if-then logical format which is unambiguous, less redundant and more concise compared to a natural language used in other explanation recommendation systems. The explanation itself can help persuade the user to try out the suggested items, and the associated probability can drive the user to make a decision easier and faster with more confidence. Incorporating information or knowledge from multiple domains allows us to broaden our search space and provides us with more opportunities to discover items which are previously unseen or surprised to a user resulting in a wide range of recommendations. The experiment results show that our proposed algorithm is very promising. Although the quality of recommendations provided by our framework is moderate, our framework does produce interesting recommendations not found in the primitive single-domain based system and with simple and understandable explanations. [ABSTRACT FROM AUTHOR]

In the current era of big data, the recommender system aspires to provide users with a tailored set of personalized items from a pool of a large population. The most popular collaborative filtering system performs this information filtering process by computing similarity among users or items. This paper proposes a similarity metric that comprises of weights and values. Values are calculated by considering the matching set of users for which similarity is to be computed. The optimal values of weights are decided using an upgraded form of the Crow Search Algorithm (CSA). The exploration and exploitation stability of CSA is improvised by making use of Levy flight diffusion, adaptive operator adjustment, and event factor. The performance of the implemented metaheuristic approach is validated on Jester, MovieLens 100K, and MovieLens 1M dataset. Comparative analysis of proposed model against several other traditional metaheuristic based personalization systems reveal that our model is less delicate to the dimension of datasets and it also presents exceptional refinement in terms of prediction complexity and accuracy. [ABSTRACT FROM AUTHOR]

This paper proposes a new content recommendation system which combines the newly proposed embedded feature selection method and the new Fuzzy Temporal Logic based Decision Tree incorporated Convolutional Neural Network classifier. The newly proposed embedded feature selection called Fuzzy Decision Tree and Weighted Gini-Index based Feature Selection Algorithm (FDTWGI-FSA) that contains the existing incorporated the Fuzzy Decision Tree (FDT) and the Weighted Gini-index based Feature Selection Algorithm (WGIFSA) for getting optimized feature subset. Moreover, an enhanced CNN and Fuzzy Temporal Decision Tree for performing the deep learning process which is able to identify the exact e-content from the huge volume of data with the help of the recommended features by the proposed embedded feature selection method. The exact e-content can be identified after performing the five-layer network structure for extracting the relevant features and it also can be classified by applying the Fuzzy Temporal Decision Tree for the e-learners. Finally, the proposed content recommendation system provides exact content to the e-learners according to their level of understanding and it also satisfies them by providing the exact high level contents. The experiments have been conducted for evaluating the proposed content recommendation system and compared with the existing classifier including the standard CNN. [ABSTRACT FROM AUTHOR]

Recommender systems are widely used to provide users with items they may be interested in without explicitly searching. However, they suffer from low accuracy and scalability problems. Although existing clustering techniques have been incorporated to solve these inherent problems, most of them fail to achieve further improvement in recommendation accuracy because of ignoring the correlations between items and the different effects of item attributes on recommendation results. In this article, we propose a novel recommendation algorithm to alleviate these issues to a large extent. First of all, users and items are clustered into multiple cluster subsets based on user-item rating matrix and item attribute deriving from domain experts, respectively. Then we use a selection method relying on item attribute to mine candidate items and only their predictions will be calculated in the next step, which can save the computation time greatly. Furthermore, by weighting the predictions with TF-IDF (Term Frequency-Inverse Document Frequency) weights, the top-N recommendations are generated to the target user for return. Finally, comparative experiments on two real datasets demonstrate that this algorithm provides superior recommendation accuracy in terms of MAE (Mean Absolute Error) and RMSE (Root Mean Square Error). [ABSTRACT FROM AUTHOR]

Recommender systems have been very important components to prevent people from dwelling in the overwhelming information. In this paper we analyze the difference between item-based recommendation algorithms and SVR-based collaborative filtering algorithms, and it can be found that item-based method performs much better while the data is not sparse significantly, and SVR-based method performs better while the data is dense and small. On this premise we propose a method that can combine the advantages of these two methods by predicting a small part of ratings using SVR method firstly and then predicting the rest of ratings using the item-based algorithm, which can solve the problem of data sparsity to certain extend. Finally, we evaluate our results compared with the benchmark on different datasets and prove our method's advantages. [ABSTRACT FROM AUTHOR]

Recommender systems are pivotal components of modern Internet platforms and constitute a well-established research field. By now, research has resulted in highly sophisticated recommender algorithms whose further optimization often yields only marginal improvements. This paper goes beyond the commonly dominating focus on optimizing algorithms and instead follows the idea of enhancing recommender systems with reputation data. Since the concept of reputation-enhanced recommender systems has attracted considerable attention in recent years, the main aim of the paper is to provide a comprehensive survey of the approaches proposed so far. To this end, existing work is identified by means of a systematic literature review and classified according to seven carefully considered dimensions. In addition, the resulting structured analysis of the state of the art serves as a basis for the deduction and discussion of several future research directions. [ABSTRACT FROM AUTHOR]

Intelligent exercise recommendation is a research focus in the field of online learning that can help learners quickly find exercises suitable for them from the exercise bank. However, exercise recommendation differs from product or film recommendation because of some special requirements. First, the recommended exercises must cover all knowledge points geared toward the learning objective of the learner. Second, the difficulty of exercises must match the knowledge level of the target learner. In response to the above requirements, this study proposes an exercise recommendation algorithm that integrates learning objective and assignment feedback. This algorithm considers not only the coverage of knowledge points but also the knowledge level of learners to help them find highly suitable exercises. According to this algorithm, the learning objective of the learner must be initially identified to obtain a course knowledge set that suits his/her learning objective. Second, the understanding of the learner about the knowledge set must be judged based on the assignment feedback. Third, suitable exercises are recommended based on the knowledge level of the learner and the course knowledge structure. The proposed algorithm is experimentally verified by using a real-world dataset and by comparing it with other algorithms. The experimental results show that the proposed algorithm significantly outperforms the other algorithms in both precision and recall. Based on these results, the proposed algorithm can achieve an excellent recommendation performance. [ABSTRACT FROM AUTHOR]

Conventional recommender systems of cold chain logistics distribution mainly focus on the recommendations of the source of cargos, refrigerator trucks and refrigerators in the supply and demand link of cold chain, but ignore contextual information such as time, position and user devices. In this paper, we analyze the contextual information on cold chain logistics distribution and propose a multidimensional context-aware recommendation algorithm(MCARA). MCARA firstly carries out fuzzy clustering on contextual information in historical data set and obtains the contextual clusters. In addition, MCARA compares current user context with historical contexts to get current contextual cluster, and selects out the data with same contextual clusters from historical data set. Finally, MCARA uses the user-based collaborative filtering algorithm to perform personalized recommendations. The simulation results show that MCARA can improve the forecast accuracy of cold chain logistics distribution, with about 10% improvement over other eight approaches. [ABSTRACT FROM AUTHOR]

Recommender systems are software tools used to generate and provide suggestions for items and other entities to the users by exploiting various strategies. Hybrid recommender systems combine two or more recommendation strategies in different ways to benefit from their complementary advantages. This systematic literature review presents the state of the art in hybrid recommender systems of the last decade. It is the first quantitative review work completely focused in hybrid recommenders. We address the most relevant problems considered and present the associated data mining and recommendation techniques used to overcome them. We also explore the hybridization classes each hybrid recommender belongs to, the application domains, the evaluation process and proposed future research directions. Based on our findings, most of the studies combine collaborative filtering with another technique often in a weighted way. Also cold-start and data sparsity are the two traditional and top problems being addressed in 23 and 22 studies each, while movies and movie datasets are still widely used by most of the authors. As most of the studies are evaluated by comparisons with similar methods using accuracy metrics, providing more credible and user oriented evaluations remains a typical challenge. Besides this, newer challenges were also identified such as responding to the variation of user context, evolving user tastes or providing cross-domain recommendations. Being a hot topic, hybrid recommenders represent a good basis with which to respond accordingly by exploring newer opportunities such as contextualizing recommendations, involving parallel hybrid algorithms, processing larger datasets, etc. [ABSTRACT FROM AUTHOR]

Recommender systems apply artificial intelligence techniques for filtering unseen information and predict whether a user would like/dislike a given item. K-Means clustering-based recommendation algorithms have been proposed claiming to increase the scalability of recommender systems. One potential drawback of these algorithms is that they perform training offline and hence cannot accommodate the incremental updates with the arrival of new data, making them unsuitable for the dynamic environments. From this line of research, a new clustering algorithm called One-Pass is proposed, which is a simple realtime algorithm that maintains a good level of accuracy, scale well with data, and build the training model incrementally with the arrival of new data. We run One-Pass algorithm on four different datasets (MovieLens, Film Trust, Book Crossing, and Last-FM) and empirically show that the proposed algorithm outperforms K-Means in terms of recommendation and training time. Moreover, One-Pass algorithm is comparable to K-Means in term of accuracy and cluster quality. [ABSTRACT FROM AUTHOR]

Collaborative filtering is probably the most familiar and most widely implemented recommendation algorithm. However, traditional collaborative filtering methods focus only on rating data to generate recommendation; they do not consider useful information like item genre and evaluation time, which affect the quality of the system's recommendation seriously. In similarity computation, traditional algorithms use all items; they do not introduce genre component in correlation between user and item. Furthermore, they do not consider the influence of time on user's interests; giving the same treatment to user's score at different time. To address this issue, a new item-based collaborative filtering algorithm is proposed to exploit genre information in each item and reflect dynamic changes over time of user's preferences. The proposed algorithm endows each score with a weight function which keeps user's recent, long and periodic interest, and attenuate user's old short interest. Experimental results from Movielens data set show that the new algorithm outperforms the traditional item-based collaborative filtering algorithms. [ABSTRACT FROM AUTHOR]

In our work, an agent-based system supporting workers in an organization is centered around utilization of ontologically demarcated data. In this system, ontological matchmaking, understood as a way of establishing closeness between resources, is one of key functionalities. Specifi- cally, it is used to autonomously provide recommendations to the user, who is represented by her/his personal agent. These recommendations specify, which among available resources are relevant/of interest to the worker. In this paper, we discuss our approach to measuring semantic closeness between ontologically demarcated information objects, while a Duty Trip Support application is used as a case study. General description of the algorithm is followed by a recommendation example based on support for a worker who is seeking advice in planning a duty trip. [ABSTRACT FROM AUTHOR]

“No matching product found” is an undesirable message for the user of an online product finder application or interactive recommender system. Query Relaxation is an approach to recovery from such retrieval failures and works by eliminating individual parts of the original query in order to find products that satisfy as many of the user's constraints as possible. In this paper, new techniques for the fast computation of “user-optimal” query relaxations are proposed. We show how the number of costly catalog queries can be minimized with the help of a query pre-processing approach, how we can compute relaxations that contain at least n items in the recommendation, and finally, how a recent conflict–detection algorithm can be applied for fast determination of preferred conflicts in interactive recovery scenarios. [ABSTRACT FROM AUTHOR]

Collaborative tagging systems allow users to assign keywords – so called “tags” – to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurrences. We show that both FolkRank and collaborative filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. [ABSTRACT FROM AUTHOR]