{'fraction_non_alphanumeric': 0.02193419740777667, 'fraction_numerical': 0.0, 'mean_word_length': 4.905882352941177, '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}}
On recommendation systems applied in big data

In this article we present an approach in predicting a user's behavior using big data, correlations, Ramsey theory and generalized suffix trees. Recommendation systems are widely used, especially in e-commerce. The purpose of the recommendation system is to predict what items a user would prefer. This predictions are based on some information like the group in which the user could fit or the past behavior of the user (for example last checked items). The more data we have, the best predictions we obtain. In last few years, it was collected so much information, which could not be stored in classical database management systems, so we already are talking about big data. Firstly, we present the main concepts regarding recommendation systems and big data, then we present some mathematical concepts and in the last part, we analyze the mathematical results and try to apply them in big data and recommendation systems, using generalized suffix trees.