MétaCan
Menu
Back to cohort
Record W2598739430 · doi:10.1073/pnas.1702654114

Consistent and powerful graph-based change-point test for high-dimensional data

2017· article· en· W2598739430 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.

Bibliographic record

VenueProceedings of the National Academy of Sciences · 2017
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Inference
Canadian institutionsYork UniversityThompson Rivers University
FundersNatural Sciences and Engineering Research Council of CanadaGovernment of Canada
KeywordsComputer scienceMultivariate statisticsGraphGeneralizationChange detectionAlgorithmPoint (geometry)Artificial intelligencePattern recognition (psychology)MathematicsStatisticsMachine learningTheoretical computer scienceGeometry

Abstract

fetched live from OpenAlex

Significance Change-point detection in high-dimensional time series is necessary in many areas of science and engineering, including neuroscience, signal processing, network evolution, image analysis, and text analysis. In terms of a multivariate generalization of the Wald–Wolfowitz run test using the shortest Hamiltonian path, this paper proposes a distribution-free, consistent graph-based change-point detection for high-dimensional data. Once a change-point is detected, its location is estimated by using ratio cut. The test is very powerful against alternatives with a shift in mean or variance and is accurate in change-point estimation. Its applicability is demonstrated in the example of tracking cell division.

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.002
metaresearch head score (Gemma)0.016
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.196
Threshold uncertainty score0.992

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.016
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.323
GPT teacher head0.435
Teacher spread0.113 · 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