Search

This paper proposes an explainable recommendation algorithm based on deep learning for developing a transparent and explainable recommendation system. The proposed algorithm combines a multi-feature fusion model for text sentiment analysis and the innovative DeepxDeepFM recommendation model to provide accurate and interpretable recommendations. First, Bi-LSTM and MCNN are employed to extract multi-dimensional features from comment data. Then, the DeepxDeepFM recommendation model is used explicitly for comment data with numerous feature vectors and significant linear changes. Finally, experimental results demonstrate that our proposed explainable recommendation algorithm increases the accuracy by 1.57% and decreases the root mean square error by 2.69%, contributing to higher model performance. Compared to other models, the improved interpretable recommendation model is smaller in size and more accurate, so it can maximize the click-through rate of e-commerce recommendation systems, which is crucial for achieving precise recommendations in the field of e-commerce. [ABSTRACT FROM AUTHOR]

In order to enhance the performance of recommendation systems that support attack detection algorithms, we have designed a novel approach based on deep learning. Specifically, our algorithm focuses on improving convergence, user scoring accuracy, algorithm efficiency, and detection accuracy. To achieve this, we first construct a preliminary user rating matrix, which is optimised by incorporating the user preference word matrix and the weight of the preference word. Additionally, we adjust the size of the matrix using principal component analysis. Next, we construct a deep, bidirectional RNN model based on the deep learning network. This model is then combined with the user scoring matrix to identify the type of user. In the case of abnormal or false users, our algorithm is able to identify the recommendation system's support attack through the detection results. The experimental results demonstrate the effectiveness of our algorithm. Specifically, our approach achieves fast convergence speeds, with the loss value remaining low throughout the process. Moreover, we achieve high average accuracy in user scoring, with a score of 97.14%. The detection time of the recommendation system support attack is also consistently lower than 0.7 s. Furthermore, our approach achieves an average accuracy of 98.09% in the detection of recommendation system support attacks. Overall, our algorithm shows promising results for practical applications in the field of recommendation systems. [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]

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]

In recommender systems, top-N recommendation is an important task with implicit feedback data. Although the recent success of deep learning largely pushes forward the research on top-N recommendation, there are increasing concerns on appropriate evaluation of recommendation algorithms. It therefore is important to study how recommendation algorithms can be reliably evaluated and thoroughly verified. This work presents a large-scale, systematic study on six important factors from three aspects for evaluating recommender systems. We carefully select 12 top-N recommendation algorithms and eight recommendation datasets. Our experiments are carefully designed and extensively conducted with these algorithms and datasets. In particular, all the experiments in our work are implemented based on an open sourced recommendation library, Recbole [139], which ensures the reproducibility and reliability of our results. Based on the large-scale experiments and detailed analysis, we derive several key findings on the experimental settings for evaluating recommender systems. Our findings show that some settings can lead to substantial or significant differences in performance ranking of the compared algorithms. In response to recent evaluation concerns, we also provide several suggested settings that are specially important for performance comparison. [ABSTRACT FROM AUTHOR]

The target review has been proven to be able to predict the target user's rating of the target item. However, in practice, it is difficult to obtain the target review promptly. In addition, the target review and the rating may sometimes be inconsistent (such as preference reviews and low ratings). There is currently a lack of research on the above issues. Therefore, this paper proposed a Recommendation algorithm that Simulates the generation of target review semantics and fuses the ID Information (RSII). Specifically, based on the characteristics of the target review available during the model training, this paper designed a teacher module and a review semantics learning module. The teacher module learned the semantics of the target review and guided the review semantics learning model to learn these semantics. Then, this study used the fusion module to dynamically fuse the target review semantics and the ID information, enriching the representation of predictive features, thereby, alleviating the problem of inconsistency between the target review and the rating. Finally, the RSII model was extensively tested on three public datasets. The results showed that compared with seven of the latest and most advanced models, the RSII model improved the MSE metric by 8.81% and the MAE metric by 10.29%. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. 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.)

In recent years, hybrid recommendation techniques based on feature fusion have gained extensive attention in the field of list ranking. Most of them fuse linear and nonlinear models to simultaneously learn the linear and nonlinear features of entities and jointly fit user-item interactions. These methods are based on implicit feedback, which can reduce the difficulty of data collection and the time of data preprocessing, but will lead to the lack of entity interaction depth information due to the lack of user satisfaction. This is equivalent to artificially reducing the entity interaction features, limiting the overall performance of the model. To address this problem, we propose a two-stage recommendation model named A-DNR, short for Attention-based Deep Neural Ranking. In the first stage, user short-term preferences are modeled through an attention mechanism network. Then the user short-term preferences and user long-term preferences are fused into dynamic user preferences. In the second stage, the high-order and low-order feature interactions are modeled by a matrix factorization (MF) model and a multi-layer perceptron (MLP) model, respectively. Then, the features are fused through a fully connected layer, and the vectors are mapped to scores. Finally, a ranking list is output through the scores. Experiments on three real-world datasets (Movielens100K, Movielens1M and Yahoo Movies) show that our proposed model achieves significant improvements compared to existing methods. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. 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.)

