Search

A primary strategy for constructing click-through rate models based on deep learning involves combining a multi-layer perceptron (MLP) with custom networks that can effectively capture the interactions between different features. This is due to the widespread recognition that relying solely on a vanilla MLP network is not effective in acquiring knowledge about multiplicative feature interactions. These custom networks often employ product methods, such as inner, Hadamard, and outer products, to construct dedicated architectures for this purpose. Among these methods, the outer product has shown superiority in capturing feature interactions. However, the resulting quadratic form from the outer product operation limits the conveyance of informative higher-order interactions to the MLP. Efforts to address this limitation have led to models attempting to increase interaction degrees to higher orders. However, utilizing matrix factorization techniques to reduce learning parameters has resulted in information loss and decreased performance. Furthermore, previous studies have constrained the MLP's potential by providing it with inputs consisting of homogeneous outer products, thus limiting available information diversity. To overcome these challenges, we introduce DONN, a model that leverages a composite-wise bilinear module incorporating factorized bilinear pooling to mitigate information loss and facilitate higher-order interaction development. Additionally, DONN utilizes a feature-wise bilinear module for outer product computations between feature pairs, augmenting the MLP with combined information. By employing heterogeneous outer products, DONN enhances the MLP's prediction capabilities, enabling the recognition of additional nonlinear interdependencies. Our evaluation on two benchmark datasets demonstrates that DONN surpasses state-of-the-art models in terms of performance. [ABSTRACT FROM AUTHOR]

The efficacy of e-commerce conversion rates relies on precise and personalized product recommendations within recommendation systems (RS). While collaborative filtering-based RS has demonstrated success, challenges such as sparsity and cold-start issues in the user-item matrix can impede optimal functionality. To address these challenges, there is a need to integrate additional information sources, encompassing item/user profiles and textual reviews. This study introduces an innovative RS architecture that seamlessly combines self-supervised learning (SSL) and collaborative filtering techniques with BERT-DNN to surmount these obstacles. The distinctiveness of our approach lies in integrating self-supervised learning with collaborative filtering and contextualized data obtained from BERT-DNN, providing a profound understanding of item profiles to enhance comprehension of user preferences and item characteristics. This refined understanding, operational in conjunction with collaborative filtering models like ItemKNN and UserKNN, empowers the system to generate highly personalized recommendations. The proposed method entails several pivotal steps: developing the BERT language model for textual embeddings in item profiles, conducting dimensionality reduction, constructing a Deep Neural Network, implementing self-supervised learning with both UserKNN and ItemKNN CF methods, and employing an ensemble learning technique. Empirical results substantiate the efficacy of our approach, with a specific focus on the innovative fusion of BERT-DNN with self-supervised learning and KNN CF methodologies, showcasing substantial improvements across diverse performance metrics. This underscores the practical importance of leveraging contextualized BERT-DNN data, strengthening the recommendation mechanism, and ultimately enhancing the overall performance of the RS. [ABSTRACT FROM AUTHOR]

Semantic similarity has been gaining traction in the field of natural language processing. It is a measure of how similar two pieces of text are in terms of their meaning. It can be used to improve search engine results. We propose a deep learning-based approach to build a semantic similarity search engine for movies based on a movie summary. Filmmakers can gain insight into audience preferences and trends, allowing them to create more engaging and successful films. The dataset used in this study was gathered from internet movie database (IMDb), it includes movie summaries along with their corresponding name movies. The test dataset was generated using ChatGPT to be very close to human input. The universal sentence encoder (USE) model presented promising results in semantic similarity, the model results show that for the top 5 similar movies, the model returned 176 out of 300 movies (58.6%). For the top 10 similar movies, the model returned 211 out of 300 movies (70.3%). Additionally, for the top 15 similar movies, the model returned 229 out of 300 movies (76.3%). And, for the top 20 similar movies, the model returned 249 of 300 movies (83%). This method can be applied to movie recommendation systems or to organize films in a collection automatically. [ABSTRACT FROM AUTHOR]

With the massive amount of data available on the Internet, many users face problems when they need access to the information and goods they need. Adapting information to user needs has become a complex and time-consuming process. Recommender systems are powerful tools for guiding users in electronic settings to information, services, and goods of interest. With the ability to identify users and predict their preferences, recommender systems can extract information likely to be of interest to users from vast amounts of data and save time and energy by providing them with relevant recommendations. Therefore, in this paper, a framework for a recommender system is proposed, which consists of four main phases. In the first phase, the preprocessing operation is performed. The purpose of this phase is to create an ontology model for products based on the convolutional neural network method. Data collection operations are carried out in the second phase. The purpose of this phase is to receive and store user information based on behavior and different criteria. The third phase is related to creating an ontology. The purpose of this phase is to create an ontology model for user behavior using OWL libraries. Finally, in the last phase, finding similarities and presented a proposal. The purpose of this phase is the necessary calculations of the proposed framework in the similarity finding section using ontology models. Simulation results show that the proposed framework measures MAE (more than 10 and 15%), RMSE (more than 12 and 16%), precision (less than 10 and 13%), recall (more than 25 and 28%), F1-score (higher than 25 and 30%) and Score of User (higher than 15 and 17%) outperform two related approaches, namely CF and CF+ Ontology, respectively. [ABSTRACT FROM AUTHOR]

