Search

With the explosion of information, recommendation systems have become important for users to find their interested information. Existing recommendation methods mainly utilize user historical interaction with items or user ratings to capture user past preferences. However, there is ignorance of various personalized reasons for users preferring an item, in which the reasons always dominate users' preference strengths on the item. In addition, the linear nature of traditional recommendation methods makes them less effective in dealing with complex data. With the development of deep learning methods, graph neural networks provide an unprecedented opportunity for recommendations, since the user-item interactions can be naturally represented as a graph and the method can extract high-order complex relationships between users and items. In this paper, we propose a novel method leveraging the FIne-Grained user preferences with Graph Neural Networks (FigGNN) for recommendation to tackle these issues. More specifically, user-item interactions with user annotated tags and user ratings are constructed as a graph. In the process of graph message propagation, the user annotated tags are incorporated for understanding user preference reasons on items, and heterogeneous user rating levels are utilized for recognizing user preference strengths on items. Experiments have been conducted on the MovieLens dataset and the results show a superior performance of FigGNN over baselines in terms of precision and recall, which demonstrates the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Recommendation to groups of users is a challenging subfield of recommendation systems. Its key concept is how and where to make the aggregation of each set of user information into an individual entity, such as a ranked recommendation list, a virtual user, or a multi-hot input vector encoding. This paper proposes an innovative strategy where aggregation is made in the multi-hot vector that feeds the neural network model. The aggregation provides a probabilistic semantic, and the resulting input vectors feed a model that is able to conveniently generalize the group recommendation from the individual predictions. Furthermore, using the proposed architecture, group recommendations can be obtained by simply feedforwarding the pre-trained model with individual ratings; that is, without the need to obtain datasets containing group of user information, and without the need of running two separate trainings (individual and group). This approach also avoids maintaining two different models to support both individual and group learning. Experiments have tested the proposed architecture using three representative collaborative filtering datasets and a series of baselines; results show suitable accuracy improvements compared to the state of the art. [ABSTRACT FROM AUTHOR]

Study into decision support applications in healthcare, such as those dealing to diagnosis, forecasting, treatment planning, and various aspects of patient care, among other things, have seen a significant uptick in interest over the past few years. This surge in interest has been accompanied by a substantial increase in funding. This expansion has taken place as a consequence of developments in artificial intelligence and machine learning, as well as an increase in the availability of computer resources, as well as an increase in the quantity of data that is readily available. Every day, examples of studies that are both very intriguing and have been peer-reviewed are published in journals, which demonstrates the promise of this topic. At the same time, however, there are certain expectations and assumptions regarding the development, validation, and acceptance of such techniques that are unrealistic and at times overly optimistic. These expectations and assumptions exist at the same time as the unrealistic and overly optimistic ones. There are in-depth lectures provided on the topics of machine learning and deep learning, both of which are often used for health recommender systems, as well as how they are applied in the field of health informatics. The purpose of this study is to investigate many approaches that have been used in the area of health informatics in the past. [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]

Nowadays, interactive recommendation systems (IRS) play a significant role in our daily life. Recently, reinforcement learning has shown great potential in solving challenging tasks in IRS, since it can focus on long-term profit and can capture the dynamic preference of users. However, existing RL methods for IRS have two typical deficiencies. First, most state representation models use left-to-right recurrent neural networks to capture the user dynamics, which usually fail to handle the long and noisy sequential data in real life. Second, an IRS always needs to handle millions of items, leading to a large discrete action space in RL settings, which has not been fully addressed by the inefficient existing works. To bridge these deficiencies, in this paper, we propose attention-based tree recommendation (ATRec), an efficient tree-structured policy with attention-based state representation for IRS. ATRec uses an attention-based state representation model to effectively capture the user's dynamic preference hidden in the long and noisy sequence of behaviors. Moreover, to improve the learning efficiency, we propose an efficient tree-structured policy representation method, in which a complete tree is devised to represent the policy, and a novel parameter-sharing strategy is introduced. Extensive experiments are conducted on three real-world datasets and the results show the proposed ATRec obtains 42.3% improvement over some of the state of the arts methods in the hit rate and 21.4% improvement in the mean reciprocal rank of the top 30 ranked items. Additionally, the learning and decision efficiency can also be improved at an average of 35.5%. [ABSTRACT FROM AUTHOR]

Modelling both long- and short-term user interests from historical data is crucial for generating accurate recommendations. However, unifying these metrics across multiple application domains can be challenging, and existing approaches often rely on complex, intertwined models which can be difficult to interpret. To address this issue, we propose a lightweight, plug-and-play interest enhancement module that fuses interest vectors from two independent models. After analyzing the dataset, we identify deviations in the recommendation performance of long- and short-term interest models. To compensate for these differences, we use feature enhancement and loss correction during training. In the fusion process, we explicitly split long-term interest features with longer duration into multiple local features. We then use a shared attention mechanism to fuse multiple local features with short-term interest features to obtain interaction features. To correct for bias between models, we introduce a comparison learning task that monitors the similarity between local features, short-term features, and interaction features. This adaptively reduces the distance between similar features. Our proposed module combines and compares multiple independent long-term and short-term interest models on multiple domain datasets. As a result, it not only accelerates the convergence of the models but also achieves outstanding performance in challenging recommendation scenarios. [ABSTRACT FROM AUTHOR]

Recommendation systems (RSs) are widely used in e-commerce to improve conversion rates by aligning product offerings with customer preferences and interests. While traditional RSs rely solely on numerical ratings to generate recommendations, these ratings alone may not be sufficient to offer personalized and accurate suggestions. To overcome this limitation, additional sources of information, such as reviews, can be utilized. However, analyzing and understanding the information contained within reviews, which are often unstructured data, is a challenging task. To address this issue, sentiment analysis (SA) has attracted considerable attention as a tool to better comprehend a user's opinions, emotions, and attitudes. In this study, we propose a novel RS that leverages ensemble learning by integrating sentiment analysis of textual data with collaborative filtering techniques to provide users with more precise and individualized recommendations. Our system was developed in three main steps. Firstly, we used unsupervised "GloVe" vectorization for better classification performance and built a sentiment model based on Bidirectional Long Short-Term Memory (Bi-LSTM). Secondly, we developed a recommendation model based on collaborative filtering techniques. Lastly, we integrated our sentiment analysis model into the RS. Our proposed model of SA achieved an accuracy score of 93%, which is superior to other models. The results of our study indicate that our approach enhances the accuracy of the recommendation system. Overall, our proposed system offers customers a more reliable and personalized recommendation service in e-commerce. [ABSTRACT FROM AUTHOR]

