ETucker: a constrained tensor decomposition for single trial ERP extraction
Bibliographic record
Abstract
Abstract Objective. In this paper, we propose a new tensor decomposition to extract event-related potentials (ERP) by adding a physiologically meaningful constraint to the Tucker decomposition. Approach. We analyze the performance of the proposed model and compare it with Tucker decomposition by synthesizing a dataset. The simulated dataset is generated using a 12th-order autoregressive model in combination with independent component analysis (ICA) on real no-task electroencephalogram (EEG) recordings. The dataset is manipulated to contain the P300 ERP component and to cover different SNR conditions, ranging from 0 to −30 dB, to simulate the presence of the P300 component in extremely noisy recordings. Furthermore, in order to assess the practicality of the proposed methodology in real-world scenarios, we utilized the brain-computer interface (BCI) competition III-dataset II. Main results. Our primary results demonstrate the superior performance of our approach compared to conventional methods commonly employed for single-trial estimation. Additionally, our method outperformed both Tucker decomposition and non-negative Tucker decomposition in the synthesized dataset. Furthermore, the results obtained from real-world data exhibited meaningful performance and provided insightful interpretations for the extracted P300 component. Significance. The findings suggest that the proposed decomposition is eminently capable of extracting the target P300 component’s waveform, including latency and amplitude as well as its spatial location, using single-trial EEG recordings.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".