Cold Start problems in recommender systems pose various challenges in the adoption and use of recommender systems, especially for new item uptake and new user engagement. This restricts organizations to realize the business value of recommender systems as they have to incur marketing and operations costs to engage new users and promote new items. Owing to this, several studies have been done by recommender systems researchers to address the cold start problems. However, there has been very limited recent research done on collating these approaches and algorithms. To address this gap, the paper conducts a systematic literature review of various strategies and approaches proposed by researchers in the last decade, from January 2010 to December 2021, and synthesizes the same into two categories: data-driven strategies and approach-driven strategies. Furthermore, the approach-driven strategies are categorized into five main clusters based on deep learning, matrix factorization, hybrid approaches, or other novel approaches in collaborative filtering and content-based algorithms. The scope of this study is limited to a systematic literature review and it does not include an experimental study to benchmark and recommend the best approaches and their context of use in cold start scenarios. [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.)

Simultaneous localization and mapping (SLAM) is a core technology for mobile robots working in unknown environments. Most existing SLAM techniques can achieve good localization accuracy in static scenes, as they are designed based on the assumption that unknown scenes are rigid. However, real-world environments are dynamic, resulting in poor performance of SLAM algorithms. Thus, to optimize the performance of SLAM techniques, we propose a new parallel processing system, named SOLO-SLAM, based on the existing ORB-SLAM3 algorithm. By improving the semantic threads and designing a new dynamic point filtering strategy, SOLO-SLAM completes the tasks of semantic and SLAM threads in parallel, thereby effectively improving the real-time performance of SLAM systems. Additionally, we further enhance the filtering effect for dynamic points using a combination of regional dynamic degree and geometric constraints. The designed system adds a new semantic constraint based on semantic attributes of map points, which solves, to some extent, the problem of fewer optimization constraints caused by dynamic information filtering. Using the publicly available TUM dataset, SOLO-SLAM is compared with other state-of-the-art schemes. Our algorithm outperforms ORB-SLAM3 in accuracy (maximum improvement is 97.16%) and achieves better results than Dyna-SLAM with respect to time efficiency (maximum improvement is 90.07%). [ABSTRACT FROM AUTHOR]

Recommender systems use different techniques of machine learning (ML) to suggest users and recommend service or entity in various field of application such as in health care recommender system (HRS). Due to the vast count of algorithms shown in the literature, HRS and various application sectors are now utilizing ML algorithms from the area of artificial intelligence. However, selecting an appropriate ML algorithm in the case of a health recommender system seems to be a time-consuming task. However the development of recommender system in different service domain faces problems of algorithms selection for better accuracy. This article examined the usage of ML techniques in recommender systems for health applications through a survey of the literature. The objectives of this article are (i) recognize the literature review finding of recommender system in health applications using ML and deep learning algorithms. (ii) Assist new researchers with the help of gap in previous research. The results of this study is to proposed new recommender system in health application of mosquito borne disease by using hybrid approach of ML technique. [ABSTRACT FROM AUTHOR]

Most clothing recommendation methods have problems such as high resource consumption and inconsistent subjectively labeled clothing labels. Based on this, a multilabel classification algorithm based on deep learning (DL) theory is introduced, based on which the clothing style recognition model is constructed. Next, the concept of the decision tree algorithm is given, and the clothing recommendation model is built based on this algorithm. Moreover, the clothing style recognition model based on a multilabel classification algorithm and the clothing recommendation system based on a decision tree algorithm are tested by building simulation experiments and combining neural network technology. Finally, the application of the decision tree algorithm and DL theory in clothing recommendation design is studied through the literature collection method. The research focus is to realize the recognition of clothing through decision tree algorithm and DL method to achieve the intelligent recommendation of clothing style. The results show that: (1) the neural network technology in DL theory can realize efficient recognition and classification of clothing style by automatically extracting image features and combining with a multilabel classification algorithm. (2) The decision tree algorithm can make an initial recommendation according to users' style preferences, then make implicit recommendations through user retrieval, browsing, and other operations, and make dynamic clothing style recommendations to users. (3) When the neural network based on a multilabel classification algorithm is trained, the precision, recall rate, and F1 values are 0.73, 0.43, and 0.55, respectively. (4) After using the clothing recommendation system based on the decision tree algorithm, the subjects' average satisfaction is 86.25%, indicating that this system can give users a better clothing recommendation experience. This exploration aims to provide a crucial reference for further improving the quality of clothing recommendation services. It has important theoretical significance and practical value for the development of artificial intelligence in the field of fashion design, and is expected to provide a reference for the development of bionics. [ABSTRACT FROM AUTHOR]

