{'fraction_non_alphanumeric': 0.02682403433476395, 'fraction_numerical': 0.0, 'mean_word_length': 5.390410958904109, '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}}
Eigenvalue-Based Block Diagonal Representation and Application to p-Nearest Neighbor Graphs

Block diagonal structure of the affinity matrix is advantageous, e.g. in graph-based cluster analysis, where each block corresponds to a cluster. However, constructing block diagonal affinity matrices may be challenging and computationally demanding. We propose a new eigenvalue-based block diagonal representation (EBDR) method. The idea is to estimate a block diagonal affinity matrix by finding an approximation to a vector of target eigenvalues. The target eigenvalues, which follow the ideal block-diagonal model, are efficiently determined based on a vector derived from the graph Laplacian that represents the blocks as a piece-wise linear function. The proposed EBDR shows promising performance compared to four optimally tuned state-of-the-art methods in terms of clustering accuracy and computation time using real-data examples.