{'fraction_non_alphanumeric': 0.019376579612468407, 'fraction_numerical': 0.0, 'mean_word_length': 5.636871508379889, '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}}
Orthogonal Principal Feature Selection

This paper presents a feature selection method based on the popular transformation approach: principal component analysis (PCA). It is popular because it finds the optimal solution to several objective functions (including maximum variance and minimum sum-squared-error), and also because it provides an orthogonal basis solution. However, PCA as a dimensionality reduction algorithm do not explicitly indicate which variables are important. We propose a novel method that utilizes the PCA result to select the original features, which are most correlated to the principal components and are as uncorrelated with each other as possible through orthogonalization. Our feature selection method, as a consequence of orthogonalization, preserves the special property in PCA that the retained variance can be expressed as the sum of orthogonal feature variances that are kept. Our experiments show that orthogonal feature selection, leads to better performance compared to without orthogonalization, and for a fixed number of retained features, consistently picks the best subset of features in terms of sum-squared-error compared to competing methods.