Recommender systems have been successfully used in many domains with the help of machine learning algorithms. However, such applications tend to use multi-dimensional user data, which has raised widespread concerns about the breach of users’ privacy. Meanwhile, wearable technologies have enabled users to collect fitness-related data through embedded sensors to monitor their conditions or achieve personalized fitness goals. In this article, we propose a novel privacy-aware personalized fitness recommender system. We introduce a multi-level deep learning framework that learns important features from a large-scale real fitness dataset that is collected from wearable Internet of Things (IoT) devices to derive intelligent fitness recommendations. Unlike most existing approaches, our approach achieves personalization by inferring the fitness characteristics of users from sensory data, minimizing the need for explicitly collecting user identity or biometric information, such as name, age, height, and weight. Our proposed models and algorithms predict (a) personalized exercise distance recommendations to help users to achieve target calories, (b) personalized speed sequence recommendations to adjust exercise speed given the nature of the exercise and the chosen route, and (c) personalized heart rate sequence to guide the user of the potential health status for future exercises. Our experimental evaluation on a real-world Fitbit dataset demonstrated high accuracy in predicting exercise distance, speed sequence, and heart rate sequence compared with similar studies.1 Furthermore, our approach is novel compared with existing studies, as it does not require collecting and using users’ sensitive information. Thus, it preserves the users’ privacy. [ABSTRACT FROM AUTHOR]

With the explosive growth of online information, many recommendation methods have been proposed. This research direction is boosted with deep learning architectures, especially the recently proposed graph convolutional networks (GCNs). GCNs have shown tremendous potential in graph embedding learning thanks to its inductive inference property. However, most of the existing GCN-based methods focus on solving tasks in the homogeneous graph settings, and none of them considers heterogeneous graph settings. In this paper, we bridge the gap by developing a novel framework called HeteGraph based on the GCN principles. HeteGraph can handle heterogeneous graphs in the recommender systems. Specifically, we propose a sampling technique and a graph convolutional operation to learn high-quality graph's node embeddings, which differs from the traditional GCN approaches where a full graph adjacency matrix is needed for the embedding learning. We design two models based on the HeteGraph framework to evaluate two important recommendation tasks, namely item rating prediction and diversified item recommendations. Extensive experiments show the encouraging performance of HeteGraph on the first task and the state-of-the-art performance on the second task. [ABSTRACT FROM AUTHOR]

For skeleton-based action recognition, graph convolutional networks (GCN) have absolute advantages. Existing state-of-the-art (SOTA) methods tended to focus on extracting and identifying features from all bones and joints. However, they ignored many new input features which could be discovered. Moreover, many GCN-based action recognition models did not pay sufficient attention to the extraction of temporal features. In addition, most models had swollen structures due to too many parameters. In order to solve the problems mentioned above, a temporal feature cross-extraction graph convolutional network (TFC-GCN) is proposed, which has a small number of parameters. Firstly, we propose the feature extraction strategy of the relative displacements of joints, which is fitted for the relative displacement between its previous and subsequent frames. Then, TFC-GCN uses a temporal feature cross-extraction block with gated information filtering to excavate high-level representations for human actions. Finally, we propose a stitching spatial–temporal attention (SST-Att) block for different joints to be given different weights so as to obtain favorable results for classification. FLOPs and the number of parameters of TFC-GCN reach 1.90 G and 0.18 M, respectively. The superiority has been verified on three large-scale public datasets, namely NTU RGB + D60, NTU RGB + D120 and UAV-Human. [ABSTRACT FROM AUTHOR]

We implement a novel recommender system (RS) metaheuristic framework within a nonlinear NP-hard decision-making problem, for reducing the solution search space before high-burden computational steps are performed. Our RS-based metaheuristic supports consideration of comprehensive evaluation criteria, including estimations of the potential solution set's optimality, diversity, and feedback/preference of the end-user, while also being fully compatible with additional established RS evaluation metrics. Compared to prior Operations Research metaheuristics, our RS-based metaheuristic allows for (1) achieving near-optimal solution scores through comprehensive deep learning training, (2) fast metaheuristic parameter inference during solution instantiation trials, and (3) the ability to reuse this trained RS module for traditional RS ranking of final solution options for the end-user. When implementing this RS metaheuristic within an experimental high-dimensionality simulation environment, we see an average 91.7% reduction in computation time against a baseline approach, and solution scores within 9.1% of theoretical optimal scores. A simplified RS metaheuristic technique was also developed in a more realistic decision-making environment dealing with multidomain command and control scenarios, where a significant computation time reduction of 87.5% is also achieved compared with a baseline approach, while maintaining solution scores within 9.5% of theoretical optimal scores. [ABSTRACT FROM AUTHOR]

The Web has provided an increasing proportion of use as a medium for e-commerce in addition to various recommender systems. It can be used for analyzing recommendation system-based feedback (e.g., a form in which a user inputs their preferences for various items as numerical values into a specific evaluation system) to estimate customer interest; in addition, analyzing multi-modal types of feedback (e.g., product purchase traces, inquiry lists, inquiry times, and comments) with deep learning can also be used to estimate user interest. As many companies around the world promote their products through micro-influencers on the Web, related research has continued to predict the purchase conversion rate of the influencer through a variety of technologies. In this work, we present a multi-modal micro-influencer analysis scheme for a marketing maximization strategy. Our scheme uses the multi-modal data stored in Mecha Solution's own shopping mall of Korea, as well as famous Korean Internet platforms, and Coupang, Naver, and Oliveyoung's data such as article posting comments and statistics information. By extracting the main characteristics of the real article postings from real users as opposed to those from factitious influencers posting articles and comments and identifying articles other than advertisements, influencer scores are obtained, assuming that articles other than advertisements can further increase the purchase conversion rate. Based on influencer score, we propose a multi-modal micro-influencer analysis scheme that recommends influencers use content-based collaborative filtering and user-based collaborative filtering for items that the influencer has not yet reviewed. The experiment was implemented to prove that the proposed scheme successfully achieves this goal. [ABSTRACT FROM AUTHOR]

