We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Electrical Engineering/Letter Detection : An Empirical Comparative Study of Different ML Classifier and Feature Extraction
PeriodicalsElectrical Engineering

Letter Detection : An Empirical Comparative Study of Different ML Classifier and Feature Extraction

Checking your access to this record.

Abstract & Overview

Work and communication activities are inextricably linked. Letters are an example of a communication medium that is still widely utilized. When it comes to significant job, however, simply an official letter is required. Official and private letters must be distinguished and classified. Different feature extraction methods, such as the count-vectorizer and TF-IDF vectorizer, are employed to transmit the detection of this official and personal letter. To categorize letters by type, various machine learning (ML) techniques are employed. Nave Bayes, Support vector machine, and AdaBoost are the algorithms. The accuracy measurements used in this study include accuracy scores, F1-mean, recall, and precision. The best working algorithm is Naïve Bayes for two vectorizer methods used, with an accuracy value of 98%.

Cite this record

Aji Prasetya Wibawa, Nastiti Susetyo Fanany Putri, Prasetya Widiharso (2023). Letter Detection : An Empirical Comparative Study of Different ML Classifier and Feature Extraction. Signal and Image Processing Letters, 5(1), 1–7. https://doi.org/10.31763/simple.v5i1.45

Copy in another style

Wibawa, A. P., Putri, N. S. F., & Widiharso, P. (2023). Letter Detection : An Empirical Comparative Study of Different ML Classifier and Feature Extraction. Signal and Image Processing Letters, 5(1), 1–7. https://doi.org/10.31763/simple.v5i1.45
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.