The recommendation of items based on the sequential past users' preferences has evolved in the last few years, mostly due to deep learning approaches, such as BERT4Rec. However, in scientific fields, recommender systems for recommending the next best item are not widely used. The main goal of this work is to improve the results for the recommendation of the next best item in scientific domains using sequence aware datasets and algorithms. In the first part of this work, we present the adaptation of a previous method (LIBRETTI) for creating sequential recommendation datasets for scientific fields. The results were assessed in Astronomy and Chemistry. In the second part of this work, we propose a new approach to improve the datasets, not the algorithms, to obtain better recommendations. The new hybrid approach is called sequential enrichment (SeEn), which consists of adding to a sequence of items the n most similar items after each original item. The results show that the enriched sequences obtained better results than the original ones. The Chemistry dataset improved by approximately seven percentage points and the Astronomy dataset by 16 percentage points for Hit Ratio and Normalized Discounted Cumulative Gain. [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]

Text classification is a technique that automatically classifies and labels text according to certain rules, and is widely used in sentiment analysis, intelligent recommendation systems and intelligent question and answer systems. Deep learning-based text classification methods can automatically identify and extract features in text that are useful for classification, so that it can analyse the text content directly, saving a lot of labour costs required for manual feature extraction. In this paper, the TF-IDF algorithm and the input structure of bidirectional LSTM was modified. Specifically, we rewrote the TF-IDF formula and processed the texts with a sliding window. The word2vec vector was used as the word embedding layer, and the text features were extracted using a combination of bidirectional LSTM and Text-CNN for classification prediction. Bidirectional LSTM treats texts as sequences to grasp information as a whole, while Text-CNN can extract local important features at the sentence level. As a result, good accuracy was achieved. [ABSTRACT FROM AUTHOR]

Accurate recommendation of tourist attractions is conducive to improving users' travel efficiency and tourism experience. However, the choice of tourism feature factors and the difference of recommendation algorithm will affect the accuracy of scenic spot recommendation. Aiming at the problems of sparse data, insufficient tourism factors, and low recommendation accuracy in the existing tourism recommendation research, this paper puts forward a scenic spot recommendation method based on microblog data and machine learning by using the characteristics of personalized expression and strong current situation of microblog data and the intelligent prediction function of machine learning, so as to realize accurate and personalized scenic spot recommendation. This paper extracts rich tourism characteristic factors. Typical tourism recommendation algorithms choose tourism characteristic factors from scenic spots, tourists, and other aspects, without considering the travel time, tourism season, and other contextual information of tourists' destination, which can help understand users' tourism preferences from different angles. Aiming at the problem of sparse data and cold start of collaborative filtering recommendation algorithm, this paper introduces deep learning algorithm and combines the proposed multifeature tourism factors to build dynamic scenic spot prediction models (random forest preferred attraction prediction (RFPAP) and neural networks preferred attraction prediction (NNPAP)). The experimental results show that RFPAP and NNPAP methods can overcome the problem of data sparsity and achieve 89.61% and 89.51% accuracy, respectively. RFPAP method is better than NNPAP method and has stronger generalization ability. [ABSTRACT FROM AUTHOR]

Collaborative Filtering remains the most widely used recommendation algorithm due to its simplicity and effectiveness. However, most studies addressing the trade-off between accuracy and diversity in collaborative filtering recommendation algorithms focus solely on optimizing the recommendation list, often neglecting users’ diverse demands for recommendation results. We propose a new user-based Two-Stage collaborative filtering method for Neighborhood Selection (TSNS) that considers both the similarity between users and the dissimilarity between neighbors in the neighborhood selection phase. Firstly, we define the user’s preference value for the attributes of evaluated items and determine the range and ranking of user preferences. Then, we construct a preference heterogeneity model to evaluate preference differences among users and obtain a preference heterogeneity matrix based on the range and ranking of preferences. Finally, to effectively ensure recommendation accuracy and diversity, we adopt a two-stage neighborhood selection method to identify a group of neighbors that are internally dissimilar but similar to target users. Deep representation learning methods can also be incorporated into this framework to calculate user similarity in the first stage. Experimental results on two datasets show that our proposed method outperforms the benchmark method, including those using deep learning, in terms of comprehensive performance. Our approach offers new insights into improving the accuracy and diversity of personalized recommendations. [ABSTRACT FROM AUTHOR]

On the basis of the analysis of the evolution dynamics and the process of smart tourism service, this paper constructs the evolutionary game model of smart tourism service and reveals the evolution mechanism of smart tourism service based on the network platform. Based on the strategic main line of "advantages," it proposes the design ideas and overall framework of the smart tourism service model based on the network platform, including the smart tourism information interactive service model, the element collaborative service model, and the value cocreation service model. The comparison of recommendation results shows that the recommendation error of the genetically improved generalized regression neural network algorithm is reduced, and the recommendation accuracy is better than that of the unimproved generalized regression neural network algorithm. In the recommendation scenario of click-through rate recommendation, the existing recommendation models are difficult to meet the functions of memory and generalization at the same time and cannot fully mine and combine low-level features, and the model parameters of the deep learning model are difficult to learn under the high-dimensional sparse data set of the recommendation system. To solve the problem of generalization, this paper proposes a deep CTR recommendation model based on the gradient boosting tree and factorization machine. It can fully mine low-level feature information and automatically realize low-level feature combination, which can better learn model parameters on high-dimensional sparse data sets, and the recommendation results are no longer overgeneralized. In this paper, simulation experiments are carried out on the data set, and the related recommendation models are compared. The experimental results show that the model proposed in this paper achieves better results in both the AUC (area under ROC curve) evaluation index and the cross-entropy evaluation index. [ABSTRACT FROM AUTHOR]

