MétaCan
Menu
Back to cohort
Record W118196362

Type-II Fuzzy Possibilistic C-Mean Clustering

2009· article· en· W118196362 on OpenAlexaff
Mohammad Hossein Fazel Zarandi, Marzieh Zarinbal, İ.B. Türkşen

Bibliographic record

VenueEuropean Society for Fuzzy Logic and Technology Conference · 2009
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Clustering Algorithms Research
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMahalanobis distanceFuzzy logicCluster analysisFuzzy clusteringMathematicsData miningFuzzy numberFuzzy classificationFuzzy set operationsEuclidean distanceArtificial intelligenceFuzzy setPattern recognition (psychology)Computer science
DOInot available

Abstract

fetched live from OpenAlex

Fuzzy clustering is well known as a robust and efficient way to reduce computation cost to obtain the better results. In the literature, many robust fuzzy clustering models have been presented such as Fuzzy C-Mean (FCM) and Possibilistic C-Mean (PCM), where these methods are Type-I Fuzzy clustering. Type-II Fuzzy sets, on the other hand, can provide better performance than Type-I Fuzzy sets, especially when many uncertainties are presented in real data. The focus of this paper is to design a new Type-II Fuzzy clustering method based on Krishnapuram and Keller PCM. The proposed method is capable to cluster Type-II fuzzy data and can obtain the better number of clusters (c) and degree of fuzziness (m) by using Type-II Kwon validity index. In the proposed method, two kind of distance measurements, Euclidean and Mahalanobis are examined. The results show that the proposed model, which uses Mahalanobis distance based on Gustafson and Kessel approach is more accurate and can efficiently handle uncertainties. Keywords— Type-II Fuzzy Logic; Possibilistic C-Mean (PCM); Mahalanobis Distance; Cluster Validity Index;

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.007
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0030.003
Science and technology studies0.0020.001
Scholarly communication0.0030.002
Open science0.0030.001
Research integrity0.0030.001
Insufficient payload (model declined to judge)0.0020.001

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.035
GPT teacher head0.290
Teacher spread0.255 · 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

Citations26
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueEuropean Society for Fuzzy Logic and Technology ConferenceSame topicAdvanced Clustering Algorithms ResearchFrench-language works237,207