MétaCan
Menu
Back to cohort
Record W2745341688 · doi:10.1190/segam2017-17740437.1

Computational efficient multidimensional singular spectrum analysis

2017· article· en· W2745341688 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.
fundA Canadian funder is recorded on the work.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicStatistical and numerical algorithms
Canadian institutionsUniversity of Alberta
FundersUniversity of Alberta
KeywordsComputer scienceSingular spectrum analysisSpectrum (functional analysis)AlgorithmSingular value decompositionPhysics

Abstract

fetched live from OpenAlex

We present a computational efficient multi-dimensional Singular Spectrum Analysis method for the recovery and de-noising of multi-dimensional seismic data. Compared to the other implementations of Singular Spectrum Analysis method, the proposed algorithm does not require building multi-level block Hankel trajectory matrices. The key is to replace the singular value decomposition of a multi-level block Hankel matrix by the randomized QR decomposition. We also present a new strategy in which anti-diagonal averaging of the multi-level block Hankel matrix is efficiently computed via convolution. The new algorithm significantly decreases the computational cost and memory requirement of Singular Spectrum Analysis data recovery. We test the effectiveness of the method through reconstructing a small patch of a real data set acquired at the Western Canadian Sedimentary Basin. Presentation Date: Wednesday, September 27, 2017 Start Time: 4:20 PM Location: 360A Presentation Type: ORAL

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.677
Threshold uncertainty score1.000

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.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.036
GPT teacher head0.334
Teacher spread0.298 · 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

Quick stats

Citations1
Published2017
Admission routes3
Has abstractyes

Explore more

Same topicStatistical and numerical algorithmsFrench-language works237,207