Web service recommender systems have a fundamental role in the selection, composition and substitution of services. Indeed, they are used in several application areas such as Web APIs and Cloud Computing. Likewise, Deep Learning techniques have brought undeniable advantages and solutions to the challenges faced by recommendations in all areas. Unfortunately, the field of Web services has not yet benefited well from these deep methods, moreover, the works using these methods for Web services domain are very recent compared to the works of other fields. Thus, the objective of this paper is to study and analyze state-of-the-art work on Web services recommender systems based on Deep Learning techniques. This analysis will help readers wishing to work in this field, and allows us to direct our future work concerning the Web services recommendation by exploiting the advantages of Deep Learning techniques. [ABSTRACT FROM AUTHOR]

Recommender systems based on sentiment analysis become challenging due to the presence of enormous data available over the internet. With the lack of proper data cleaning and analysis methods, existing machine learning (ML) techniques fail to generate accurate recommendations. To overcome this issue, this paper proposes a Light Deep Learning (LightDL)-based recommender system that uses Twitter-based reviews. First, the data is collected from Twitter and cleaned by subsequent data cleaning processes. Then, this pre-processed data is fed into the LightDL model, which learns the important features like hashtags, unigrams, multigrams, etc. from each piece of data. Here, we have learned about four groups of features, including semantic features, syntactic features, symbolic features, and tweet-based features. Finally, the data is classified into positive, negative, and neutral categories according to the learned features. On the basis of classified sentiment, the review is generated to the users. Finally, the model is evaluated in terms of accuracy, precision, recall, f-measure, and error rate through extensive experiments in Matlab. The proposed LightDL model outperforms in all performance measures; specifically, it achieves 95% accuracy for the Twitter dataset. [ABSTRACT FROM AUTHOR]

With the advancement of computer hardware and communication technologies, deep learning technology has made significant progress, enabling the development of systems that can accurately estimate human emotions. Factors such as facial expressions, gender, age, and the environment influence human emotions, making it crucial to understand and capture these intricate factors. Our system aims to recommend personalized images by accurately estimating human emotions, age, and gender in real time. The primary objective of our system is to enhance user experiences by recommending images that align with their current emotional state and characteristics. To achieve this, our system collects environmental information, including weather conditions and user-specific environment data through APIs and smartphone sensors. Additionally, we employ deep learning algorithms for real-time classification of eight types of facial expressions, age, and gender. By combining this facial information with the environmental data, we categorize the user's current situation into positive, neutral, and negative stages. Based on this categorization, our system recommends natural landscape images that are colorized using Generative Adversarial Networks (GANs). These recommendations are personalized to match the user's current emotional state and preferences, providing a more engaging and tailored experience. Through rigorous testing and user evaluations, we assessed the effectiveness and user-friendliness of our system. Users expressed satisfaction with the system's ability to generate appropriate images based on the surrounding environment, emotional state, and demographic factors such as age and gender. The visual output of our system significantly impacted users' emotional responses, resulting in a positive mood change for most users. Moreover, the system's scalability was positively received, with users acknowledging its potential benefits when installed outdoors and expressing a willingness to continue using it. Compared to other recommender systems, our integration of age, gender, and weather information provides personalized recommendations, contextual relevance, increased engagement, and a deeper understanding of user preferences, thereby enhancing the overall user experience. The system's ability to comprehend and capture intricate factors that influence human emotions holds promise in various domains, including human–computer interaction, psychology, and social sciences. [ABSTRACT FROM AUTHOR]

With the rapid development of the patent marketplace, patent trading recommendation is required to mitigate the technology searching cost of patent buyers. Current research focuses on the recommendation based on existing patents of a company; a few studies take into account the sequential pattern of patent acquisition activities and the possible diversity of a company's business interests. Moreover, the profiling of patents based on solely patent documents fails to capture the high-order information of patents. To bridge the gap, we propose a knowledge-aware attentional bidirectional long short-term memory network (KBiLSTM) method for patent trading recommendation. KBiLSTM uses knowledge graph embeddings to profile patents with rich patent information. It introduces bidirectional long short-term memory network (BiLSTM) to capture the sequential pattern in a company's historical records. In addition, to address a company's diverse technology interests, we design an attention mechanism to aggregate the company's historical patents given a candidate patent. Experimental results on the United States Patent and Trademark Office (USPTO) data set show that KBiLSTM outperforms state-of-the-art baselines for patent trading recommendation in terms of F1 and normalised discounted cumulative gain (nDCG). The attention visualisation of randomly selected company intuitively demonstrates the recommendation effectiveness. [ABSTRACT FROM AUTHOR]

Course recommendation aims at finding proper and attractive courses from massive candidates for students based on their needs, and it plays a significant role in the curricula-variable system. However, nearly all students nowadays need help selecting appropriate courses from abundant ones. The emergence and application of personalized course recommendations can release students from that cognitive overload problem. However, it still needs to mature and improve its scalability, sparsity, and cold start problems resulting in poor quality recommendations. Therefore, this paper proposes a novel personalized course recommendation system based on deep factorization machine (DeepFM), namely Deep PersOnalized couRse RecommendatIon System (DORIS), which selects the most appropriate courses for students according to their basic information, interests and the details of all courses. The experimental results illustrate that our proposed method outperforms other approaches. [ABSTRACT FROM AUTHOR]

Recommendation system is one of the most common and basic applications in E-Commerce, search engines, etc. However, the user-item rating matrix data in the recommendation system is extremely sparse, resulting in poor recommendation results. This paper proposes a dual auto encoders matrix factorization (DAE-MF) model for the sparseness of the scoring matrix. This model uses a two-way parallel network structure, which combines a convolutional auto encoder and stacked denoising autoencoder and matrix factorization technology, fully combining the advantages of the two modules, effectively improving the model’s data completion capabilities. Through experiments on MovieLens and AIV datasets, it is verified that the DAE-MF method is superior to the existing models in rating prediction tasks. [ABSTRACT FROM AUTHOR]

