A Genetic-LVQ neural networks approach for handwritten Arabic character recognition
Bibliographic record
Abstract
Handwritten recognition systems are a dynamic field of research in areas of artificial intelligence. Many smart devices available in the market such as pen-based computers, tablets, mobiles with handwritten recognition technology need to rely on efficient handwritten recognition systems. In this paper we present a novel Arabic character handwritten recognition system based on a hybrid method consisting of a genetic algorithm and a Learning vector quantization (LVQ) neural network. Sixty different handwritten Arabic character datasets are used for training the neural network. Each character dataset contains 28 letters written twice with 15 distinct shaped alphabets, and each handwritten Arabic letter is represented by a binary matrix that is used as an input to a genetic algorithm for feature selection and dimension reduction to include only the most effective features to be fed to the LVQ classifier. The recognition process in the system involves several essential steps such as: handwritten letter acquisition, dataset preparation, feature selection, training, and recognition. Comparing our results to those acquired by the whole feature dataset without selection, and to the results using other classification algorithms confirms the effectiveness of our proposed handwritten recognition system with an accuracy of 95.4%, hence, showing a promising potential for improving future handwritten Arabic recognition devices in the market.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".