E-commerce platforms apply recommendation technology to a wide variety of commercial websites to help users quickly find the product they need from a large number of products. At present, recommendation systems have been widely used in large-scale e-commerce websites, and most e-commerce shopping websites attract customers through the image information of goods. In this paper, the research status of content-based image retrieval algorithms is analysed, and how to use image content information to recommend goods is studied. A hierarchical commodity classification and retrieval system are designed. A class decision layer is used to determine the category of commodity images and then precisely retrieve the corresponding category of commodity image features. The corresponding relationship between different commodity visual features is used to recommend commodities, and a matching recommendation algorithm for commodities is proposed. Experiments show that the proposed image content-based recommendation method can coordinate with features, and its recommendation results have high accuracy in practical applications. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. 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.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. 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.)

Recommendations are long chains followed from traditional life to today's life. In everyday life, the chain of recommendation augments the social process via some physical media and digital applications. The issues and challenges of recommendation are still in the infancy due to the growth of technology. This article identifies the uncovered areas of concern and links them to novel solutions. We also provide an extensive literature with different dimension for the newbie to work with the subject. We observed the study with different taxonomy provided by the prevalent researcher of the recommender system. This article gives the remedial solution of the recommendation problems [ABSTRACT FROM AUTHOR]

The recommendation algorithm based on graph neural network can extract the association relationship between users and goods. Traditional methods can’t extract this relationship. At present, most of these algorithms ignore the general prefe-rences in the review data of users and products. In order to solve this problem, this paper proposed a new method. This me-thod used the graph neural network to extract association relations, and the advantage of deep learning to extract the general preferences, and carried out feature fusion to improve the recommendation effect. This paper conducted comparative experiments and ablation experiments on four sets of public data sets to verify the effectiveness of the proposed method. The evaluation indexes include the recall rate and normalized discounted cumulative gain. Experiments show that this method is more effective than the existing algorithms. The feature fusion of the two networks can improve the recommendation effect. [ABSTRACT FROM AUTHOR]

The sharing of English teaching resources has always been a concern. In order to further improve the value of different English teaching resources, this paper proposes a resource management system based on an improved collaborative recommendation algorithm. The proposed model can predict user behavior based on deep learning models of graph neural network (GNN) and recurrent neural network (RNN). The graph neural network can capture the hidden state of local user behavior and be used as a preprocessing step. Recurrent neural networks can capture time series information. Therefore, the model is constructed by combining GNN and RNN to obtain the advantages of both. In order to prove the effectiveness of the model, we used CNGrid's real user behavior dataset in the experiment and finally compared the results with other methods. The different deep learning-based models achieved a precision of up to 88% and outperformed other traditional models. The experimental results show that this new deep learning model has good sharing value. [ABSTRACT FROM AUTHOR]

Recommendation systems are obtaining more attention in various application fields especially e-commerce, social networks and tourism etc. The top items are recommended based on the ability of recommender system which predict the future preference out of the available items. Because of the internet, the people in the current society has too many options that's why the recommendation system is very essential. The recommendation is achieved by the particular users who predict the ratings for numerous items and recommend those items to other users. Majorly, content and collaborative filtering techniques are employed in typical recommendation systems to find user preferences and provide final recommendations. But, these systems commonly lacks to take growing user preferences in various contextual factors. Context aware recommendation systems consider various contextual parameters into account and attempt to catch user preferences appropriately. The majority of the work in the recommender system domain focuses on increasing the recommendation accuracy by employing several proposed approaches where the main motive remains to maximize the accuracy of recommendations while ignoring other design objectives, such as a user's an item's context. Therefore, in this paper an effective deep learning based context aware recommendation model is proposed which can be act as an efficient recommender system by showing minimum error during recommendation. Initially, the dataset is pre-processed using Natural Language Tool Kit (NLTK) in Python platform. After pre-processing, the TF–IDF and word embedding model is used for every pre-processed reviews to extract the features and contextual information. The extracted feature is considered as an input of density based clustering to group the negative, neutral and positive sentiments of user reviews. Finally, deep recurrent neural Network (DRNN) is employed to get the most preferable user from every cluster. The recurrent neural network model parameter values are initialized through the fitness computation of Bald Eagle Search (BES) algorithm. The proposed model is implemented using NYC Restaurant Rich Dataset using Python programming platform and performance is evaluated based on the metrics of accuracy, precision, recall and compared with existing models. The proposed recommendation model achieves 99.6% accuracy which is comparatively higher than other machine learning models. [ABSTRACT FROM AUTHOR]

