Application Analysis of English Personalized Learning Based on Large-scale Open Network Courses

Social recommendation leverages social information to solve data sparsity and cold-start problems in traditional collaborative filtering methods. However, most existing models assume that social effects from friend users are static and under the forms of constant weights or fixed constraints. To relax this strong assumption, in this paper, we propose dual graph attention networks to collaboratively learn representations for two-fold social effects, where one is modeled by a user-specific attention weight and the other is modeled by a dynamic and context-aware attention weight. We also extend the social effects in user domain to item domain, so that information from related items can be leveraged to further alleviate the data sparsity problem. Furthermore, considering that different social effects in two domains could interact with each other and jointly influence user preferences for items, we propose a new policy-based fusion strategy based on contextual multi-armed bandit to weigh interactions of various social effects. Experiments on one benchmark dataset and a commercial dataset verify the efficacy of the key components in our model. The results show that our model achieves great improvement for recommendation accuracy compared with other state-of-the-art social recommendation methods.

Hyperspectral data is not linearly separable, and it has a high characteristic dimension. This paper proposes a new algorithm that combines a deep belief network based on the Boltzmann machine with a self-organizing neural network. The primary features of the hyperspectral image are extracted with a deep belief network. The weights of the network are fine-tuned using the labeled sample. Feature vectors extracted by the deep belief network are classified by a self-organizing neural network. The method reduces the spectral dimension of the data while preserving the large amount of original information in the data. The method overcomes the long training time required when using self-organizing neural networks for clustering, as well as the training difficulties of Deep Belief Networks (DBN) when the labeled sample size is small, thereby improving the accuracy and robustness of the semi-supervised classification. Simulation results show that the structure of the network can achieve higher classification accuracy when the labeled sample is deficient.

Taxonomies are ubiquitous in many real-world recommendation scenarios where each item is classified into a category of a predefined hierarchical taxonomy and provide important auxiliary information for inferring user preferences. However, traditional collaborative filtering approaches have focused on user-item interactions (e.g., ratings) and neglected the impact of taxonomy information on recommendation. In this paper, we present a taxonomy-aware denoising autoencoder based model which incorporates taxonomy-aware side information into denoising autoencoder based recommendation models to enhance recommendation accuracy and alleviate data sparsity and cold start problems in recommendation systems. We propose two types of taxonomic side information, namely the topological representation of tree-structured taxonomy and the statistical properties of the taxonomy. By integrating taxonomic side information, our model can learn more effective user latent vectors which are not only determined by user ratings but also rely on the taxonomy information. We conduct a comprehensive set of experiments on two real-world datasets which provide several outcomes: first, our proposed taxonomy-aware method outperforms the baseline method on RMSE metric. Next, information extracted from taxonomy can help alleviate data sparsity and cold start problems. Moreover, we conduct supplementary experiments to explore the reason why our proposed taxonomic side information improves recommendation performance.

Factorization Machines (FMs) are effective in incorporating side information to overcome the cold-start and data sparsity problems in recommender systems. Traditional FMs adopt the inner product to model the second-order interactions between different attributes, which are represented via feature vectors. The problem is that the inner product violates the triangle inequality property of feature vectors. As a result, it cannot well capture fine-grained attribute interactions, resulting in sub-optimal performance. Recently, the euclidean distance is exploited in FMs to replace the inner product and has delivered better performance. However, previous FM methods including the ones equipped with the euclidean distance all focus on the attribute-level interaction modeling, ignoring the critical intrinsic feature correlations inside attributes. Thereby, they fail to model the complex and rich interactions exhibited in the real-world data. To tackle this problem, in this paper, we propose a FM framework equipped with generalized metric learning techniques to better capture these feature correlations. In particular, based on this framework, we present a Mahalanobis distance and a deep neural network (DNN) methods, which can effectively model the linear and non-linear correlations between features, respectively. Besides, we design an efficient approach for simplifying the model functions. Experiments on several benchmark datasets demonstrate that our proposed framework outperforms several state-of-the-art baselines by a large margin. Moreover, we collect a new large-scale dataset on second-hand trading to justify the effectiveness of our method over cold-start and data sparsity problems in recommender systems.

