{'fraction_non_alphanumeric': 0.021331058020477817, 'fraction_numerical': 0.0, 'mean_word_length': 5.2063492063492065, '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}}
Alleviate sparsity problem using hybrid model based on spectral co-clustering and tensor factorization

Most of recommender systems suffer from common challenge named data sparsity. This problem makes an important challenge on the efficiency of collaborative filtering and causes overfitting problem. In this paper, `time' as a third dimension is considered. Therefore, increasing dimensions of data makes this problem more critical. For alleviating this problem, this research applies a framework to block users and items co-occurrences in the similar cluster and adds time to each block. This method imputes appropriate values for missing data based on similar user and item ratings assigned to each block. Preprocess based on optimization is performed on each cluster. After this step, data points in each block are merged together and tensor factorization is used to model relations between users, items and times. Our novel approach has two advantages: (a) it increases the speed of convergence and avoids overfitting the observed data, (b) it reduces sparsity problem and error rate. The evaluation metric demonstrate that our algorithm has good results in practice.