In recent years, as deep learning has achieved good results in many fields, deep learning has also begun to be applied to recommendation systems, such as NFM models and DeepFM models that use deep learning technology to capture high-level feature interactions. However, considering the changes in the external environment and internal perception, the user' s interest should also change dynamically over time, and the combination based on the original features may not necessarily learn effective feature interaction. This paper attempted to build a new model FG_DRFwFm, which could learn the interaction of low-level and high-level features of multiple feature domains and dealt with long-term changes in user interest. It constructed the training features by constructing new features based on the original features and splicing them together, which could better learn effective feature interaction. Finally, the proposed model compared the recommendation effect with multiple advanced CTR algorithms on the MovieLens data set. The experimental results show that the proposed model achieves better results. [ABSTRACT FROM AUTHOR]

Recommender systems have become a popular and effective means to manage the ever-increasing amount of multimedia content available today and to help users discover interesting new items. Today's recommender systems suggest items of various media types, including audio, text, visual (images), and videos. In fact, scientific research related to the analysis of multimedia content has made possible effective content-based recommender systems capable of suggesting items based on an analysis of the features extracted from the item itself. The aim of this survey is to present a thorough review of the state-of-the-art of recommender systems that leverage multimedia content, by classifying the reviewed papers with respect to their media type, the techniques employed to extract and represent their content features, and the recommendation algorithm. Moreover, for each media type, we discuss various domains in which multimedia content plays a key role in human decision-making and is therefore considered in the recommendation process. Examples of the identi- fied domains include fashion, tourism, food, media streaming, and e-commerce. [ABSTRACT FROM AUTHOR]

Deep learning has profoundly impacted many areas of machine learning. However, it took a while for its impact to be felt in the field of recommender systems. In this article, we outline some of the challenges encountered and lessons learned in using deep learning for recommender systems at Netflix. We first provide an overview of the various recommendation tasks on the Netflix service. We found that different model architectures excel at different tasks. Even though many deep-learning models can be understood as extensions of existing (simple) recommendation algorithms, we initially did not observe significant improvements in performance over well-tuned non-deep-learning approaches. Only when we added numerous features of heterogeneous types to the input data, deep-learning models did start to shine in our setting. We also observed that deep-learning methods can exacerbate the problem of offline-online metric (mis-)alignment. After addressing these challenges, deep learning has ultimately resulted in large improvements to our recommendations as measured by both offline and online metrics. On the practical side, integrating deep-learning toolboxes in our system has made it faster and easier to implement and experiment with both deeplearning and non-deep-learning approaches for various recommendation tasks. We conclude this article by summarizing our take-aways that may generalize to other applications beyond Netflix. [ABSTRACT FROM AUTHOR]

Artificial intelligence education (AIEd) is defined in the field of education as the utilization of artificial intelligence. There are currently many AIEd‐driven applications in schools and universities. This paper applies an artificial intelligence module combined with the knowledge recommendation to the system and develops an online English teaching system in comparison with the common teaching auxiliary system. The method of English teaching is useful in investigating the potential internal connections between evaluation outcomes and various factors. This article develops deep learning‐assisted online intelligent English teaching system that utilizes to create a modern tool platform to help students improve their English language teaching efficiency in line with their mastery of knowledge and personality. The decision tree algorithm and neural networks have been used and to generate an English teaching assessment implementation model based on decision tree technologies. It provides valuable data from extensive information, summarizes rules and data, and helps teachers to improve their education and the English scores of students. This system reflects the thinking of the artificial intelligence expert system. Test application demonstrates that the system can help students improve their learning efficiency and will make learning content more relevant. Besides, the system provides an example model with similar methods and has a referential definition. [ABSTRACT FROM AUTHOR]

Deep learning-based recommender systems have gained much attention due to the advantage of encoding content-based information, such as user textual reviews and item descriptions, images, or videos, without the trouble of manually crafting feature vectors. However, those systems are trained from scratch with randomly initialized parameters, where the training process can take a long time to converge. With the most recent breakthroughs in Natural Language Processing using transfer learning, pre-trained transformer-based models now provide a better foundation for textual information encoding. This inspires us to propose a transformer-based recommender system using transfer learning. As the first core contribution in this work, we apply transfer learning to the system, by fine-tuning the pre-trained transformer models for information encoding. The experiment result shows that the proposed system outperforms several other deep learning-based recommender systems on multiple datasets. As the second core contribution, we propose a novel user vector encoding algorithm that assists all the models to achieve a better performance, when the user content information is not available. [ABSTRACT FROM AUTHOR]

Deep matrix factorization adopts deep nonlinear mapping to break through the bottleneck of bilinear relationship affecting the performance of the recommendation system in matrix factorization. However, it doesn't take into account users' preference for unrated items, and its recommendation performance isn't advantageous for large-scale data with high sparsity. This paper proposed a recommendation algorithm for fusing matrix completion and deep matrix factorization. First, it filled the unknown elements in the original scoring matrix by the matrix completion model. Then, based on the completed matrix, it constructed the latent vectors of users and items by deep learning model. Finally, this paper tested the proposed model on the MovieLens and SUSHI datasets. Experimental results show that the proposed algorithm significantly improves the performance of the recommendation system compared to deep matrix factorization. [ABSTRACT FROM AUTHOR]