In today's online market, recommendation systems have become universal and are an aspect of any online shopping portal. The traditional approach uses the subscriber's historical knowledge, and this technique is not adequate for resolving problems with a cold start. These issues include recommendations for non-registered users or newly added customers and new items added. Session-based recommendations based on recurrent neural networks are gaining popularity for product recommendations. This is due to recurrent neural networks' ability to record sequential feature data more effectively throughout the current session, which results in more similarity between consumer behaviour sequences. Nevertheless, most state-of-the-art recurring neural networking systems completely ignore the long-term details of multiple sessions and concentrate solely on short-term communication in a single session. This paper presents a hybrid time-centric prediction model to address research issues that learn the customers' short and long-term behaviours. Experiments on the recsys challenge data set are carried out to assess the efficiency of the hybrid time-centric prediction models over the existing hybrid models in terms of HitRate and Mean-Reciprocal Rate. [ABSTRACT FROM AUTHOR]

Recommending personalized content from massive data for users is the key function of the recommendation system. The recommendation process of the traditional recommendation systems is often regarded as static, which cannot reflect the changes of user's real-time interest. This paper addressed this problem and presented a recommendation model that leverages the ability of deep learning methods to effectively deal with decision-making problems. In this model, a state generation module containing gate recurrent unit (GRU) and attention network was designed to obtain user's long and short-term preferences as well as history scores. Then, an actor-critic algorithm was employed to imitate the real-time recommendations. We trained the proposed model and evaluated it on four wellknown public datasets. It is proved that the proposed model is superior to existing recommendation models. [ABSTRACT FROM AUTHOR]

As software systems evolve, they become more complex and larger, creating challenges in predicting change propagation while maintaining system stability and functionality. Existing studies have explored extracting co-change patterns from changelog data using data-driven methods such as dependency networks; however, these approaches suffer from scalability issues and limited focus on high-level abstraction (package level). This article addresses these research gaps by proposing a file-level change propagation to vector (FCP2Vec) approach. FCP2Vec is a recommendation system designed to aid developers by suggesting files that may undergo change propagation subsequently, based on the file being presently worked on. We carried out a case study utilizing three publicly available datasets: Vuze, Spring Framework, and Elasticsearch. These datasets, which consist of open-source Java-based software development changelogs, were extracted from version control systems. Our technique learns the historical development sequence of transactional software changelog data using a skip-gram method with negative sampling and unsupervised nearest neighbors. We validate our approach by analyzing historical data from the software development changelog for more than ten years. Using multiple metrics, such as the normalized discounted cumulative gain at K (NDCG@K) and the hit ratio at K (HR@K), we achieved an average HR@K of 0.34 at the file level and an average HR@K of 0.49 at the package level across the three datasets. These results confirm the effectiveness of the FCP2Vec method in predicting the next change propagation from historical changelog data, addressing the identified research gap, and show a 21% better accuracy than in the previous study at the package level. [ABSTRACT FROM AUTHOR]

Because graph convolution network (GCN) can use the cooperation signals of high-order neighbors to learn the embedding of users and items better, it has been widely used in recommendation systems. However, in the current multi-relationship recommendation model based on GCN, the embedding learning of user nodes will be interfered by highorder adjacent users with dissimilar interests, so that users with different interests will get similar embedding after multilayer graph convolution, resulting in the over- smoothing problem. Therefore, this paper proposes a multi- relationship recommendation model based on user interest-aware (IMRRM) because the above problem. First, the model uses a light graph convolutional network in the user-item heterogeneous interaction graph to obtain the graph structure information of each user. And then the subgraph generation module uses the user's graph structure information and initial features to effectively identify users with similar interests, and group similar users and their interaction items into a subgraph. Finally, more accurate user embeddings are obtained by performing deep embedding learning in subgraphs to prevent unrelated high-order neighbors from propagating more negative information. Therefore, the IMRRM model reduces the influence of noise information on user embedding learning, effectively alleviates the over- smoothing problem, and makes multi- relationship recommendation more accurately. The effectiveness and robustness of IMRRM are verified by experiments on two public datasets, Beibei and Taobao. The experimental results show that the IMRRM model is improved by 1.98% and 1.49% on HR10, and 1.58% and 1.81% on NDCG10, respectively, with better performance. [ABSTRACT FROM AUTHOR]

Recommender system (RS) is a suitable tool for filtering out items and providing the most relevant and suitable items to each user, based on their individual preferences. Deep learning algorithms achieve great success in several fields including RS. The issue with deep learning-based RS models is that, they ignore the differences of users' preferences, and they build a model based on all the users' rates. This paper proposed an optimized clustering-based denoising autoencoder model (OCB-DAE) which trains multiple models instead of one, based on users' preferences using k-means algorithm combined with a nature-inspired algorithm (NIA) such as artificial fish swarm algorithm to determine the optimal initial centroids to cluster the users based on their similar preferences, and each cluster trains its own denoising autoencoder (DAE) model. The results proved that combining NIA with k-means gives better clustering results comparing with using k-means alone. OCB-DAE was trained and tested with MovieLens 1M dataset where 80% of it is used for training and 20% for testing. Root mean squared error (RMSE) score was used to evaluate the performance of the proposed model which was 0.618. It outperformed the other models that use autoencoder and denoising autoencoder without clustering with 38.5% and 29.5% respectively. [ABSTRACT FROM AUTHOR]

Modeling contextual information is a vital part of developing effective recommender systems. Still, existing work on recommendation algorithms has generally put limited focus on the effective treatment of contextual information. Moreover, adding context to recommendation models is challenging since it increases the dimensionality and complexity of the model. Therefore, an efficient learning method is required to extract an association and inter-relationship between user/item features and contextual features for preference-driven modeling. The engineering of features through the exploration of adjacent correlations between the user/item and their context, and their further learning through a distance-based metric, is critical for effective personalization. Motivated by this, we introduce a context-aware recommendation strategy using a ‘contextual grid triplet network.’ This strategy uses a contextual grid topology to capture robust semantic representations of users, items, and contextual data. We present a learning methodology that merges a triplet network with a convolutional neural network. This fusion enables the exploration of associations both ‘within’ the contextual grid, such as between users or items, and ‘between’ different contextual grids, like between a user and items of input. Moreover, we present a variant of a hinge loss function using a triplet network for improved performance and fast convergence. In this work, we study how these aspects boost the quality of top-N recommendations. Furthermore, We show through extensive ablation-based experiments that the proposed method outperforms existing state-of-the-art techniques, demonstrating its robustness and feasibility.