How to construct imperceptible (realistic) fake samples is critical in adversarial attacks. Due to the sample feature diversity of a recommender system (containing both discrete and continuous features), traditional gradient-based adversarial attack methods may fail to construct realistic fake samples. Meanwhile, most recommendation models adopt click-through rate (CTR) predictors, which usually utilize black-box deep models with discrete features as input. Thus, how to efficiently construct realistic fake samples for black-box recommender systems is still full of challenges. In this article, we propose a hierarchical adversarial attack method against black-box CTR models via generating realistic fake samples, named CTRAttack. To better train the generation network, the weights of its embedding layer are shared with those of the substitute model, with both the similarity loss and classification loss used to update the generation network. To ensure that the discrete features of the generated fake samples are all real, we first adopt the similarity loss to ensure that the distribution of the generated perturbed samples is sufficiently close to the distribution of the real features, and then the nearest neighbor algorithm is used to retrieve the most appropriate features for non-existent discrete features from the candidate instance set. Extensive experiments demonstrate that CTRAttack can not only effectively attack the black-box recommender systems but also improve the robustness of these models while maintaining prediction accuracy. [ABSTRACT FROM AUTHOR]

This study introduces a novel movie recommender system utilizing a Semantic-Enhanced Variational Graph Autoencoder for Movie Recommendation (SeVGAER) architecture. The system harnesses additional information from movie plot summaries scraped from the internet, transformed into semantic vectors via a large language model. These vectors serve as supplementary features for movie nodes in the SeVGAER-based recommender. The system incorporates an encoder-decoder structure, operating on a user-movie bipartite graph, and employs GraphSAGE convolutional layers with modified aggregators as the encoder to extract latent representations of the nodes, and a Multi-Layer Perceptron (MLP) as the decoder to predict ratings with additional graph-based features. To address overfitting and improve model generalization, a novel training strategy is introduced. We employ a random data splitting approach, dividing the dataset into two halves for each training instance. The model then generates outputs on each half of the data, and a new loss function is introduced to ensure consistency between these two outputs, a strategy that can be seen as a form of contrastive learning. The model’s performance is optimized using a combination of this new contrastive loss, graph reconstruction loss, and KL divergence loss. Experiments conducted on the Movielens100k dataset demonstrate the effectiveness of this approach in enhancing movie recommendation performance. [ABSTRACT FROM AUTHOR]

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

Developing online educational platforms necessitates the incorporation of new intelligent procedures in order to improve long-term student experience. Presently, e-learning Recommender Systems rely on deep learning methods to recommend appropriate e-learning materials to the students based on their learner profiles. Fine-grained sentiment analysis (FSA) can be leveraged to enrich the recommender system. Users posted reviews and rating data are vital in accurately directing the student to the appropriate e-learning resources based on posted comments by comparable learners. Innovative has been made in this work to propose a new e-learning recommendation system based on individualization and FSA. A new framework is proposed based on collaborative filtering models (CFMs) integrating with fine-grained sentiment analysis (FSA) for hybrid recommendation (CFISAR) for effective recommendations. CFMs attempt to capture the learner's latent factors based on their selections of interest to build the learner profile. FSA models are introduced to deliver e-content with the highest ranked ratings related to the learner's area and interests based on the extracted learner model. Moreover, a new approach is proposed to update the system continuously and not keep it bound to certain items by adding new books, where the initial rating of these new books is predicted based on FSA models. CFISAR is explored utilizing six CFMs to generate the prediction matrix and derive the learner model, resulting in a low MSE of 0.699 for Asymmetric SVD. The system used multiplication word embeddings for stronger corpus representation that were trained on a dataset generated for an educational context, and leveraging the goodness of deep learning, which predicted an accuracy of 0.9264% for the Peephole algorithm, that performed better than other models. [ABSTRACT FROM AUTHOR]

The proliferation of uncategorized information on the Internet has intensified the need for effective recommender systems. Recommender systems have evolved from content-based filtering to collaborative filtering and, most recently, to deep learning-based and hybrid models. However, they often face challenges such as high computational costs, reduced reliability, and the Cold Start problem. We introduce a persona-based user modeling approach for real-time movie recommendations. Our system employs Non-negative Matrix Factorization (NMF) and Deep Learning algorithms to manage complex and sparse data types and to mitigate the Cold Start issue. Experimental results, based on criteria involving 50 topics and 35 personas, indicate a significant performance gain. Specifically, with 500 users, the precision@K for NMF was 86.01%, and for the Deep Neural Network (DNN), it was 92.67%. Tested with 900 users, the precision@K for NMF increased to 97.04%, and for DNN, it was 95.55%. These results represent an approximate 10% and 5% improvement in performance, respectively. The system not only delivers fast and accurate recommendations but also reduces computational overhead by updating the model only when user personas change. The generated user personas can be adapted for other recommendation services or large-scale data mining. [ABSTRACT FROM AUTHOR]

The cold start problem has always been a major challenge for recommender systems. It arises when the system lacks rating records for new users or items. Addressing the challenge of providing personalized recommendations in the cold start scenario is crucial. This research proposes a new hybrid recommender system named CoDFi-DL which combines demographic and enhanced collaborative filtering. The demographic filtering is performed through a deep neural network (DNN) and used to solve the new user cold start problem. The enhanced collaborative filtering component of our model focuses on delivering personalized recommendations through a neighborhood-based method. The major contribution in this research is the DNN-based demographic filtering which overcomes the new user cold start problem and enhances the collaborative filtering process. Our system significantly improves the relevancy of the recommendation task and thus provides personalized recommended items to cold users. To evaluate the effectiveness of our approach, we conducted experiments on real multi-label datasets, 1M and 100K MovieLens. CoDFi-DL recommender system showed higher performance in comparison with baseline methods, achieving lower RMSE rates of 0.5710 on the 1M MovieLens dataset and 0.6127 on the 100K MovieLens dataset. [ABSTRACT FROM AUTHOR]

