{'fraction_non_alphanumeric': 0.030033370411568408, 'fraction_numerical': 0.0, 'mean_word_length': 5.569343065693431, '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}}
Online subspace learning and nonlinear classification of Big Data with misses

`Big Data' classification is hindered by the large volume of often high-dimensional data, missing or absent features and, in streaming operation, the need for real-time processing. This paper aims at learning a kernelized support-vector-machine (SVM) classifier from (generally nonlinearly separable) large-scale incomplete data `on the fly.' Leveraging the low-rank attribute of the (even incomplete) data matrix, a novel online algorithm is developed for tracking the latent linear subspace jointly with the nonlinear classifier. Tailored for big data applications, dimensionality reduction based on the learned subspace is carried out online, while at the same time seeking the classifier in the reduced dimension. Performance analysis along with preliminary tests corroborate the effectiveness of the novel approach.