{'fraction_non_alphanumeric': 0.03274087932647334, 'fraction_numerical': 0.0009354536950420954, 'mean_word_length': 5.079545454545454, '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}}
A comparative study of pseudo-inverse computing for the extreme learning machine classifier

Most feed-forward artificial neural network training algorithms for classification problems are based on an iterative steepest descent technique. Their well-known drawback is slow convergence. A fast solution is an Extreme Learning Machine (ELM) computing the Moore-Penrose inverse using SVD. However, the most significant training time is pseudo-inverse computing. Thus, this paper proposes two fast solutions to pseudo-inverse computing based on QR with pivoting and Fast General Inverse algorithms. They are QR-ELM and GENINV-ELM, respectively. The benchmarks are conducted on 5 standard classification problems, i.e., diabetes, satellite images, image segmentation, forest cover type and sensit vehicle (combined) problems. The experimental results clearly showed that both QR-ELM and GENINV-ELM can speed up the training time of ELM and the quality of their solutions can be compared to that of the original ELM. They also show that QR-ELM is more robust than GENINV-ELM.