{'fraction_non_alphanumeric': 0.016653449643140365, 'fraction_numerical': 0.0007930214115781126, 'mean_word_length': 5.31, '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}}
Refined co-SVD Recommender Algorithm: Data Processing and Performance Metrics

: A resurgence of research interest in recommender systems can be attributed to the widely publicized Netflix competition with the grand prize of USD 1 million. The competition enabled the promising collaborative filtering algorithms to come to prominence due to the availability of a large dataset and from it, the growth in the use of matrix factorization. There have been many recommender system projects centered around use of matrix factorization, with the co-SVD approach being one of the most promising. However, the field is chaotic using different benchmarks and evaluation metrics. Not only the performance metrics reported are not consistent, but it is difficult to reproduce existing research when details of the data processing and hyper-parameters lack clarity. This paper is to address these shortcomings and provide researchers in this field with a current baseline through the provision of detailed implementation of the co-SVD approach. To facilitate progress for future researchers, it will also provide results from an up-to-date dataset using pertinent evaluation metrics such as the top-N recommendations and the normalized discounted cumulative gain measures.