Abstract
The following study examines how various classification algorithms perform on the problem of handwritten digit recognition. The classifiers discussed are k-Nearest Neighbour (k-NN), Single Classification Decision Trees and Bagged Decision Trees. These algorithms were evaluated with the use of information from the United States Postal Service (USPS). This study’s results show that the k-NN classifier had the fastest performance while the bagged decision trees were the slowest. In terms of classification performance, the bagged decision tree method was found to have the fewest misclassifications and outperformed k-NN and single classification trees in all of the considered metrics.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Artificial Intelligence and Computer Visio, AICV 2020 |
| Editors | Aboul-Ella Hassanien, Ahmad Taher Azar, Tarek Gaber, Diego Oliva, Fahmy M. Tolba |
| Publisher | Springer |
| Pages | 414-426 |
| Number of pages | 13 |
| ISBN (Print) | 9783030442880 |
| DOIs | |
| State | Published - 2020 |
| Externally published | Yes |
| Event | 1st International Conference on Artificial Intelligence and Computer Visions, AICV 2020 - Cairo, Egypt Duration: 8 Apr 2020 → 10 Apr 2020 |
Publication series
| Name | Advances in Intelligent Systems and Computing |
|---|---|
| Volume | 1153 AISC |
| ISSN (Print) | 2194-5357 |
| ISSN (Electronic) | 2194-5365 |
Conference
| Conference | 1st International Conference on Artificial Intelligence and Computer Visions, AICV 2020 |
|---|---|
| Country/Territory | Egypt |
| City | Cairo |
| Period | 8/04/20 → 10/04/20 |
Bibliographical note
Publisher Copyright:© 2020, Springer Nature Switzerland AG.
Keywords
- Bagged Decision Tree
- Optical Character Recognition
- Single Classification Decision Trees
- k-Nearest Neighbor
ASJC Scopus subject areas
- Control and Systems Engineering
- General Computer Science