MétaCan
Menu
Retour à la cohorte
Enregistrement W2767994764

Conceptual Hierarchies Arise from the Dynamics of Learning and Processing: Insights from a Flat Attractor Network

2006· article· en· W2767994764 sur OpenAlexafffund
George S. Cree, Ken McRae, Christopher M. O’Connor

Notice bibliographique

RevueeScholarship (California Digital Library) · 2006
Typearticle
Langueen
DomainePsychology
ThématiqueChild and Animal Learning Development
Établissements canadiensWestern UniversityUniversity of Toronto
Organismes subventionnairesNatural Sciences and Engineering Research Council of CanadaNational Institutes of Health
Mots-clésSuperordinate goalsArtificial intelligenceSemantics (computer science)Categorical variablePriming (agriculture)Metric (unit)Natural language processingDynamics (music)Similarity (geometry)Concept learningCognitive scienceComputer scienceCognitive psychologyPsychologySocial psychologyMachine learning
DOInon disponible

Résumé

récupéré en direct d'OpenAlex

Conceptual Hierarchies Arise from the Dynamics of Learning and Processing: Insights from a Flat Attractor Network Christopher M. O’Connor (cmoconno@uwo.ca) Ken McRae (mcrae@uwo.ca) Department of Psychology, University of Western Ontario London, Ontario, Canada, N6A 6C2 George S. Cree (gcree@utsc.utoronto.ca) Department of Life Sciences, University of Toronto at Scarborough Toronto, Ontario, Canada, M1C 1A4 computed representations using a cosine similarity metric. The correlation between cosine and participants' rating of typicality was computed for each category. This correlation was high for most of the 20 superordinate categories, and predictions of typicality ratings were basically equivalent for the model and family resemblance. The structure of people's conceptual knowledge of concrete nouns has traditionally been viewed as hierarchical (Collins & Quillian, 1969). This has occurred primarily because human performance in many tasks (e.g., typicality rating and superordinate to exemplar priming) appear to implicate hierarchies. Thus hierarchies have been transported, rather transparently, into theories of the structure of knowledge. The goal of the present research is to show that behavior that, on the surface, appears to demand a hierarchical model can be simulated using a feature-based attractor network that contains a single level of semantics. In addition, this model provides insight into the role of similarity on the temporal dynamics of conceptual processing. Temporal Dynamics of Similarity A number of experiments have shown roughly equal superordinate to exemplar priming (fruit priming cherry) for high, medium, and low typicality exemplars. Paradoxically, other studies show that basic-level concepts must be highly similar to support priming (and attractor networks simulate these effects). We conducted an experiment in which we found that the magnitude of priming was indeed similar for high, medium and low typicality items. Priming simulations showed the same result. Unlike features of basic-level concepts, superordinate features are partially activated from a wordform, rather than being activated essentially to 1 or 0 (due to a superordinate's mapping from one wordform to many featural representations). Because the feature activations are on the active part of the sigmoidal function, it is easy for a network to move from a superordinate representation to the representation of one of its exemplars, resulting in equivalent priming effects regardless of typicality. Thus, the model's temporal dynamics provide novel insight into these seemingly inconsistent results. This research shows that a flat feature-based attractor network produces emergent behavior that accounts for human results that have previously been viewed as requiring a hierarchical representational structure. Network Architecture and Training The network mapped from 30 wordform nodes (representing spelling/sound of a word) to 2349 semantic feature nodes (there were no taxonomic features such as in the network; these were used to establish 20 superordinate categories). Each feature unit corresponded to a semantic feature (e.g., ) from McRae et al.’s (2005) norms. The feature nodes were fully inter-connected with no self-connections. Thus, no hierarchy was implemented transparently in the model. All 541 basic-level concepts were taken from the norms. Using continuous recurrent backpropagation, the network learned to map a 3-unit wordform for each basic-level concept to semantic features representing that concept. Superordinate concept learning was more complex because there were no unique target representations for them. On each superordinate learning trial, a wordform was paired with the representation of one of its exemplars. For example fruit was paired with the features of apple on one trial, cherry on another, etc. Crucially, exemplar representations were paired with the corresponding superordinate wordform equally often, so that typicality was not built into the training regime, and the network developed superordinate representations based on experience with the exemplars. Acknowledgments This research was supported by NSERC OGP0155704 and NIH DC0418 and MH6051701 grants to Ken McRae. References Collins, A. M., & Quillian, M. R. (1969). Retrieval time from semantic memory. Journal of Verbal Learning and Verbal Behavior, 8, 240-247. McRae, K., Cree, G. S., Seidenberg, M. S., & McNorgan, C. (2005). Semantic feature production norms for a large set of living and nonliving things. Behavior Research Methods, 37, 547-559. Typicality Any model of this sort must account for typicality ratings. This was simulated by computing the meaning of a superordinate (e.g., fruit), computing the meaning of an exemplar (e.g., cherry), then calculating the similarity of the

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction machine sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.

score de la tête « metaresearch » (Codex)0,000
score de la tête « metaresearch » (Gemma)0,002
Version: metacan-v3-hybrid-931329e0061cStatut de validation: machine_predicted_unvalidated
Catégories candidatesaucune
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Simulation ou modélisation · Signal consensuel: aucune
GenreSignal candidat: Empirique · Signal consensuel: Empirique
Score de désaccord entre enseignants0,003
Score d'incertitude au seuil0,009

Scores du classifieur distillé par catégorie (deux têtes)

CatégorieCodexGemma
Métarecherche0,0000,002
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0000,000
Bibliométrie0,0000,000
Études des sciences et des technologies0,0000,001
Communication savante0,0010,002
Science ouverte0,0000,001
Intégrité de la recherche0,0000,000
Charge utile insuffisante (le modèle a refusé de juger)0,0030,000

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,011
Tête enseignante GPT0,216
Écart entre enseignants0,205 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.

Les modèles n’ont appliqué aucune catégorie : rien dans la taxonomie ne correspondait à ce travail.
Devis d'étudeSimulation ou modélisation
Domainenon disponible
GenreEmpirique

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations5
Publié2006
Routes d'admission2
Résumé présentoui

Explorer davantage

Même revueeScholarship (California Digital Library)Même sujetChild and Animal Learning DevelopmentTravaux en français237 207