Recommender systems have become increasingly popular due to the significant rise in digital information over the internet in recent users. They help provide personalized recommendations to the user by selecting a few items out of a large set of items. However, with the growing size of item space and users, scalability remains a key issue for recommender systems. However, most existing policy gradient approaches in recommendations suffer from high variance leading to an increase in instability during the learning process. Policy Gradient Algorithms such as PPO are proven to be effective in large action spaces (a large number of items) as they learn the optimal policy directly from the samples. We use the PPO algorithm to train our Reinforcement Learning agent modeling the collaborative filtering process as a Markov Decision Process. PPO utilizes the actor-critic framework and thus mitigates the high variance in Policy Gradient Algorithms. Further, we address the cold start issue in Collaborative filtering with autoencoder-based content filtering. Proximal Policy Optimization (PPO) methods are today considered among the most effective reinforcement learning methods, achieving state-of-the-art performance and even outperforming Deep Q learning methods. In this paper, we propose a switching hybrid recommender system using the two different recommender system techniques. A switching hybrid system can switch between recommendation techniques depending on some criterion and can tackle its constituent recommender system's shortfall using the other counterpart in a particular situation. We show that our method outperforms various baseline methods on the popular Movielens datasets for different evaluation metrics. On Movielens 1m, our method outperforms the baseline by 9.19% in terms of R@10 and 3.86% and 6.58% in terms of P@10 and P@20, respectively. For the Movielens 100k dataset, our method improves on the baseline methods by 4.10% in terms of P@10 and 3.90% and 2.40% in terms of R@10 and R@20. [ABSTRACT FROM AUTHOR]

Recently, more and more attention has been paid to the recommender systems incorporating review information. However, there are two main problems. (1) Among the many reviews written by a user, most of the existing works have not considered the special importance of the user's review for the target item (RT) in building user preferences, which may fail to capture more accurate preferences of the user. (2) Most of the existing work does not dynamically construct the user and the item feature representations in a fine-grained manner according to the aspect characteristics of the target item before user and item nonlinear interaction, which may lead to suboptimal recommendation performance. Therefore, we propose a m ain-a uxiliary n etwork (MAN) based on deep learning for item recommendation. Specifically, MAN uses the auxiliary network to focus on the purification of RT at the word level and assists the main network in generating the predicted value of RT. The main network deals with the user-item interaction according to the relationship between the user multiaspect features and the item as the most prominent aspect feature and then generates the final rating prediction. Note, MAN only uses the main network for testing. Extensive experiments on five public datasets show that MAN outperforms the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In order to predict and recommend what users want, users' information is required, and more information is required to improve the performance of the recommender system. As IoT devices and smartphones have made it possible to know the user's context, context-aware recommender systems have emerged to predict preferences by considering the user's context. A context-aware recommender system uses contextual information such as time, weather, and location to predict preferences. However, a user's preferences are not always the same in a given context. They may follow trends or make different choices due to changes in their personal environment. Therefore, in this paper, we propose a context-aware recommender system that considers the change in users' preferences over time. The proposed method is a context-aware recommender system that uses Matrix Factorization with a preference transition matrix to capture and reflect the changes in users' preferences. To evaluate the performance of the proposed method, we compared the performance with the traditional recommender system, context-aware recommender system, and dynamic recommender system, and confirmed that the performance of the proposed method is better than the existing methods. [ABSTRACT FROM AUTHOR]

Recommender systems are challenged with providing accurate recommendations that meet the diverse preferences of users. The main information sources for these systems are the utility matrix and textual sources, such as item descriptions, users' reviews, and users' profiles. Incorporating diverse sources of information is a reasonable approach to improving recommendation accuracy. However, most studies primarily use the utility matrix, and when they use textual sources they do not integrate them with the utility matrix. This is due to the risk of combined information causing noise and reducing the effectiveness of good sources. To overcome this challenge, in this study we propose a novel method that utilizes the Transformer Model, a deep learning model that efficiently integrates textual and utility matrix information. The study suggests feature extraction techniques suitable for each information source and an effective integration method in the Transformer model. The experimental results indicate that the proposed model significantly improves recommendation accuracy compared to the baseline model (MLP) for the Mean Absolute Error (MAE) metric, with a reduction range of 10.79% to 31.03% for the Amazon sub-datasets. Furthermore, when compared to SVD, which is known as one of the most efficient models for recommender systems, the proposed model shows a decrease in the MAE metric by a range of 34.82% to 56.17% for the Amazon sub-datasets. Our proposed model also outperforms the graph-based model with an increase of up to 108% in Precision, a decrease of up to 65.37% in MAE, and a decrease of up to 59.24% in RMSE. Additionally, experimental results on the Movielens and Amazon datasets also demonstrate that our proposed model, which combines information from the utility matrix and textual sources, yields better results compared to using only information from the utility matrix. [ABSTRACT FROM AUTHOR]

In recent years, service-oriented computing technology has developed rapidly. The growing number of services increases the choice burden of software developers when developing service-based systems, such as mashups or applications. How to recommend appropriate services for developers to create mashups has become a basic problem in service-oriented recommendation systems. To solve this problem, people have proposed various methods to recommend services to match the requirements of the new mashups and achieved great success. However, there are also some challenges in feature utilization and text requirement understanding. Therefore, we propose a Mashup-oriented Service Recommendation framework based on Deep Learning, called MSRDL. A content component was designed in MSRDL to generate the representation of mashups and services. Besides, an interaction component was created in MSRDL to model the invocation records between mashups and services. The output features of the two parts are further integrated into MLP to obtain the service recommendation lists. Experimental results on ProgrammableWeb datasets show that our method is superior to the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

With the rapid development of Internet medical information technology, a large amount of medical data appeared on the Internet, however, how to extract effective information from the massive and complex medical data to provide professional medical services and suggestions to users has become a hot spot for this research. The recommendation system can effectively solve the problem of accurate matching of complex medical data resources; however, the cold start, data sparsity and user interest migration of the system in the complex data environment have a large impact on the recommendation effect; therefore, this paper proposes a weighted neural matrix decomposition improved health management recommendation scheme incorporating deep learning techniques. The scheme first uses an implicit feedback method to improve the prediction scores and improve the linear model performance of the matrix decomposition algorithm to form a weighted neural matrix decomposition health management recommendation algorithm. Second, the improved method and deep neural network are fused to improve the performance of the nonlinear model part of the algorithm by using the structural properties of the neural network. Finally, this paper's method is compared with the mainstream six recommendation algorithms on four publicly available real datasets. The experimental results show that the root mean square error (RMSE) of the WENMF algorithm is smaller than that of the comparison algorithm on all four datasets, and the convergence speed is faster. The hit rate (HR) and normalized discounted cumulative gain (NDCG) of the WENMF algorithm are higher than those of the comparison algorithm on all four datasets, and the maximum difference is 0.04. Therefore, the recommendation accuracy and ranking quality of the WENMF algorithm in the recommendation system are verified, and the cold start and data sparsity problems of the recommendation system are effectively alleviated. [ABSTRACT FROM AUTHOR]