A recommendation system (RS) can help overcome information overload issues by offering personalized predictions for users. Typically, RS considers the overall ratings of users on items to generate recommendations for them. However, users may consider several aspects when evaluating items. Hence, a multi-criteria RS considers n-aspects of items to generate more accurate recommendations than a single-criteria RS. This research paper proposes two deep encoder–decoder models based on shared learning for a multi-criteria RS, multi-modal deep encoder–decoder-based shared learning (MMEDSL) and multi-criteria deep encoder–decoder-based shared learning (MCEDSL). MMEDSL employs the shared learning technique by concentrating on the multi-modality concept in deep learning, while MCEDSL focuses on the training process to apply the shared learning technique. The shared learning captures useful shared information during the learning process since the multi-criteria may have hidden inter-relationships. A set of experiments were conducted to compare the proposed models with recent baseline approaches. The Yahoo! Movies multi-criteria dataset was utilized. The results demonstrate that the proposed models outperform other algorithms. In addition, the results show that integrating the shared learning technique with the RS produces precise recommendation predictions. [ABSTRACT FROM AUTHOR]

Graph collaborative filtering can efficiently find the hidden interests of users for recommender systems in recent years. This method can learn complex interactions between nodes in the graph, identify user preferences, and provide satisfactory recommendations. However, recommender systems face the challenge of data sparsity. To address this, recent studies have utilized contrastive learning to make use of unlabeled data structures. However, the existing positive and negative example sampling methods are not reasonable. Random-based or data augmentation-based sampling cannot make use of useful latent information. Clustering-based sampling methods ignore the semantics of node features and the relationship between global and local information. To utilize the latent structures in the data, we introduce a novel Community-Enhanced Contrastive Learning method to help the recommendation main task called CECL which uses a community detection algorithm to sample examples with semantic and global information, using both known and hidden community connections in the bipartite interaction graph. Extensive experiments are conducted on two well-known datasets, the results of which show a 12% and 8% performance improvement compared to that of the existing baseline methods. [ABSTRACT FROM AUTHOR]

Recommendation systems play a pivotal role in improving product competitiveness. Traditional recommendation models predominantly use centralized feature processing to operate, leading to issues such as excessive resource consumption and low real-time recommendation concurrency. This paper introduces a recommendation model founded on deep learning, incorporating edge computing and knowledge distillation to address these challenges. Recognizing the intricate relationship between the accuracy of deep learning algorithms and their complexity, our model employs knowledge distillation to compress deep learning. Teacher–student models were initially chosen and constructed in the cloud, focusing on developing structurally complex teacher models that incorporate passenger and production characteristics. The knowledge acquired from these models was then transferred to a student model, characterized by weaker learning capabilities and a simpler structure, facilitating the compression and acceleration of an intelligent ranking model. Following this, the student model underwent segmentation, and certain computational tasks were shifted to end devices, aligning with edge computing principles. This collaborative approach between the cloud and end devices enabled the realization of an intelligent ranking for product listings. Finally, a random selection of the passengers' travel records from the last five years was taken to test the accuracy and performance of the proposed model, as well as to validate the intelligent ranking of the remaining tickets. The results indicate that, on the one hand, an intelligent recommendation system based on knowledge distillation and edge computing successfully achieved the concurrency and timeliness of the existing remaining ticket queries. Simultaneously, it guaranteed a certain level of accuracy, and reduced computing resource and traffic load on the cloud, showcasing its potential applicability in highly concurrent recommendation service scenarios. [ABSTRACT FROM AUTHOR]

In recent generations of the digital world medical data in Recommender Systems. Health Care Recommender System (HCRS) analyses the medical data and then predicts the user's or patient's illness. Nowadays, healthcare data is used by various users or patients in recommendation systems which are useful for everyone. Analysing and predicting medical data provides awareness to users and these data predictions may be enriched using various techniques of RS. Machine learning techniques are used to make sure that health data is reliable and of high quality. In every RS the issues are targeted such as scalability, sparsity and cold start problems. In many social networking applications, these issues are resolved using ML algorithms. However, there is a significant gap between IT systems and medical diagnosis. The fuzzy genetic method is used in HCRS in order to bridge the gap between IT and healthcare applications. Through the use of the mutation and crossover operators, a real-value genetic method is used in this to compute similarity. With the user's extra personalized information, fuzzy rules are later generated for the database. The Hybrid fuzzy-genetic method, also known as this situation, combines both techniques to improve recommendation quality. Utilizing this method will improve the quality of the recommendation process by discovering the most precise similarity measures among different users. Six factors are subjected to fuzzification, including age, gender, employment, height, weight, and region. Genre-interesting measure weights are then used, including Very Light, Light, Average, Heavy, and Very Heavy. Finally, the evaluation metrics used MAE and RMSE to evaluate the recommendation accuracy which showed the best results in comparison with baseline approaches such as Convolutional Neural Networks and Restricted Boltzman Machine. [ABSTRACT FROM AUTHOR]

