{'fraction_non_alphanumeric': 0.017463933181473046, 'fraction_numerical': 0.0, 'mean_word_length': 5.398058252427185, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Matrix Factorization Based on BatchNorm and Preference Bias

With the rapid development of science and technology, huge amounts of information fill people’s lives, and the accompanying information overload phenomenon has become an urgent problem to be solved. Because the recommendation system can quickly find the products users want in the massive item information, to a certain extent It has attracted much attention to solve the problem of information overload. Matrix factorization is a commonly used technique in recommendation systems. It can effectively improve the recommendation effect when the scoring matrix is sparse. However, due to its own reasons, matrix factorization has many problems such as sparseness, cold start, and low interpretability. In the field of deep learning, because the normalization technology BatchNorm can optimize the training process, accelerate the training speed and make the training results more stable, it has been studied by a large number of scholars. In this paper, Matrix Factorization Based on BatchNorm and Preference Bias is proposed. BatchNorm is combined with matrix factorization, user and item preferences are added, and Adam algorithm is used for optimization. Experiments show that the algorithm in this paper has a good recommendation effect on sparse matrix.