Expert recommendation is one of the research hotspots in the online Q&A community. However, the majority of the currently used algorithms concentrate on matching user's static interest and question information, ignoring the efficient capture of user' s dynamic interest representation information, which results in a lack of recommendation accuracy. In order to address the aforementioned issues, this paper proposed an expert recommendation algorithm for the Q&A community that incorporated multi-head self-attention. Firstly, this algorithm built out question encoders of convolutional neural networks and attention mechanisms to process target question and user' s historically answered questions, in order to extract the corresponding question representations. Secondly, it treated the sequence of user's historically answered questions as a time series and used the multi-head self-attention mechanism to learn the dynamic interest representations hidden in the sequence, and combined with the user' s static interest representations to obtain the user' s comprehensive interest representations. Finally, it calculated the similarity between the target question representation and the comprehensive user representation to generate recommendation results. Based on the real data from the Zhihu Q&A community, the experimental results show that the performance of this algorithm is significantly better than the current popular expert recommendation algorithm. [ABSTRACT FROM AUTHOR]

Nowadays, Artificial Intelligence (AI) technology, especially, machine learning has received significant attention from many researchers and professionals in several domains. For instance, this technology has revolutionized industrials sectors, such as e-commerce, health, manufacturing, and entertainment, as well as, the educational sector. In this context, during the pandemic, educational institutions around the globe recognized the benefits of adopting remote learning and teaching based on many e-learning platforms. Hence, deploying virtual classrooms is not that easy, due to many constraints, such as time, technological cost, lack of interactivity of learners, and the unsuitability of the learner's cognitive abilities and learning style. To this end, understanding the learner's style and providing adapted and personalized content are the main concerns of today's e-learning systems. To this end, integrating efficient recommender systems into online learning environment is required in order to consider student's behaviors and preferences when recommending various learning materials. Thus, intelligent recommender systems are able to provide a personalized learning path in which the system adapts to the student's learning requirements and abilities. This review discusses the different applications, methods, and challenges of AI-based recommendation systems used to assist different stockholders in an online learning environment. [ABSTRACT FROM AUTHOR]

In the past few years, with the advent and developments of artificial intelligence, the location-based mobile services became prevalent, which produce large-scale location-based data that embeds abundant hints of user preferences on locations. Point of interest (POI) recommendation, as one of the significant mobile services, aims to recommend new satisfactory location to user according to their historical records. Existing classical POI recommendation models based on matrix factorization and collaborative filtering both face a significant challenge that they can not capture the users' preferences deeply and effectively. Hence, we propose a deep POI recommendation model (Neu-PCM), which is based on neural networks, to extract the potential correlation between user and location. First, we present a local learning and dimension-reduction network to obtain the key information. Second, we put forward a union network to mine the potential correlation effectively. Third, we build a deep matrix factorization to enhance the final prediction by correlation combination. The results of experiments on real-world datasets demonstrate our model outperforms the current popular recommendation algorithms. [ABSTRACT FROM AUTHOR]

Electronic commerce has a strong connection with recommendation processes. There are various forms of recommendations, ranging from virtual assistants to online suggestions made in real time. Different algorithms and technologies are utilized for each form, and the choice of technique is dependent on the task at hand. For instance, artificial intelligence may utilize deep learning or machine learning techniques. The type of data also plays a role in determining the techniques used. Predictive modeling is applied to textual data, while image data requires image processing followed by AI algorithms for prediction. This study aimed to investigate the extent to which artificial intelligence is utilized in recommender systems for electronic commerce, as well as the current and future trends in the field. This was achieved through a systematic literature review of scientific articles from the past decade, using WosViewer for data collection and the Bibliometrix R package for analysis. The findings demonstrate that artificial intelligence works in conjunction with other technologies, such as blockchain, virtual reality, and augmented reality, to enhance the consumer experience throughout the e-commerce process. [ABSTRACT FROM AUTHOR]

To meet the demand for accurate recommendation and personalized learning in online education, an online course recommendation algorithm with multilevel fusion of user features and item features is proposed for content‐based recommendation systems applied to online education courses that have weak generalization ability and cannot cope well with data sparsity. The algorithm is improved on the deep learning recommendation algorithm named Wide & Deep Learning (WDL), which is a CTR (Click‐through rate prediction) prediction algorithm. MMF (Multi‐level Fusion Feature) uses collaborative filtering to replace linear methods in the wide part of WDL, introduces feature interactions to model user representations and item representations separately, and uses ResNet (Residual Network) ideas to improve deep neural network (DNN) in the deep part to reduce the performance degradation caused by overfitting. The experimental validation was conducted on the online education data set and the public data set MovieLens‐1M, and the AUC was improved by 1.21% and 1.46%, respectively. Meanwhile, the effect brought by this improved algorithm is interpretable. [ABSTRACT FROM AUTHOR]

Both accurate and fast mobile recommendation systems based on click behaviors analysis are crucial in ebusiness. Deep learning has achieved state-of-the-art accuracy and the traditional wisdom often hosts these computation-intensive models in powerful cloud centers. However, the cloud-only approaches put significant computational pressure on cloud servers and increase the latency in heavy-load scenarios. Moreover, existing work often adopts RNN structures to model behaviors that suffer from low processing speed for under-utilization of parallel devices such as GPUs. In this work, we propose an efficient internet behaviorbased recommendation framework with edge-cloud collaboration on deep CNNs (CoRec) to improve both the accuracy and speed for mobile recommendation. A novel convolutional interest network (CIN) improves the accuracy by modeling the long- and short-term interests and accelerates the prediction through parallelfriendly convolutions. To further improve the serving throughput and latency, a novel device-cloud collaboration strategy reduces workloads by pre-computing and caching long-term interests in the cloud offline and real-time computation of short-term interests in devices. Extensive experiments on real-world datasets show that CoRec significantly outperforms the state-of-the-art methods in accuracy and has achieved at least an order of magnitude improvement in latency and throughput compared to cloud-only RNN-based approaches for long behaviors. [ABSTRACT FROM AUTHOR]

