MétaCan
Menu
Back to cohort
Record W2000599920 · doi:10.1142/s0218001404003587

PROJECT CellNet: EVOLVING AN AUTONOMOUS PATTERN RECOGNIZER

2004· article· en· W2000599920 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

VenueInternational Journal of Pattern Recognition and Artificial Intelligence · 2004
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceSet (abstract data type)Artificial intelligenceGenetic algorithmEvolutionary algorithmBinary numberPattern recognition (psychology)SoftwareMachine learningMathematics

Abstract

fetched live from OpenAlex

We describe the desire for a black box approach to pattern classification: a generic Autonomous Pattern Recognizer, which is capable of self-adapting to specific alphabets without human intervention. The CellNet software system is introduced, an evolutionary system that optimizes a set of pattern-recognizing agents relative to a provided set of features and a given pattern database. CellNet utilizes a new genetic operator designed to facilitate a canalization of development: Merger. CellNet utilizes our own set of arbitrarily chosen features, and is applied to the CEDAR Database of handwritten Latin characters, as well as to a database of handwritten Indian digits provided by CENPARMI. CellNet's cooperative co-evolutionary approach shows significant improvement over a more standard Genetic Algorithm, both in terms of efficiency and in nearly eliminating over-fitting (to the training set). Additionally, the binary classifiers autonomously evolved by CellNet return validation accuracies approaching 98% for both Latin and Indian digits, with no global changes to the system between the two trials.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.994
Threshold uncertainty score0.598

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.080
GPT teacher head0.322
Teacher spread0.242 · 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