The traditional matrix factorization algorithm has the problems of cold start, data sparsity and high predictive time complexity, which is not perfect in most recommendation systems. Especially in the sparse matrix problem, the recommendation accuracy cannot be guaranteed. This paper will be based on the matrix factorization algorithm modeling and create optimization algorithm, this method will be graded dataset preprocessing, the user and item's score matrix by embedding process at the same time and introducing BatchNorm sparse matrix algorithm for training normalization processing parameters do to speed up the convergence speed, increase the stability of the training, respectively add item bias that more able to show the user's true score, then the user matrix to join implicit feedback, the final score projections for the user. The optimization algorithm performs well in solving cold startup and data sparse problems of matrix factorization. The Results of the Movielens-1M experiment show that it has great advantages over traditional matrix factorization algorithms in terms of prediction accuracy, root mean square error and square absolute error.

A multi-attention deep neural network model base on embedding and matrix factorization for recommendation

A many objective commercial recommendation algorithm via Game-Based core node extraction

This paper proposes a collaborative filtering recommendation algorithm based on user characteristics and time weight which focuses on the data sparseness and cold start problems of collaborative filtering algorithms. First, digitize user's characteristics in the dataset and calculate the similarity degree of the user's feature, then weight the similarity calculation formula with the integration time function to obtain the comprehensive similarity so that a more accurate prediction score is obtained. The comparison experiments showed that the algorithm can reduce the sparseness of the data set effectively when the data is extremely sparse, and to some extent, it alleviates the cold start problem and improves the prediction accuracy of the recommendation algorithm.

Delta check (DC) is widely used for detecting sample mix-up. Owing to the inadequate error detection and high false-positive rate, the implementation of DC in real-world settings is labor-intensive and rarely capable of absolute detection of sample mix-ups. The aim of the study was to develop a highly accurate DC method based on designed deep learning to detect sample mix-up. A total of 22 routine hematology test items were adopted for the study. The hematology test results, collected from two hospital laboratories, were independently divided into training, validation, and test sets. By selecting six mainstream algorithms, the Deep Belief Network (DBN) was able to learn error-free and artificially (intentionally) mixed sample results. The model's analytical performance was evaluated using training and test sets. The model's clinical validity was evaluated by comparing it with three well-recognized statistical methods. When the accuracy of our model in the training set reached 0.931 at the 22nd epoch, the corresponding accuracy in the validation set was equal to 0.922. The loss values for the training and validation sets showed a similar (change) trend over time. The accuracy in the test set was 0.931 and the area under the receiver operating characteristic curve was 0.977. DBN demonstrated better performance than the three comparator statistical methods. The accuracy of DBN and revised weighted delta check (RwCDI) was 0.931 and 0.909, respectively. DBN performed significantly better than RCV and EDC. Of all test items, the absolute difference of DC yielded higher accuracy than the relative difference for all methods. The findings indicate that input of a group of hematology test items provides more comprehensive information for the accurate detection of sample mix-up by machine learning (ML) when compared with a single test item input method. The DC method based on DBN demonstrated highly effective sample mix-up identification performance in real-world clinical settings.

Recommender systems provide useful recommendations to a set of users for items or products that may be of interest to them. Several techniques have been proposed for recommendation such as collaborative, content-based, knowledge-based, and demographic techniques. Each of these techniques suffers from scalability, data sparsity, and cold-start problems when applied individually resulting in poor quality recommendations. This paper proposes an adaptive hybrid recommender system that combines multiple techniques together to enhance the overall recommendation process. Collaborative filtering and demographic techniques are combined in a weighted linear formula. Experiment results using movieLen dataset show that this adaptable hybrid framework is able to outperform the weaknesses shown by traditional recommendation techniques.

