MétaCan
Menu
Back to cohort
Record W2129192715 · doi:10.1109/foci.2007.371525

Likelihood Based Fuzzy Clustering for Data Sets of Mixed Features

2007· article· en· W2129192715 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 institutionsThompson Rivers University
Fundersnot available
KeywordsFuzzy clusteringCluster analysisFLAME clusteringCorrelation clusteringCanopy clustering algorithmCURE data clustering algorithmComputer scienceData miningData stream clusteringPattern recognition (psychology)Feature (linguistics)Artificial intelligenceAlgorithmMathematics

Abstract

fetched live from OpenAlex

A noble clustering algorithm is presented for data sets of mixed features: numerical, ordinal and nominal. The algorithm uses the concept of fuzzy clustering to reduce negative effect from noises, and uses the iterative partitional algorithm founded on an optimization function to reduce the time complexity. The optimization function uses the likelihood for each individual feature as the optimization criterion of the similarity or likeliness between patterns and clusters, not like the fuzzy c-means clustering algorithm based on distance or the EM clustering algorithm. Hence the algorithm can quickly find fuzzy clusters having different distributions in the each feature level. The simulations show the algorithm to be quite efficient

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.983
Threshold uncertainty score0.478

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.0020.001
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.055
GPT teacher head0.360
Teacher spread0.304 · 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

Citations2
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207