MétaCan
Menu
Back to cohort

Generalized Deep Embedded Fuzzy C-Means for Clustering High-Dimensional Data

2024· article· en· W4401331642 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Clustering Algorithms Research
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceCluster analysisFuzzy clusteringFuzzy logicArtificial intelligenceData miningClustering high-dimensional dataPattern recognition (psychology)

Abstract

fetched live from OpenAlex

Clustering is one of the fundamental techniques of machine learning. Its integration with deep neural networks allows for extracting robust feature representations and yielding better clustering results. Deep-embedded clustering algorithms employ external information to form auxiliary and target distributions minimized via KL divergence. This study introduces a Generalized Deep Embedded Fuzzy C-Means (GDeeFCM) algorithm that learns both feature representations and cluster assignments at the same time. The principal advantage of GDeeFCM is using the objective function of the clustering algorithm, FCM in our case, as the loss function to update the encoder weights and clusters center simultaneously without the need to adapt information from external sources. It is worth mentioning that FCM is selected for this study, but any clustering algorithm can be employed. Our model's performance is compared with similar structures that utilize t-SNE for soft label assignments and KL Divergence as the loss function. Experimental results on four image datasets demonstrate the effectiveness of our 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.878
Threshold uncertainty score0.679

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.001
Open science0.0020.003
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.060
GPT teacher head0.352
Teacher spread0.292 · 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
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207