Currently collaborative filtering is widely used in e-commerce, digital libraries and other areas of personalized recommendation service system. Nearest-neighbor algorithm is the earliest proposed and the main collaborative filtering recommendation algorithm, but the data sparsity and cold-start problems seriously affect the recommendation quality. To solve these problems, A collaborative filtering recommendation algorithm based on users' social relationships is proposed. 0n the basis of traditional filtering recommendation technology, it combines with the interested objects of user's social relationship and takes the advantage of the tags to projects marked by users and their interested objects to improve the methods of recommendation. The experimental results of MAE ((Mean Absolute Error)) verify that this method can get better quality of recommendation.

KCRec: Knowledge-aware representation Graph Convolutional Network for Recommendation

To solve the information explosion problem and enhance user experience in various online applications, recommender systems have been developed to model users’ preferences. Although numerous efforts have been made toward more personalized recommendations, recommender systems still suffer from several challenges, such as data sparsity and cold-start problems. In recent years, generating recommendations with the knowledge graph as side information has attracted considerable interest. Such an approach can not only alleviate the above mentioned issues for a more accurate recommendation, but also provide explanations for recommended items. In this paper, we conduct a systematical survey of knowledge graph-based recommender systems. We collect recently published papers in this field, and group them into three categories, i.e., embedding-based methods, connection-based methods, and propagation-based methods. Also, we further subdivide each category according to the characteristics of these approaches. Moreover, we investigate the proposed algorithms by focusing on how the papers utilize the knowledge graph for accurate and explainable recommendation. Finally, we propose several potential research directions in this field.

Within the scope of location-based services and personalized recommendations, the challenges of recommending new and unvisited points of interest (POIs) to mobile users are compounded by the sparsity of check-in data. Traditional recommendation models often overlook user and POI attributes, which exacerbates data sparsity and cold-start problems. To address this issue, a novel multiplex hypergraph attribute-based graph collaborative filtering is proposed for POI recommendation to create a robust recommendation system capable of handling sparse data and cold-start scenarios. Specifically, a multiplex network hypergraph is first constructed to capture complex relationships between users, POIs, and attributes based on the similarities of attributes, visit frequencies, and preferences. Then, an adaptive variational graph auto-encoder adversarial network is developed to accurately infer the users’/POIs’ preference embeddings from their attribute distributions, which reflect complex attribute dependencies and latent structures within the data. Moreover, a dual graph neural network variant based on both Graphsage K-nearest neighbor networks and gated recurrent units are created to effectively capture various attributes of different modalities in a neighborhood, including temporal dependencies in user preferences and spatial attributes of POIs. Finally, experiments conducted on Foursquare and Yelp datasets reveal the superiority and robustness of the developed model compared to some typical state-of-the-art approaches and adequately illustrate the effectiveness of the issues with cold-start users and POIs.

To enhance students’ English writing ability, English creative writing has become a common course offered by colleges and universities. English reference is an indispensable tool for creative English writing. How to choose appropriate English references is an important guarantee to complete good work. Therefore, this paper proposes a Deep Semantic Mining-based Recommendation (DSMR) algorithm for English writing reference selection and recommendation to assist the completion of high-quality English creative writing works. The model can extract user features and document attributes more accurately by deeply mining semantic information of literature content and user needs, so as to achieve more accurate recommendations. First, the Bidirectional Encoder Representation from Transformers (BERT) pretraining model is adopted to process literature content and user requirement documents. Through in-depth mining of user characteristics and literature attributes, the problems of data sparsity and cold start of items are effectively alleviated. Then, the forward long short-term memory (LSTM) network was used to focus on the changes in user preferences over time, resulting in more accurate recommendations. The experimental results show that the use of heterogeneous information can significantly improve the recommendation performance, and the additional use of user attribute information can also improve the recommendation performance. Compared with other benchmark models, the recommendation quality of this model is greatly improved.