At present, in the recommendation task based on document information, the traditional document-based hybrid recommendation algorithm still relies on a shallow linear model. When the scoring data becomes huge and complex, its recommendation performance is often not ideal. This paper proposed a deep fusion model( DeepFM), which could fully capture text information and handle complex and sparse scoring data well. DeepFM consisted of two parallel neural networks . One of them used multiple layers of perceptron to extract the row vector information of the rating matrix to obtain the user' s potential feature vector. The other one used fusion model of MLP and convolutional neural network (CNN) to extract additional textual information about the item and obtain the item' s potential feature vector. Finally, it fused the user feature vector and the item feature vector by constructing a fusion layer to obtain a prediction score. Experimental results show that DeepFM outperforms mainstream recommendation models on MovieLens dataset and Amazon dataset. [ABSTRACT FROM AUTHOR]

Collaborative Deep Learning (CDL) utilizes the strong feature learning capability of neural network and the model fitting robustness to solve the problem that the performance of Recommender System drops dramatically when the data is sparse. However, it makes the model training become difficult to maintain when Recommender System faces a large amount of data, and a variety of unpredictable problems will arise. In order to solve the above problems, collaborative deep learning and its parallelization methods were studied in this study, and an improved model CDL-I (CDL with item private node) aiming at item content optimization based on collaborative deep learning was proposed, which improved SDAE on the basis of CDL, added private network nodes; in case of sharing the network parameters of the model, private bias terms were added for each item. As a result, the network may learn the item content parameters in a more targeted manner, thereby enhancing the detection performance of the model on item content in Recommender System. Furthermore, the algorithm was parallelized by splitting the model, and a parallel training CDL-I method was also proposed, which was transplanted to the Spark distributed cluster. The parameters of each part of the model were trained and optimized in parallel to enhance the scale and scalability of data that the model could process. The experiments on multiple real datasets have verified the effectiveness and efficiency of the proposed parallel CDL-I algorithm. • Propose CDL-I model which retains unique bias weight for each item. • Study the parallelization of CDL-I and propose a parallel training method. • Implement parallel training of CDL-I based on the Spark. • Carry out thorough performance evaluation of CDL-I and its parallelization. [ABSTRACT FROM AUTHOR]

As the number of researchers in South Korea has grown, there is increasing dissatisfaction with the selection process for national research and development (R&D) projects among unsuccessful applicants. In this study, we designed a system that can recommend the best possible R&D evaluators using big data that are collected from related systems, refined, and analyzed. Our big data recommendation system compares keywords extracted from applications and from the full-text of the achievements of the evaluator candidates. Weights for different keywords are scored using the term frequency–inverse document frequency algorithm. Comparing the keywords extracted from the achievement of the evaluator candidates', a project comparison module searches, scores, and ranks these achievements similarly to the project applications. The similarity scoring module calculates the overall similarity scores for different candidates based on the project comparison module scores. To assess the performance of the evaluator candidate recommendation system, 61 applications in three Review Board (RB) research fields (system fusion, organic biochemistry, and Korean literature) were recommended as the evaluator candidates by the recommendation system in the same manner as the RB's recommendation. Our tests reveal that the evaluator candidates recommended by the Korean Review Board and those recommended by our system for 61 applications in different areas, were the same. However, our system performed the recommendation in less time with no bias and fewer personnel. The system requiresrevisions to reflect qualitative indicators, such as journal reputation, before it can entirely replace the current evaluator recommendation process. [ABSTRACT FROM AUTHOR]

In order to solve the cold start problem of traditional recommendation algorithm, the sequence change of user interaction information and deep learning are gradually considered as a key feature of commodity recommendation system. However, most of the existing recommendation methods based on the sequence changes assume that all the interaction information of users is equally important for recommendation, which is not always applicable in real scenarios, because the interaction process of user items is full of randomness and contingency. In this article, we study how to reduce the randomness and contingency between session sequences, make full use of the association between session sequences in the interaction process of users by Deep Learning. In order to better simulate the change of session sequence in the real scene, we adopt sequence sampling methods to transform the single classification problem into sequence modeling problem. And attention mechanism is added to reduce the interference of the recommendation model in the sequence due to the contingency and randomness of the user in the shopping. Finally, through the verification of real data, the MRR@20 index of the improved model is 20% higher than the benchmark level. [ABSTRACT FROM AUTHOR]

Recommender systems can effectively reduce the information overload by recommending items that users may be interested in. Euclidean-embedding-based collaborative filtering methods map users and items to a unified latent space, which is one of the most important methods to build a recommender system. However, traditional Euclidean-embedding-based collaborative filtering methods only consider the low-order interaction between user latent feature vectors and item latent feature vectors, and cannot efficiently model the complex interaction behavior between users and items in the real world. In this paper, we propose a deep-Euclidean-embedding-based collaborative filtering algorithm, which utilizes deep learning technology to learn the high-order and nonlinear interaction function between user latent feature vectors and item latent feature vectors. This can model the complex interaction behavior between users and items. Experimental results on real-world datasets show that our proposed algorithm outperforms traditional collaborative filtering algorithms. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Harbin University of Science & Technology is the property of Journal of Harbin University of Science & Technology 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.)