Recommender systems play a crucial role in personalizing online user experiences by creating user profiles based on user–item interactions and preferences. Knowledge graphs (KGs) are intricate data structures that encapsulate semantic information, expressing users and items in a meaningful way. Although recent deep learning-based recommendation algorithms that embed KGs have demonstrated impressive performance, the richness of semantics and explainability embedded in the KGs are often lost due to the opaque nature of vector representations in deep neural networks. To address this issue, we propose a novel user profiling method for recommender systems that can encapsulate user preferences while preserving the original semantics of the KGs, using frequent subgraph mining. Our approach involves creating user profile vectors from a set of frequent subgraphs that contain information about user preferences and the strength of those preferences, measured by frequency. Subsequently, we trained a deep neural network model to learn the relationship between users and items, thereby facilitating effective recommendations using the neural network's approximation ability. We evaluated our user profiling methodology on movie data and found that it demonstrated competitive performance, indicating that our approach can accurately represent user preferences while maintaining the semantics of the KGs. This work, therefore, presents a significant step towards creating more transparent and effective recommender systems that can be beneficial for a wide range of applications and readers interested in this field. [ABSTRACT FROM AUTHOR]

Latent factor-based methods have been extensively employed in recommender systems to project users and items to the same feature space and use the dot product for predicting unknown ratings. Nevertheless, the dot product method cannot describe the various influences of latent features. Also, it only captures the linear relations between users and items leading to a negative impact on the efficiency of recommender systems. Deep learning models are known as state-of-the-art techniques to deal with the non-linear relation between user and item. In this paper, we develop a new deep hybrid recommender system called DHSIRS using multilayer perceptron neural network to combine side information and interaction matrix for item recommendation. Specifically, two feature learning components are developed to extract side information-based and interaction-based latent features. Therefore, two paralleled deep neural networks are utilized in the side information-based feature learning part to obtain the feature vector for users and items from side information. Moreover, the interaction-based feature learning part obtains the latent features from the user-item matrix. Finally, we introduce a deep learning model instead of the dot product method to predict unknown ratings by integrating the side information-based and interaction-based latent features. Unlike other methods that use the dot product, our method is able to efficiently learn the high-order non-linear relations between users and items. Extensive experiments on three publicly available datasets demonstrate that DHSIRS averagely improves the recommendation performance by around 4.18% in comparison to the second-best model over different evaluation metrics. [ABSTRACT FROM AUTHOR]

This paper develops a cost-effective sequential route recommender system to provide real-time routing recommendations for vacant taxis searching for the next passenger. We propose a prediction-and-optimization framework to recommend the searching route that maximizes the expected profit of the next successful passenger pickup based on the dynamic taxi demand-supply distribution. Specifically, this system features a deep learning-based predictor that dynamically predicts the passenger pickup probability on a road segment and a recursive searching algorithm that recommends the optimal searching route. The predictor integrates a graph convolution network (GCN) to capture the spatial distribution and a long short-term memory (LSTM) to capture the temporal dynamics of taxi demand and supply. The GCN-LSTM model can accurately predict the pickup probability on a road segment with the consideration of potential taxi oversupply. Then, the dynamic distribution of pickup probability is fed into the route optimization algorithm to recommend the optimal searching routes sequentially as route inquiries emerge in the system. The recursion tree-based route optimization algorithm can significantly reduce the computational time and provide the optimal routes within seconds for real-time implementation. Finally, extensive experiments using Beijing Taxi GPS data demonstrate the effectiveness and efficiency of the proposed recommender system. History: Accepted by Ram Ramesh, Area Editor for Data Science and Machine Learning. Funding: This work was partially supported by the Hong Kong Research Grants Council [Grants CityU 21500220, CityU 11504322] and the National Natural Science Foundation of China [Grant 72201222]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0112) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2021.0112). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Faults recovery has recently emerged as an important aspect of web service composition (WSC) testing, as it aims to minimize the impact of faults on system functionality through restoring the system's operation after a fault has occurred. However, most of the existing recommendation systems (RSs) tend to recommend frequently used services, which lack diversity and face inaccuracies due to incomplete or biased historical data. In addition, the focus of the existing RSs is on proposing fault handling models rather than recommending the best recovery strategy for handling faults, with most being code-based, thus not suitable for WSCs. Accordingly, due to the opaque nature of WSCs with hidden source code, model-based recovery methods are preferred. In this paper, the Fault Recovery Strategies RS for WSCs (F2RS-WSC) is proposed to recommend the best recovery strategy for handling emerging faults in the WSCs paradigm. The proposed system is a model-based system that recommends the best strategy for recovering faulty paths generated from service dependency graphs (SDGs) based on the faults' types, severity levels, faults' location, as well as the time at which faults may occur. The experimental results show that the time consumed by F2RS-WSC to recommend the optimum recovery strategy represents less than 3% of the SDG parsing time and 4% of the path validation time. In addition, its superior performance assures its accuracy and efficiency. Thus, it achieves accuracy levels between 70% and 88 % among multiple datasets. Moreover, its average precision, recall and f-measure values are 0.85,0.81 and 0.86 respectively. [ABSTRACT FROM AUTHOR]

