MétaCan
Menu
Back to cohort
Record W1575500644 · doi:10.3233/978-1-60750-606-5-169

Classification of Dreams Using Machine Learning

2010· book-chapter· en· W1575500644 on OpenAlexaff
Stan Matwin, Amir H. Razavi

Bibliographic record

VenueFrontiers in artificial intelligence and applications · 2010
Typebook-chapter
Languageen
FieldComputer Science
TopicData Stream Mining Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceArtificial intelligencePsychologyMachine learning

Abstract

fetched live from OpenAlex

We describe a project undertaken by an interdisciplinary team of researchers in sleep and in and machine learning. The goal is sentiment extraction from a corpus containing short textual descriptions of dreams. Dreams are categorized in a four-level scale of affections. The approach is based on a novel representation, taking into account the leading themes of the dream and the sequential unfolding of associated affective feelings during the dream. The dream representation is based on three combined parts, two of which are automatically produced from the description of the dream. The first part consists of co-occurrence vectors, which — unlike the standard Bag-of-words model — capture non-local relationships between meanings of word in a corpus. The second part introduces the dynamic representation that captures the change in affections throughout the progress of the dream. The third part is the self-reported assessment of the dream by the dreamer according to eight given attributes. The three representations are subject to aggressive feature selection. Using an ensemble of classifiers and the combined 3-partite representation, we have achieved 64% accuracy, which is in the range of human experts' consensus in that domain.

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.003
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.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
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.060
GPT teacher head0.298
Teacher spread0.238 · 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

Citations4
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueFrontiers in artificial intelligence and applicationsSame topicData Stream Mining TechniquesFrench-language works237,207