MétaCan
Menu
Back to cohort
Record W4388918078 · doi:10.1016/j.ifacol.2023.10.785

Robust Complex Probabilistic Slow Feature Analysis in the Presence of Skewed Measurement Noise

2023· article· en· W4388918078 on OpenAlexaff
Vamsi Krishna Puli, Ranjith Chiplunkar, Biao Huang

Bibliographic record

VenueIFAC-PapersOnLine · 2023
Typearticle
Languageen
FieldEngineering
TopicFault Detection and Control Systems
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsOutlierFeature (linguistics)Noise (video)Computer scienceMaximizationPattern recognition (psychology)Probabilistic logicGaussian noiseArtificial intelligenceExpectation–maximization algorithmAlgorithmMathematicsStatisticsMathematical optimizationMaximum likelihood

Abstract

fetched live from OpenAlex

Complex slow feature analysis is a feature extraction technique that extracts slow oscillating patterns from the measured data. The measurement noise is usually assumed to follow a Gaussian distribution to obtain a closed-form solution. However, industrial process data is often characterized by measurement issues such as outliers, including asymmetric measurement noise. Such issues reduce the performance of the extracted features if not accounted for explicitly. Therefore, this article proposes a novel robust complex slow feature model to tackle the mentioned issues. In particular, this work considers a Skewed t-distribution for the measurement noise of the complex slow feature model. The parameters of the Skewed t-distribution, especially the degree of freedom and the shape parameters, account for the outliers and the asymmetric nature of the measurement noise. The parameters of the proposed model are jointly estimated using the expectation-maximization algorithm. The efficiency of the approach is demonstrated using simulated and industrial data.

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.002
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
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.042
GPT teacher head0.239
Teacher spread0.196 · 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 designTheoretical or conceptual
Domainnot available
GenreMethods

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
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueIFAC-PapersOnLineSame topicFault Detection and Control SystemsFrench-language works237,207