One of the primary tasks for commercial recommender systems is to predict the probabilities of users clicking items, e.g., advertisements, music and products. This is because such predictions have a decisive impact on profitability. The classic recommendation algorithm, collaborative filtering (CF), still plays a vital role in many industrial recommender systems. However, although straight CF is good at capturing similar users' preferences for items based on their past interactions, it lacks regarding (1) modeling the influences of users' sequential patterns from their individual history interaction sequences and (2) the relevance of users' and items' attributes. In this work, we developed an attention-based latent information extraction network (ALIEN) for click-through rate prediction, to integrate (1) implicit user similarity in terms of click patterns (analogous to CF), and (2) modeling the low and high-order feature interactions and (3) historical sequence information. The new model is based on the deep learning, which goes beyond the capabilities of econometric approaches, such as matrix factorization (MF) and k-means. In addition, the approach provides explainability to the recommendation by interpreting the contributions of different features and historical interactions. We have conducted experiments on real-world datasets that demonstrate considerable improvements over strong baselines. [ABSTRACT FROM AUTHOR]

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

Recommender systems are crucial in the big data era, effectively mitigating information overload. Existing recommendation methods are limited on highly sparse data and have mediocre recall performance. Group influence aggregates knowledge from different users or organizations to generate decisions, improving information fusion efficiency and group decision-making quality. In this paper, a group influence-based deep adversarial autoencoder (GI-AAE), is proposed for top-N recommendation. It leverages group influence to strengthen autoencoder latent features and address sparse data and uses adversarial learning from GANs to enhance reconstruction. The group influence based deep autoencoder (GI-AE) is the generative model for the GI-AAE. Experimental results show that the proposed algorithm is competitive and gets higher recall values. • A group influence-based deep adversarial autoencoder is proposed for recommendation. • Group influence increases the potential characteristics of the autoencoder. • Group influence helps alleviate the problem of sparse data sets. • The proposed algorithm gets better results, especially on recall values. [ABSTRACT FROM AUTHOR]

Most of the existing modeling methods of combining metadata are based on the same user I item attribute weights, so that the key relationships between users and items are not significant, and it is difficult to obtain better recommendation performance. To solve the above problems, this paper proposed a method of deep joint learning recommendation based on metadata and attention mechanism. It used double deep network joint learning, one of the networks implemented matrix nonlinear decomposition based on implicit feedback data to learn user/ project personalization relationship, and another network automatically captured influence the user/ item key attributes to recommend by using attention mechanism, through the user preference relation with weighted of different attributes modeling highlighted the extended model. Experimental results show that the proposed recommendation algorithm has better recommendation performance on two public datasets of MovieLens 100K and MovieLens lM. [ABSTRACT FROM AUTHOR]

• A robust phase unwrapping procedure based on central difference information filter is built. It is worth mentioning that the central difference information filter that is a new type of filter with high efficiency and high robustness, is applied to acquire the unambiguous unwrapped phase of wrapped phase images for the first time to our knowledge. • A region segmentation model based on deep learning is constructed and then combined with the robust phase unwrapping procedure proposed by this manuscript to improve the accuracy and efficiency in phase unwrapping for wrapped fringe patterns. This paper presents a deep learning-based central difference information filtering phase unwrapping algorithm. First, the central difference information filter (CDIF) is introduced into phase unwrapping for wrapped phase images for the first time to our knowledge, and is combined with an efficient local phase gradient estimation technique, and an efficient path-following strategy based on heap sorting to construct a CDIF phase unwrapping procedure. Second, a region segmentation model based on deep learning is constructed to divide the wrapped phase images into a series of segmented regions along the edge of interferometric fringes, which is beneficial to improve the accuracy and efficiency of subsequent phase unwrapping. Finally, each segmented region of the wrapped phase images is unwrapped separately using the CDIF phase unwrapping procedure, and the unwrapping results of each segmented region are combined according to the phase consistency criterion of adjacent regions of the wrapped phase images to obtain the unwrapped phase of the whole wrapped phase images. Results delivered by the experiments on synthetic data and experimental data demonstrate the robustness and acceptable efficiency of the proposed method in phase unwrapping for the wrapped phase images, compared with some commonly used algorithms. [ABSTRACT FROM AUTHOR]

This aims to propose a collaborative filtering algorithm based on embedding representation and word embedding techniques, namely UI2vec. According to the joint feature extraction network designed in this paper, UI2vec embeds users and items on the potential space at the same time, and uses the item similarity between them to predict the user's content of interest. Then a generative model VUI2vec with more stable performance is proposed based on UI2vec, which maps users and items as independent Gaussian distributions and obtains the approximate posterior distribution of both by variational inference. The recommendation performance of UI2vec and VUI2vec is evaluated on TaFeng, Movielens, and Netflix datasets. The impact of important superparameters within the model on performance is investigated. The experimental results show that compared with the baseline model, the proposed methods performs consistently well. • UI2vec and VUI2vec as collaborative filtering-based recommendation systems. • It is based on embedding representation of users or items. • Performance is competitive with the state of the art on real-world datasets. • Results encourage integrating collaborative filtering with deep learning. [ABSTRACT FROM AUTHOR]

