MétaCan
Menu
Back to cohort
Record W2106859889 · doi:10.1109/icsmc.2007.4413722

Pre-shaped fuzzy c-means algorithm (PFCM) for transparent membership function generation

2007· article· en· W2106859889 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsnot available
FundersUniversity of AlbertaNational Aeronautics and Space Administration
KeywordsFuzzy logicMembership functionTransparency (behavior)AlgorithmCluster analysisComputer scienceFuzzy setProcess (computing)Function (biology)Data miningArtificial intelligence

Abstract

fetched live from OpenAlex

The fuzzy c-means algorithm (FCM) is widely used in the generation of membership functions from historical data. However, most of FCM-based membership function generation algorithms consider little on the transparency or the understandability of the resulting membership functions. In other words, there is inconsistency in generating membership functions using traditional FCM algorithm. This paper proposes a pre-shaped fuzzy c-means algorithm (PFCM) to generate more transparent membership functions. PFCM will preserve the predefined transparent shapes of membership functions during the process of the optimization of the clustering algorithm. Numeric experiments based on data collected in a real project demonstrate the feasibility and superiority of the proposed new algorithm.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.951
Threshold uncertainty score0.498

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.067
GPT teacher head0.300
Teacher spread0.233 · 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

Citations15
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207