{'fraction_non_alphanumeric': 0.01845444059976932, 'fraction_numerical': 0.0, 'mean_word_length': 6.1735537190082646, '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}}
Performance evaluation for outlier detection from numerical perspective

Outlier detection is an important topic in data mining and statistics. Various outlier-detection methods consist of intermediate steps that require solving linear equations. In many occasions, the efficiency and effectiveness of the outlier-detection results hinge on the runtime, precision, and stability of the solution to the related linear equations. This paper presents the performance evaluation of several numerical solvers employed for solving linear equations in the process of identifying outliers, including LU factorization, Cholesky decomposition, Gaussian elimination, Gaussian decomposition with partial pivoting, and the conjugate gradient method, from the numerical perspective. Both the theoretical analysis and the experiment results are provided for the detailed evaluation.