{'fraction_non_alphanumeric': 0.014058106841611996, 'fraction_numerical': 0.0, 'mean_word_length': 5.592592592592593, '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}}
Social recommender system by embedding social regularization

The rapid growth in information on the World Wide Web has created different challenges to the users such as finding relevant and useful information and knowledge. To deal with such problem, recommender systems came into existence. Collaborative filtering techniques have gained much more popularity than other techniques in recommender system. As in real life, we ask our friends for different recommendations. But traditional systems ignore social relationships among users. In order to resolve this problem and improve recommender system's results, the idea of using social recommender system was discussed which contains the capability of identifying user's interests and preferences and their social network relationship. However, this approach is not sensitive to those users whose friends have dissimilar tastes. To tackle the problem of inaccuracy in result due to information deficiency, the social regularization term is used to impose constraints between one user and their friends individually.