This paper proposes a recommendation system based on a hybrid learning approach for a personal deep sleep service, called the Customized Deep Sleep Recommender System (CDSRS). Sleep is one of the most important factors for human life in modern society. Optimal sleep contributes to increasing work efficiency and controlling overall well-being. Therefore, a sleep recommendation service is considered a necessary service for modern individuals. Accurate sleep analysis and data are required to provide such a personalized sleep service. However, given the variations in sleep patterns between individuals, there is currently no international standard for sleep. Additionally, service platforms face a cold start problem when dealing with new users. To address these challenges, this study utilizes K-means clustering analysis to define sleep patterns and employs a hybrid learning algorithm to evaluate recommendations by combining user-based and collaborative filtering methods. It also incorporates feedback top-N classification processing for user profile learning and recommendations. The behavior of the study model is as follows. Using personal information received through mobile devices and data, such as snoring, sleep time, movement, and noise collected through AI motion beds, we recommend sleep and receive user evaluations of recommended sleep. This assessment reconstructs the profile and, finally, makes recommendations using top-N classification. The experimental results were evaluated using two absolute error measurement methods: mean squared error (MSE) and mean absolute percentage error (MAPE). The research results regarding the hybrid learning methods show 13.2% fewer errors than collaborative filtering (CF) and 10.2% fewer errors than content-based filtering (CBF) on an MSE basis. According to the MAPE, the methods are 14.7% more accurate than the CF model and 9.2% better than the CBF model. These results demonstrate that CDSRS systems can provide more accurate recommendations and customized sleep services to users than CF, CBF, and combination models. As a result, CDSRS, a hybrid learning method, can better reflect a user's evaluation than traditional methods and can increase the accuracy of recommendations as the number of users increases. [ABSTRACT FROM AUTHOR]

Traditional recommender systems often face the filter bubble problem when they focus on recommending familiar items to users. The over-specialized recommended contents will make users bored. To solve this problem, researchers have proposed models that focus on unexpectedness, but these models all suffer from incomplete learning of features. To address this problem, we propose an unexpected interest recommender system with graph neural network (UIRS-GNN). First, we preprocess the input data with a graph convolutional network. It enriches user and item feature vectors by aggregating neighborhood information. Second, we transform the GRU and propose the attention-based long short-term gated recurrent unit network to learn user preferences hidden in historical behavior sequences. Then, we input the preprocessed feature vectors of users and items into the unexpected interest model, and solve the problem of insufficient feature information learning by aggregating neighborhood information. Furthermore, our model also alleviates data sparsity due to our deep learning feature information. Finally, empirical evaluations with several competitive baseline models on three real-world datasets reveal the superior performance of UIRS-GNN. [ABSTRACT FROM AUTHOR]

Recommendation systems serve as pivotal components in the agricultural domain, significantly contributing to global economic growth. One particular application, the recommendation of region-specific plant types, can mitigate losses in unfavorable conditions and optimize yields when growth conditions are ideal. However, accurately identifying the specific parameters of a field location and the diverse characteristics of plant types can pose a challenge. Deep learning has demonstrated efficacy as a predictive model within recommender systems, including those for plant type matching. However, building such models necessitates the identification of optimal solutions, taking into account the complexities of the problem scope and the unique characteristics of the domain. This paper introduces the development of a deep learning model architecture designed to recommend plant types best suited to specific regions. The model was constructed based on an extension of the Convolutional Neural Network (CNN), a deep learning model recognized for its robust pattern recognition capabilities, making it suitable for classification tasks. It has the ability to discern patterns from datasets with a limited number of input features, thus making it an ideal choice for a plant type recommendation system. The Adagrad optimizer was employed for its advantage of partitioning the learning rate into smaller units, which significantly impacts the speed of the training process. Evaluation of this model was undertaken in a two-step process. First, the learning model's performance was assessed using a confusion matrix. Subsequently, the model's functionality was evaluated using real data from a city in Indonesia, investigating its ability to provide relevant recommendations based on the city's unique contextual characteristics. The results demonstrated a substantial accuracy level of 90%, underscoring the model's potential to effectively recommend suitable plant types for specific regional contexts. [ABSTRACT FROM AUTHOR]

Online shopping is a form of electronic commerce that enables customers to purchase products directly from the seller over the internet using a web browser or a mobile application. With the growing number of research papers on Deep Learning (DL)-based recommendations, DL models have proven to be effective in Recommender systems. Hence in this paper, relevant product accessories recommendation is proposed using deep learning and histogram features. The proposed recommendation describes the novel way of content-based filtering which divides the work into two phases. In phase 1, the implemented approach determines the color and category of the product. In phase 2, the recommendation system retrieves the matching accessories for the chosen product. For phase 1, Decision Tree, Linear Regression, Logistic Regression, Naïve Bayes, Long Short-Term Memory (LSTM), and a novel method of Stack dense Recurrent Neural Network (RNN) along with the color histogram is applied to identify the category and color of the product. It is justified that the proposed technique of stack dense RNN achieves 98% accuracy. In phase 2, from the Machine Learning (ML) perspective, Random Forest (RF) is employed for the recommendation. The RF model finds the matching accessories for the chosen product and retrieves the top relevant items. [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]

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]

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]

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]

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]

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]

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]

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]

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]