Human aesthetics play a significant role in video game development, emotional‐aware robot design, online recommender systems, digital human, and other domains of research focusing on human‐computer interactions. Social network user recognition based on aesthetic preferences is an emerging research domain. In this paper, a novel deep learning architecture is proposed for multi‐modal audio‐visual person identification that combines audio and visual aesthetic features. A pre‐trained ResNet architecture is utilized to extract high‐level features from a set of user‐preferred audio and image samples. A novel deep learning‐based fusion technique called residual‐aided intermediate fusion (RAIF) is introduced in order to effectively merge the audio and visual features. The proposed RAIF method achieved an accuracy of 98% and a loss of 0.01 on a proprietary multi‐modal dataset, indicating its effectiveness in fusing audio and visual information. [ABSTRACT FROM AUTHOR]

Music plays a significant role in improving and elevating one's mood as it is one of the important source of entertainment and inspiration to move forward. Recent studies have shown that humans respond as well as react to music in a very positive manner and that music has a high impact on human's brain activity. Now-a-days, people often prefer to listen to music based on their moods and interests. This work focuses on a system that suggests songs to the users, based on their state of mind. In this system, computer vision components are used to determine the user's emotion through facial expressions. Once the emotion is recognized, the system suggests a song for that emotion, saving a lot of time for a user over selecting and playing songs manually. Conventional method of playing music depending upon the mood of a person requires human interaction. Migrating to the computer vision technology will enable automation of such system. To achieve this goal, an algorithm is used to classify the human expressions and play a music track as according to the present emotion detected. It reduces the effort and time required in manually searching a song from the list based on the present state of mind of a person. The expressions of a person are detected by extracting the facial features using the Haar Cascade algorithm and CNN Algorithm. An inbuilt camera is used to capture the facial expressions of a person which reduces the designing cost of the system as compared to other methods. [ABSTRACT FROM AUTHOR]

Convolutional neural-network-based autoencoders, which can integrate the spatial correlation between pixels well, have been broadly used for hyperspectral unmixing and obtained excellent performance. Nevertheless, these methods are hindered in their performance by the fact that they treat all spectral bands and spatial information equally in the unmixing procedure. In this article, we propose an adaptive spectral–spatial attention autoencoder network, called SSANet, to solve the mixing pixel problem of the hyperspectral image. First, we design an adaptive spectral–spatial attention module, which refines spectral–spatial features by sequentially superimposing the spectral attention module and spatial attention module. The spectral attention module is built to select useful spectral bands, and the spatial attention module is designed to filter spatial information. Second, SSANet exploits the geometric properties of endmembers in the hyperspectral image while considering abundance sparsity. We significantly improve the endmember and abundance results by introducing minimum volume and sparsity regularization terms into the loss function. We evaluate the proposed SSANet on one synthetic dataset and four real hyperspectral scenes, i.e., Samson, Jasper Ridge, Houston, and Urban. The results indicate that the proposed SSANet achieved competitive unmixing results compared with several conventional and advanced unmixing approaches with respect to the root mean square error and spectral angle distance. [ABSTRACT FROM AUTHOR]

Although reinforcement learning (RL) can solve complex tasks after training, it's difficult to extend trained agents to target environments with perturbations. This lack of generalization ability has caused the dilemma of large-scale application of RL. Rich neural networks have brought huge improvements to deep learning, but these aren't adapted to RL and even bring negative effects. Therefore, RL algorithms have few choices of neural network, which greatly limits the representation and generalization ability of RL. To overcome these limitations, we propose a deep semi-dense compression network (DSCN) to improve RL generalization ability. First, we perform a structural extension on a general network model for RL. Then based on the information theory, we propose a semi-dense connection to enhance the neural information flow (NIF) of initial features. Finally, drawing on the ideas of course learning, we propose a channel compression approach to filter the redundant information of the deep network. In addition, we innovatively extend the experimental environment and evaluation metrics of the existing platform, which can fully evaluate the performance of DSCN. The experimental results show that our model achieves stable and significant generalization performance improvement. [ABSTRACT FROM AUTHOR]

Deep learning, which is a subfield of machine learning, has opened a new era for the development of neural networks. The auto-encoder is a key component of deep structure, which can be used to realize transfer learning and plays an important role in both unsupervised learning and non-linear feature extraction. By highlighting the contributions and challenges of recent research papers, this work aims to review state-of-the-art auto-encoder algorithms. Firstly, we introduce the basic auto-encoder as well as its basic concept and structure. Secondly, we present a comprehensive summarization of different variants of the auto-encoder. Thirdly, we analyze and study auto-encoders from three different perspectives. We also discuss the relationships between auto-encoders, shallow models and other deep learning models. The auto-encoder and its variants have successfully been applied in a wide range of fields, such as pattern recognition, computer vision, data generation, recommender systems, etc. Then, we focus on the available toolkits for auto-encoders. Finally, this paper summarizes the future trends and challenges in designing and training auto-encoders. We hope that this survey will provide a good reference when using and designing AE models. [ABSTRACT FROM AUTHOR]

The advancements in intelligent vehicle technologies are facilitating the growth of information technology (IT) platforms, unlike conventional automobiles. In-vehicle-infotainment (IVI) is becoming an appealing element in intelligent vehicles as it offers various experiences to users; however, it requires personalized services to provide even more sophisticated user experiences. It is supposed that passengers search for businesses that provide products or services they found interesting in videos played via IVIs while the vehicle is driving autonomously. In that case, it could be more effective to use images that can express the user's preference as a query for the search than to utilize texts such as product names. Accordingly, this study proposes a recommendation system that informs users of businesses near an intelligent vehicle when a passenger inputs an image of a product or service into an IVI system. The proposed recommendation system involves training deep learning-based image classification models with the user's interest images to classify the category, measure the similarity with the business category using Word2vec, and finally provide the locations of the businesses with a high degree of similarity via IVI, using a smartphone. The experimental results indicated that the user's interest image exhibited 85% accuracy for category classification via the EfficientNet B0 model, while the similarity between the image and business categories using Word2vec was particularly high in the business category similar to the actual image category. [ABSTRACT FROM AUTHOR]

