{'fraction_non_alphanumeric': 0.016236162361623615, 'fraction_numerical': 0.0007380073800738007, 'mean_word_length': 5.191780821917808, '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}}
Enhanced vector space models for content-based recommender systems

The use of Vector Space Models (VSM) in the area of Information Retrieval is an established practice within the scientific community. The reason is twofold: first, its very clean and solid formalism allows us to represent objects in a vector space and to perform calculations on them. On the other hand, as proved by many contributions, its simplicity does not hurt the effectiveness of the model. Although Information Retrieval and Information Filtering undoubtedly represent two related research areas, the use of VSM in Information Filtering is much less analzyed.
 The goal of this work is to investigate the impact of vector space models in the Information Filtering area. Specifically, I will introduce two approaches: the first one, based on a technique called Random Indexing, reduces the impact of two classical VSM problems, this is to say its high dimensionality and the inability to manage the semantics of documents. The second extends the previous one by integrating a negation operator implemented in the Semantic Vectors1 open-source package. The results emerged from an experimental evaluation performed on a large dataset and the applicative scenarios opened by these approaches confirmed the effectiveness of the model and induced to investigate more these techniques.