{'fraction_non_alphanumeric': 0.012738853503184714, 'fraction_numerical': 0.0010615711252653928, 'mean_word_length': 4.785276073619632, '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}}
Efficient single layer handwritten digit recognition through an optimizing algorithm

Handwritten digit recognition has attracted a great deal of research and analysis. However, only a few researchers wished to follow the track of linearity in finding a single layer model to classify the digits. The goals are clear from this approach; namely to avoid falling into the pitfalls of a representational space. This paper presents an improvement on a model that was presented earlier based on the decomposition of the input stream. A powerful predictive algorithm is used here to result in an error rate as low as 4% in a single layer network, which is an achievement to say the least. We then test the model by comparing its performance with a multi-layer back propagation network and a Least Mean Square algorithm to show how powerful it is. The power of decomposition may indeed be applicable in many different domains of pattern recognition.