{'fraction_non_alphanumeric': 0.02050113895216401, 'fraction_numerical': 0.002277904328018223, 'mean_word_length': 5.793814432989691, '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}}
On Sparsity Measures In Deep Subspace Clustering

Traditional clustering methods groups data points according to attributes such as similarity, continuity, neighbor-hood information, etc. overlooks the structural properties of the data. Consequently, prevalent clustering approaches to below-par performance in real-world applications. Unlike traditional clustering approaches, subspace clustering methods attempt to group datapoints keeping the inherent structure and rank-related properties of the data into account. Despite the rapid growth in deep learning-based approaches, very few works have utilized deep learning for the subspace clustering task. This work introduced an auto-encoder-based deep learning architecture consisting of a self-expressive layer for the deep subspace clustering task. We use smoothed L2, L0.5 and Frobenius norms instead of the actual measures for ease of optimization task. We also explored the efficacy of sparsity measures that characterize the self-representation coefficient matrix of the self-expressive layer. The experiments conducted on standard datasets suggest that the application of efficient sparsity measures improves the performance of the subspace clustering approach and results in superior performance compared to the previous deep subspace clustering approaches.