{'fraction_non_alphanumeric': 0.014104372355430184, 'fraction_numerical': 0.0, 'mean_word_length': 5.513761467889908, '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}}
Hierarchical Laplacian Score for unsupervised feature selection

In this paper, we address the problem of unsupervised feature selection. This is an important challenge due to the absence of class labels that would guide the search for relevant information. Motivated by this challenge, we define the new method named Hierarchical Laplacian Score (HLS) that constrains the Laplacian Score using a tree topology structure. The purpose of using this structure is to automatically discover local data structure and local nearest neighbors for each data object. Experimental results on various datasets have demon- strated the effectiveness of the proposed algorithm in clustering and classification applications.