{'fraction_non_alphanumeric': 0.016282225237449117, 'fraction_numerical': 0.0, 'mean_word_length': 5.589285714285714, '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}}
Linear regression for pattern recognition

This paper presents a novel method for pattern recognition problem in terms of linear regression. Normally, patterns from a single-object class lie on a linear subspace. Using this concept, we develop a linear model representing a probe image as a linear combination of class-specific galleries. Linear Regression Classification (LRC) algorithm for pattern recognition belongs to the category of nearest subspace classification. This algorithm is extensively evaluated on several standard digit and English character databases and our own Tamil character database. A comparative study with different databases and methods clearly reflects the efficiency of LRC approach for pattern recognition.