Traditional methods have resulted in lower-quality search results with a lower accuracy rate. This problem is addressed and a recommended technique using deep learning methods is provided with the goal of improving prediction quality. Via this paper, a novel paradigm for pertinent product recommendations in social networks is provided. The major goal of this strategy is to let computers learn automatically without any assistance from humans, consequently controlling operations as needed. The social input data set in this proposed study is first pre-processed to remove noise. Following that, a Fisher discriminant method based on information is used for feature extraction. Then, using the Hierarchical Agglomerative and Attribute-based Clustering procedure, the features are chosen from the retrieved ones. Following that, such clusters are predicted using the stacked DenseNet121 method, and Attention-based MLP is used to propose the product. Finally, to verify the effectiveness of the suggested system, the expected output was evaluated, the performance measure was examined, and comparisons with conventional methods were made. Out of 2033 reviews, the suggested approach has a positive score percentage of 92.22%. The investigation demonstrates that the suggested system is more effective at providing improved results for pertinent product recommendations. [ABSTRACT FROM AUTHOR]

The emerging topic of sequential recommender (SR) has attracted increasing attention in recent years, which focuses on understanding and learning the sequential dependencies of user behaviors hidden in the user-item interactions. Previous methods focus on capturing the point-wise sequential dependencies with considering the time evenly spaced. However, in the real world, the time and semantic irregularities are hidden in the user's successive actions. Meanwhile, with the tremendous increase of users and items, the hardness of modeling user interests from spare explicit feedback. To this end, we seek to explore the influence of item-aspect reviews sequence with varied time intervals on sequential modeling. We present RTiSR, a review-driven time interval-aware sequential recommendation framework, to predict the user's next purchase item by jointly modeling the sequence dependencies from aspect-aware reviews. The main idea is twofold: (1) explicitly learning user and item representation from reviews by assigning different weights, and (2) leveraging a hybrid neural network to capture the collective sequence patterns with a flexible order from aspect-aware review sequences. We conduct extensive experiments on industrial datasets to evaluate the effectiveness of RTiSR. Experimental results demonstrate the superior performance of RTiSR in different evaluation metrics, compared to the state-of-the-art competitors. [ABSTRACT FROM AUTHOR]

Many deep learning-based recommender systems have been proposed recently. Where they involve all the users in datasets to build the latent representation of input data to be used later for predicting the missing rates. Despite the fact that, users have different interests, and these differences reduce the model prediction accuracy. This paper proposed a novel cluster-based denoising autoencoder model (cluster-based DAE) for rate prediction recommender systems. Instead of building a single model, it builds K models by using k-means algorithm to divide the users into groups based on their preferences. Each group trains a DAE model to generate recommendations for its members. The proposed method was trained and tested with MovieLens (100K, 1M, and 10M) datasets where 80% of the data are used for training and 20% for testing. The performance of the proposed method compared against other state-of-the-art methods that use deep learning to build rate prediction models. It outperformed the other compared methods in term of mean absolute error (with 12.9%, 14.7%, and 22.3%) and root mean squared error (with 24.2%, 18%, and 21.1%) using MovieLens 100K, 1M, and 10M datasets respectively. [ABSTRACT FROM AUTHOR]

Recommender system or recommendation system is becoming an increasingly important technology on e-commerce websites to help users find products that suit their preferences. However, the growing number of users and products makes finding the right product difficult. Therefore, this study aims to develop a recommender system on e-commerce websites using collaborative filtering and deep learning techniques. Collaborative filtering is used to find similarities between users based on their preferences, while deep learning is used to improve the performance of the recommender system in generating more accurate recommendations. The test method is carried out by comparing the performance of the recommender system developed with the recommender system that already exists on the e-commerce website. The results of the test show that the recommender system developed is able to provide recommendations that are more accurate and more in line with user preferences compared to the existing recommender system. [ABSTRACT FROM AUTHOR]

Recommender system can find information that satisfies the user′s individual needs from huge amount of information. With the development of deep learning, deep learning has been widely applied in recommender systems. CTR prediction plays an important role in recommender system and has been widely used in many fields such as personalized recommendation, information retrieval, online advertising and so on. For the issue of large and sparse data in recommender system, this study merges xDeepFM model with attention network, and proposes a new CTR prediction model based on deep learning, which is called Atte-xDeepFM model. This model can solve the issue of feature scarcity, effectively learn the interactions relationship between features, and does not need to manually extract useful information in feature engineering. The comparative experiments on Avazu and Criteo data sets prove the effectiveness of the proposed model. Compared with the algorithm model commonly used in CTR prediction, the proposed model has better recommendation effect. [ABSTRACT FROM AUTHOR]

While the recent emergence of a large number of online course resources has made life more convenient for many people, it has also caused information overload. According to a user's situation and behavior, course recommendation systems can recommend courses of interest to the user, so that the user can quickly sift through a massive amount of information to find courses that meet his or her needs. This paper provide a systematic review of deep learning-based recommendation systems in e-learning environments. Firstly, the concept of recommendation systems is introduced in e-learning environments, and present a comprehensive survey and classification of deep learning techniques for course recommendation. And then, a detailed analysis of existing recommendation system is conducted based on the collected literature, and an overall course recommendation system framework is presented. Subsequently, this artical main focus is on multilayer perceptual machines, recurrent neural networks, convolutional neural networks, neural attention mechanisms, and deep reinforcement learning-based recommendation, and summarize the existing research on the use of the five techniques mentioned above in e-learning environments. The last section discusses seven flaws in the current recommendation systems used in e-learning environments and identify opportunities for future research. [ABSTRACT FROM AUTHOR]

Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in the recommender systems. Recently, some deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. In these work, the attention mechanism is used to select the user interested items in historical behaviors, improving the performance of the CTR predictor. Normally, these attentive modules can be jointly trained with the base predictor by using gradient descents. In this paper, we regard user interest modeling as a feature selection problem, which we call user interest selection. For such a problem, we propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper. More specifically, we use a differentiable module as our wrapping operator and then recast its learning problem as a continuous bilevel optimization. Moreover, we use a meta-learning algorithm to solve the optimization and theoretically prove its convergence. Meanwhile, we also provide theoretical analysis to show that our proposed method 1) efficiencies the wrapper-based feature selection, and 2) achieves better resistance to overfitting. Finally, extensive experiments on three public datasets manifest the superiority of our method in boosting the performance of CTR prediction. [ABSTRACT FROM AUTHOR]