In today's digital age, choosing the right product, web page, news article, or even a research paper like this one from an extensive number of options is one of the most tedious tasks. The resolution to this problem is using a recommender system(RS), which helps you choose the suitable item according to your profile. In this research, We present a novel deep neural network based hybrid recommender system that addresses the lacunas of traditional Collaborative Filtering (CF) and current hybrid systems while also delivering higher accuracy in recommendations. Due to insufficient training data, CF recommender systems suffer from low accuracy, linear latent factor, and cold-start problem. To overcome these problems, we employ a Deep neural network-based approach which uses user and item vectors to encapsulate users' and items' data to train on High dimensionality non-linear data to provide more accurate recommendations. User-user networks are employed to provide a better collaboration and synergy facet to our model. In our approach, Combining user-user networks with Deep neural networks yields higher predictive accuracy and better running time than other state-of-art methods. Extensive experimentation on publicly available Flixster and MovieLens Datasets concludes that our technique outperforms current premier methods by achieving improvement of 19% in RMSE, 9.2% in MAE and 4.1% in F1 Score. [ABSTRACT FROM AUTHOR]

In the recommendation systems, the user feedback data (e.g., user-item rating and the social information) is usually sparse, discrete and full of noise. However, most of existing methods use it to make recommendations directly, which leads to the reduction of their recommendation accuracy and quality ultimately. To address this problem, this paper proposes an Enhanced Autoencoder Framework with knowledge distillation (EAF-SR) for learning robust information from user feedback data, where it consists of three parts: Pre-training, knowledge distillation layers and Re-training. Specifically, Pre-training is proposed to generate the soft targets by using the stacked denoising autoencoder (SDAE) from user feedbacks and trust information, which aims to reduce data noise. Then, knowledge distillation layers are developed to learn the robust information from the generated soft targets. Finally, Re-training network combined with Pre-training is designed to make recommendations for each user. Extensive experiments done on three real-world datasets (e.g., Flixster, Epinions and Douban) show that the proposed EAF-SR is superior to the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

As a powerful data modeling tool, Heterogeneous Information Network (HIN) has been successfully used in auxiliary information exploitation to boost recommendation performance. For HIN based recommendation, it is challenging to extract and fuse useful features of user preferences and item attributes under different semantic paths in HINs. Existing methods leverage a pre-defined fusion function to integrate different semantics for recommendation, which cannot characterize the complex nonlinear interactions between users and items. In this paper, we present a general framework named MNRec, short for Meta-path fusion based Neural Recommendation, to extract and fuse user and item embeddings under different meta-paths for recommendation. Under the framework, we propose an instantiation of MNRec with Multi-Layer Perceptron (MLP) structure. It consists of two major steps, i.e., meta-path based heterogeneous network embedding and deep learning based rating prediction. Concretely, appropriate meta-paths are first designed according to domain knowledge. Then the embeddings of users and items are obtained through a meta-path and commuting matrix based heterogeneous network embedding method. Finally, in light of the powerful nonlinear modeling capabilities of deep neural networks, the learned embeddings under different meta-paths are integrated into a two-pathway MLP structure for rating prediction. Experimental results on three real-world datasets demonstrate the superiority and effectiveness of MNRec compared with state-of-the-art baselines in rating prediction. [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]

Multi-task learning in deep neural networks has become a topic of growing importance in many research fields, including drug discovery. However, applying multi-task learning poses new challenges in improving prediction performance. This study investigated the potential of training data enrichment to enhance multi-task model prediction quality in drug discovery. The study evaluated four scenarios with varying degrees of information capacity of the training data and applied two types of test data to evaluate prediction performance. We used three datasets: ViralChEMBL, which consisted of binary activities of compounds against viral species, was applied for the classification task; pQSAR(159) and pQSAR(4267), which consisted of bio-activities of compounds and assays from the research of the profile-QSAR method, were applied for regression tasks. We built multi-task models based on the feed-forward DNNs using the PyTorch framework. Our findings showed that training data enrichment could be an effective means of enhancing prediction performance in multi-task learning, but the degree of improvement depends on the quality of the training data. The more unique compounds and targets the training data included, the more new compound-target interactions are required for prediction improvement. Also, we found out that even using multi-task learning, one could not predict the interactions of compounds that are highly dissimilar from those used for model training. The study provides some recommendations for effectively employing multi-task learning in drug discovery to improve prediction accuracy and facilitate the discovery of novel drug candidates. [ABSTRACT FROM AUTHOR]

Deep learning has yielded success in many research fields. In the last few years, deep learning techniques have been applied in recommender systems to solve cold start and data sparsity problems. However, only a few attempts have been made in social-based recommender systems. In this study, we address this issue and propose a novel recommendation model called Sentiment based Social Neural Hybrid Filtering (S-SNHF). This model combines collaborative and content-based filtering with social information using a deep neural architecture based on Generalized Matrix Factorization (GMF) and Hybrid Multilayer Perceptron (HybMLP). Furthermore, for achieving higher recommendation reliability, the hybrid sentiment analysis model is integrated to analyse users' opinions and infer their preferences. The results of the empirical study performed with three popular datasets show the contribution of both, social information and sentiment analysis on the recommendation performance and that our approach achieves significantly better recommendation accuracy, compared with state-of-the-art recommendation methods. [ABSTRACT FROM AUTHOR]

In recent years, there has been a growing interest in developing next point-of-interest (POI) recommendation systems in both industry and academia. However, current POI recommendation strategies suffer from the lack of sufficient mixing of details of the features related to individual users and their corresponding contexts. To overcome this issue, we propose a deep learning model based on an attention mechanism in this study. The suggested technique employs an attention mechanism that focuses on the pattern's friendship, which is responsible for concentrating on the relevant features related to individual users. To compute context-aware similarities among diverse users, our model employs six features of each user as inputs, including user ID, hour, month, day, minute, and second of visiting time, which explore the influences of both spatial and temporal features for the users. In addition, we incorporate geographical information into our attention mechanism by creating an eccentricity score. Specifically, we map the trajectory of each user to a shape, such as a circle, triangle, or rectangle, each of which has a different eccentricity value. This attention-based mechanism is evaluated on two widely used datasets, and experimental outcomes prove a noteworthy improvement of our model over the state-of-the-art strategies for POI recommendation. [ABSTRACT FROM AUTHOR]