• We proposed a novel recommendation system based on collaborative filtering. • It is a combination of explicit (Intra & Inter) and implicit feedback interaction couplings. • It solves the cold start and sparsity problems of collaborative filtering methods. Due to the expansion of e-business, the availability of products on the internet has massively increased. Finding suitable stuff from the vast array of products available on the internet is a time-consuming task. Collaborative Filtering (CF) is the most effective recommendation method for providing users with the ability to identify relevant content and, therefore, increase engagement. However, CF has several flaws, including data sparsity and cold start problems. These are ongoing research questions that pose major hurdles to the precision of the algorithms. Therefore, in this work, a novel neural recommendation model is proposed based on non-independent and identically distributed (Non-IID) for CF by incorporating explicit and implicit coupling interaction. The explicit interactions consist of two models, namely Intra-coupling interactions within users and items, and Inter-coupling interactions between different users and items concerning the attributes of users and items. The Intra-coupled model learns using deep learning convolutional neural networks and is combined with the Inter-coupled model. Besides explicit coupling interactions, we present a Generalized Matrix Factorization Bias (GMFB) model that systematically trains the implicit user-item coupling. Finally, we combined with explicit and implicit coupling interactions within and between users and items accompanying the extra information about users and items under a framework called "IntegrateCF." Extensive experiments on two large real-world datasets have shown that the proposed model performs better than existing methods. [ABSTRACT FROM AUTHOR]

Research about recommender systems emerges over the last decade and comprises valuable services to increase different companies' revenue. While most existing recommender systems rely either on a content-based approach or a collaborative approach, there are hybrid approaches that can improve recommendation accuracy using a combination of both approaches. Even though many algorithms are proposed using such methods, it is still necessary for further improvement. This paper proposes a recommender system method using a graph-based model associated with the similarity of users' ratings in combination with users' demographic and location information. By utilizing the advantages of Autoencoder feature extraction, we extract new features based on all combined attributes. Using the new set of features for clustering users, our proposed approach (GHRS) outperformed many existing recommendation algorithms on recommendation accuracy. Also, the method achieved significant results in the cold-start problem. All experiments have been performed on the MovieLens dataset due to the existence of users' side information. • We propose a recommendation system using graph-based features and Autoencoders. • We investigate and analyze each step of the method to find the best setup. • We examine the method with the most popular evaluation metrics and datasets. • Results show an improvement in comparison with basic and state of the art methods. [ABSTRACT FROM AUTHOR]

Recently, deep learning has dominated the recommender system, as it is able to effectively capture nonlinear and nontrivial user–item relationships, and perform complex nonlinear transformations. However, there are still some issues with respects to the existing methods. Firstly, they always treat user–item interactions independently, and may fail to cover more complex and hidden information that is inherently implicit in the local neighborhood surrounding an interaction sample. Secondly, by quantifying the dependence degree of user–item sequences, it demonstrates that both short-term and long-term dependent behavioral patterns co-exist. Unfortunately, typical deep learning methods might be problematic when coping with very long-term sequential dependencies. To address these issues, we propose a novel unified neural collaborative recommendation algorithm that capitalizes on memory networks for learning attention embedding from implicit interaction (NCRAE). Particularly, the attention is capable of learning the relative importance of different users and items from user–item interaction sequences, which provides a better solution for concentrating on inputs and helps to better memorize long-term sequential dependencies. Extensive experiments on three real-world datasets show significant improvements of our proposed NCRAE algorithm over the competitive methods. Empirical evidence shows that using memory networks for learning attention embeddings of users' implicit interaction yields better recommendation performance. • We design a neural network to learn co-attention from user–item interactions. • The co-attention provides a better solution to memorize long-term dependencies. • We design a neural collaborative algorithm for incorporating co-attention. • Our algorithm is augmented with an external memory and neural attention. • Our algorithm can capture short-term and long-term dependence well. [ABSTRACT FROM AUTHOR]

With users being exposed to the growing volume of online information, the recommendation system aiming at mining the important or interesting information is becoming a modern research topic. One approach of recommendation is to integrate the graph neural network with deep learning algorithms. However, some of them are not tailored for bipartite graphs, which is a unique type of heterogeneous graph having two entity types. Others, though customized, neglect the importance of implicit relation and content information. In this paper, we propose the attentive implicit relation recommendation incorporating content information (AIRC) framework that is designed for bipartite graphs based on the GC–MC algorithm. First, through reconstructing the bipartite graphs, we obtain the implicit relation graphs. Then we analyze the content information of users and items with a CNN process, so that each user and item has its feature-tailored embeddings. Besides, we expand the GC–MC algorithms by adding a graph attention mechanism layer, which handles the implicit relation graph by highlighting important features and neighbors. Therefore, our framework takes into consideration both the implicit relation and content information. Finally, we test our framework on Movielens dataset and the results show that our framework performs better than other state-of-art recommendation algorithms. [ABSTRACT FROM AUTHOR]