Collaborative filtering (CF) is a classical model for recommender systems. Though neural network-based CF models have been shown to perform well in some cases, they still suffer from the sparsity and cold-start issues. To address these issues, we propose a novel neural network-based CF model, termed the cross-domain explicit–implicit-mixed CF neural network (CEICFNet). The proposed model utilizes deep neural networks to learn latent factors not only from the explicit ratings and the implicit interactions but also in a cross-domain manner. In particular, domain-shared multilayer perception (MLP) networks are designed to learn the user rating latent factors and the user interaction latent factors from the explicit ratings and the implicit interactions, respectively, which act as bridges for transferring knowledge across domains. On the other hand, domain-specific MLP networks are designed to learn the item rating latent factors and the item interaction latent factors from the explicit ratings and the implicit interactions, respectively. Then, in each domain, based on the user rating latent factors and the item rating latent factors, the rating predictive representation for each user–item pair can be learned by an MLP. Similarly, the interaction predictive representation for each user–item pair can be learned. For integrating the explicit ratings and the implicit interactions, in each domain, a fully connected layer is used to automatically assign different weights to the rating predictive representations and the interaction predictive representations, based on which the final interaction probability can be generated. Extensive experiments are conducted on five datasets and the results have confirmed the effectiveness of our model. [ABSTRACT FROM AUTHOR]

The explosive growth of e-commerce and online service has led to the development of recommender system. Aiming to provide a list of items to meet a user's personalized need by analyzing his/her interaction1 history, recommender system has been widely studied in academic and industrial communities. Different from conventional recommender systems, sequential recommender systems attempt to capture the pattern of users' sequential behaviors and the evolution of users' preferences.Most of the existing sequential recommendation models only focus on user interaction sequence, but neglect item interaction sequence. An item interaction sequence also contains rich contextual information for capturing the item's dynamic characteristic, since an item's dynamic characteristic can be reflected by the users who interact with it in a period. Furthermore, existing dual sequential models use the same method to handle the user interaction sequence and item interaction sequence, and do not consider their different characteristics. Hence, we propose a novel Double Attention Convolution Neural Network (DACNN), which incorporates user interaction sequence and item interaction sequence into an integrated neural network framework. DACNN leverages the strength of attentionmechanism to capture the temporary suitability and adopts CNN to extract local sequential features. Experimental evaluations on the real datasets show that DACNN outperforms the baseline approaches. [ABSTRACT FROM AUTHOR]

Copyright of Ordnance Industry Automation is the property of Editorial Board for Ordnance Industry Automation and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the advancement of the internet, individuals are becoming more reliant on online applications to meet most of their needs. In the meantime, they have very little spare time to devote to the selection and decision-making process. As a result, the need for recommender systems to help tackle this problem is expanding. Recommender systems successfully provide consumers with individualized recommendations on a variety of goods, simplifying their duties. The goal of this research is to create a recommender system for farmers based on tree data structures. Recommender system has become interesting research by simplifying and saving time in the decision-making process of users. We conducted although a lot of research in various fields, there are insufficient in the agriculture sector. This issue is more necessary for farmers in Quangnam-Danang or all Vietnam countries by severe climate features. Storm from that, this research designs a system based on tree data structures. The proposed model combines the you only look once (YOLO) algorithm in a convolutional neural network (CNN) model with a similarity tree in computing similarity. By experiments on 400 samples and evaluating precision, accuracy, and the value of the predictive test as determined by its positive predictive value (PPV), the research proves that the proposed model is feasible and gain better results compared with other state-of-the-art models. [ABSTRACT FROM AUTHOR]

Graph convolutional network (GCN)-based recommendation has recently attracted significant attention in the recommender system community. Although current studies propose various GCNs to improve recommendation performance, existing methods suffer from two main limitations. First, user-item interaction data is generally sparse in practice, highlighting these methods' ineffectiveness in learning user and item feature representations. Second, they usually perform a dot-product operation to model and calculate user preferences on items, leading to inaccurate user preference learning. To address these limitations, this study adopts a design idea that sharply differs from existing works. Specifically, we introduce the knowledge distillation concept into GCN-based recommendation and propose a two-phase knowledge distillation model (TKDM) improving recommendation performance. In Phase I, a self-distillation method on a graph auto-encoder learns the user and item feature representations. This auto-encoder employs a simple twolayer GCN as an encoder and a fully connected layer as a decoder. On this basis, in Phase II, a mutual-distillation method on a fully connected layer is introduced to learn user preferences on items with triple-based Bayesian personalized ranking. Extensive experiments on three realworld data sets demonstrate that TKDM outperforms classic and state-of-the-art methods related to GCN-based recommendation problems. [ABSTRACT FROM AUTHOR]

