MétaCan
Menu
Back to cohort
Record W4400811537 · doi:10.1109/csci62032.2023.00024

Three-Way Clustering: An Advanced Soft Clustering Approach

2023· article· en· W4400811537 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 Regina
Fundersnot available
KeywordsCluster analysisComputer scienceData miningArtificial intelligence

Abstract

fetched live from OpenAlex

Clustering is a machine learning technique that assigns unlabelled data points into different groups based on similarity of data. However, in many cases, we are unable to confidently assign data points to particular clusters. Soft clustering introduces a probability of the data points belonging to different clusters. Three-way clustering is a recent development of soft clustering based on three-way decisions. In particular, each data point is assigned a value to represent if it is inside, outside, or partially inside a cluster. There are two types of three-way clustering techniques, namely, evaluation-based approaches and operation-based approaches. The evaluation-based approaches rely on a membership function to calculate the degree of a data point belonging to a cluster. The operator-based approaches use a pair of operators to construct a three-way cluster from a hard two-way cluster. We will introduce, review, and analyse various three-way clustering techniques in this paper. In addition, the history of three-way clustering and the future development of three-way clustering will also be discussed.

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 categoriesMeta-epidemiology (narrow)
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.812
Threshold uncertainty score1.000

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.002
Science and technology studies0.0000.000
Scholarly communication0.0000.002
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.055
GPT teacher head0.322
Teacher spread0.268 · 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

Citations4
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207