MétaCan
Menu
Back to cohort
Record W2168533083 · doi:10.1109/ijcnn.1991.155486

A pairing strategy in associative memory classifier

2002· article· en· W2168533083 on OpenAlexaff
M. Zhang, Ching Y. Suen, Tien D. Bui

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCognitive Computing and Networks
Canadian institutionsConcordia University
Fundersnot available
KeywordsPairingAssociative propertyComputer scienceContent-addressable memoryClassifier (UML)Artificial intelligenceContent-addressable storageTheoretical computer scienceMachine learningArtificial neural networkMathematicsPure mathematics

Abstract

fetched live from OpenAlex

Summary form only given. The authors discuss the pairing strategy when Hadamard vectors have been specially assigned to be the inner codes in an associative memory classifier designed to recognize a set of Chinese characters. It is shown that with an appropriate pairing scheme an improvement is achieved in the classification behavior of the associative memory network.>

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.001
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: none
Teacher disagreement score0.014
Threshold uncertainty score0.047

Distilled classifier scores by category (both heads)

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

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.052
GPT teacher head0.244
Teacher spread0.193 · 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

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicCognitive Computing and NetworksFrench-language works237,207