An effective E-Learning system must identify learning content appropriate for the needs of the specific learner from among the many sources of learning content available. The learning content can consist of different types of media content namely Text, Video and Image and to determine a rating. Recommendation systems become increasingly used in information systems and especially in e-learning platform. These systems are used to propose and recommend content of these platforms to users according to needs of the later in order to allow them to have the maximum information for learning. In this paper, a recommendation system based on data mining and deep learning has been proposed to help the learner by recommending the appropriate learning content. To improve the recommendations a content matrix is created and based on this, the logistic regression and deep learning methods could classify recommendations. Experimental results show that the precision, recall and f measure for Top 5 & 10 Recommendations using Deep Neural Network performsby 1.439% better than Top 5 & 10 Recommendations using Logistic Regression among Chi Squared, SA, PSO and ICA methods. [ABSTRACT FROM AUTHOR]

E-commerce is essential application in world wide. In everyday live, we cannot escape from e-commerce transaction. E-commerce requires intelligent machine to deliver product information to customer. Intelligent machine popular called recommender system developed by matrix factorization. Rating is representation of customer expression for satisfied product or service. Unfortunately, number of ratings is too sparse due to majority customer lazy to give rating for e-commerce product. Number of sparse rating matrix have impact in matrix factorization in rating prediction. Moreover, extreme sparse rating has impact degrade performance significantly. Many researchers consider to enhance matrix factorization using customer and product information such as customer demographics information, customer testimony, product review, product description, and etc. In this research, we consider to incorporating Stack Denoising Auto Encoder (SDAE), attention mechanism aims to enhance product review document understanding representation and matrix factorization based on Probabilistic Matric Factorization (PMF) to produce rating prediction. According to experiment report, our model superior over previous work based on hybrid model between PMF, Convolutional Neural Network (CNN) and SDAE that popular called PHD in 1%, and superior over hybrid model between PMF, Long Short Term Memory (LSTM) and SDAE that popular called DDL-PMF in 0.9%, and achieved significantly in 8% over traditional PMF based on RMSE evaluation metrics. [ABSTRACT FROM AUTHOR]

In collaborative filtering recommendations, a good local minimum depends largely on the initialization of the latent feature vectors of users and items. However, many existing methods initialize them by random initialization or zero ones, which results in recommendation performance degradation. In addition, they also ignore the role of users' trust and items' information in obtaining reliable recommendations. Aiming at addressing these challenges, this paper proposes a deep learning-based initialization recommendation method for trust-aware recommendation, named DLIR. In DLIR framework, we first leverage deep learning to learn a better latent feature vector of users and items and then take it as the initial value of the latent factor model (LFM) recommendations. Next, the users' trust information and items' information are employed to construct users' social trust ensemble and the items' intrinsic feature relationship, respectively. Finally, the constructed information is integrated into LFM for trust-aware recommendation. To verify the effectiveness of the proposed DLIR, the extensive experiments conducted on two real datasets (e.g., Epinions and Last.fm) show that the proposed approach performs much better than state-of-the-art recommendation algorithms on recommendation accuracy. [ABSTRACT FROM AUTHOR]

Representation learning has attracted growing attention in recommendation system. In addition, deep learning has been adopted to build a representation generator based on content data (e.g., reviews, descriptions), and has been verified to be an excellent method for recommendation system. However, the content data may not be sufficient to capture the hidden features of user behavior patterns. We argue that the underlying information in behavior patterns can characterize users, by generating specific representation from user activities. In this paper, we propose a deep transfer learning-based recommendation model (DeepTransferR), which conducts knowledge transfer from multiple user activities. We adopt attention network to migrate the behavior pattern from auxiliary activities, and to generate personalized representations for users. In DeepTransferR, we set up an independent predictor for each user activity. We then define a weighted loss function to model knowledge interaction by incorporating the independent loss in each activity predictor. Experiments have been conducted on real-world datasets, and the results show that the proposed model outperforms the state-of-the-art methods in not only recommendation performance, but also convergence and robustness in sparse-data and cold-start environments. [ABSTRACT FROM AUTHOR]

Recommendation efficiency and data sparsity problems have been regarded as two challenges of improving performance for online recommendation. Most of the previous related work focus on improving recommendation accuracy instead of efficiency. In this paper, we propose a Deep Pairwise Hashing (DPH) to map users and items to binary vectors in Hamming space, where a user's preference for an item can be efficiently calculated by Hamming distance, which significantly improves the efficiency of online recommendation. To alleviate data sparsity and cold-start problems, the user-item interactive information and item content information are unified to learn effective representations of items and users. Specifically, we first pre-train robust item representation from item content data by a Denoising Auto-encoder instead of other deterministic deep learning frameworks; then we finetune the entire framework by adding a pairwise loss objective with discrete constraints; moreover, DPH aims to minimize a pairwise ranking loss that is consistent with the ultimate goal of recommendation. Finally, we adopt the alternating optimization method to optimize the proposed model with discrete constraints. Extensive experiments on three different datasets show that DPH can significantly advance the state-of-the-art frameworks regarding data sparsity and item cold-start recommendation. [ABSTRACT FROM AUTHOR]