MétaCan
Menu
← Back to cohort
Record W4212884605 · doi:10.1002/cjce.24387

Fault clustering by small‐entropy nonnegative matrix factorizations

2022· article· en· W4212884605 on OpenAlexvenueno aff
Qilong Jia

Bibliographic record

VenueThe Canadian Journal of Chemical Engineering · 2022
Typearticle
Languageen
FieldEngineering
TopicFault Detection and Control Systems
Canadian institutionsnot available
Fundersnot available
KeywordsCluster analysisCorrelation clusteringCURE data clustering algorithmFuzzy clusteringk-medians clusteringData miningEntropy (arrow of time)Determining the number of clusters in a data setMathematicsComputer scienceSingle-linkage clusteringData stream clusteringCanopy clustering algorithmPattern recognition (psychology)AlgorithmArtificial intelligencePhysics

Abstract

fetched live from OpenAlex

Abstract Fault clustering attempts to partition a set of faulty samples into several clusters, allowing the exploration of the underlying pattern of faults. Nonnegative matrix factorizations (NMFs) are good candidates for fault clustering since they are inherently capable of data clustering and variants of the ‐means algorithm. However, NMFs always show poor performance in real‐world clustering applications for their naive data clustering mechanism. To improve the clustering performance of the existing NMFs and solve the fault clustering problem, this paper proposes a new type of NMFs, called small‐entropy nonnegative matrix factorizations (SENMFs). SENMFs impose a small amount of entropy on the cluster probability distribution of each sample to avoid ambiguous clustering results. Moreover, the algorithm for SENMFs is convergent in theory. We selected three types of faulty samples of the penicillin fermentation process for fault clustering. The case study results showed that SENMFs exceed the state‐of‐the‐art NMFs and ‐means in terms of fault clustering performance.

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.007
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.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.006
GPT teacher head0.180
Teacher spread0.174 · 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

Citations0
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueThe Canadian Journal of Chemical Engineering→Same topicFault Detection and Control Systems→French-language works237,207→