MétaCan
Menu
Back to cohort
Record W2147122038 · doi:10.1109/iwfhr.2004.53

Handwritten Brazilian Month Recognition: An Analysis of Two NN Architectures and a Rejection Mechanism

2004· article· en· W2147122038 on OpenAlexaff
Marcelo N. Kapp, Cinthia Obladen de Almendra Freitas‍, Robert Sabourin

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicHandwritten Text Recognition Techniques
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsComputer scienceModular designHandwritingFeature extractionHandwriting recognitionClass (philosophy)Pattern recognition (psychology)Artificial intelligenceFeature (linguistics)Feed forwardSpeech recognitionModular neural networkSet (abstract data type)ArchitecturePerceptronArtificial neural networkTime delay neural networkEngineering

Abstract

fetched live from OpenAlex

This paper evaluates the use of the conventional architecture feedforward MLP (multiple layer perceptron) and class-modular for the handwriting recognition (HWR) and it also compares the results obtained with previous works in terms of recognition rate. This work presents a feature set in full detail to work with HWR. The experiments showed that the class-modular architecture is better than conventional architecture. The obtained average recognition rates were 77.08% using the conventional architecture and 81.75% using the class-modular. This paper also describes a performance study in which a rejection mechanism with multiple thresholds is evaluated for both conventional and class-modular architectures. The multiple thresholds idea is based on the use of N class-related reject thresholds (CRTs). The results indicate that this rejection mechanism can be used appropriately in both architectures. The experimental results are 86.38% and 91.52% using a handwritten months word database.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.015
GPT teacher head0.267
Teacher spread0.252 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations13
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicHandwritten Text Recognition TechniquesFrench-language works237,207