MétaCan
Menu
Back to cohort
Record W4409205024 · doi:10.1134/s1054661824701141

Determining Optimal Granularity for Effective Handwriting Analysis

2024· article· en· W4409205024 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenuePattern Recognition and Image Analysis · 2024
Typearticle
Languageen
FieldComputer Science
TopicHandwritten Text Recognition Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsGranularityHandwritingComputer sciencePattern recognition (psychology)Artificial intelligenceNatural language processing

Abstract

fetched live from OpenAlex

Abstract In most literature on handwriting analysis, the datasets used are typically mentioned. However, the sizes of these datasets can vary once they undergo preprocessing for actual model training. This results in different sample sizes being used as inputs. We hypothesize that these varying input sizes can influence the output results of the models. In this paper, we explore the optimal granularity for handwriting analysis. We trained two deep learning models to classify traits such as extraversion (EXT) and conscientiousness (CON) using our own dataset. Our findings indicate that the optimal granularities are 3 × 8, 8 × 6, and 9 × 12 for different splitting patterns. We recommend selecting training samples with at least 77 instances, each containing 3 to 4 lines of text, to ensure robust model performance. These guidelines can serve as a reference for future research in handwriting analysis.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.991
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.003
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.020
GPT teacher head0.286
Teacher spread0.266 · 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