MétaCan
Menu
Back to cohort
Record W2012187238 · doi:10.1109/isspa.2012.6310493

Improving X-means clustering with MNDL

2012· article· en· W2012187238 on OpenAlexaff
Mahdi Shahbaba, Soosan Beheshti

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Clustering Algorithms Research
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsCluster analysisBayesian information criterionDetermining the number of clusters in a data setComputer scienceCorrelation clusteringSingle-linkage clusteringSet (abstract data type)Cluster (spacecraft)Data miningCURE data clustering algorithmMathematicsAlgorithmArtificial intelligence

Abstract

fetched live from OpenAlex

Estimating the true number of clusters for an unlabeled data set is one of the most important limitations in clustering. To solve this issue, many approaches with different assumptions have been proposed in the literature. X-means clustering is one of the proposed methods, which employs Bayesian Information Criterion (BIC) to approximate the correct number of clusters. In this paper, we propose the use of Minimum Noiseless Description Length (MNDL) as a cluster splitting criterion for X-means clustering. MNDL is able to find the optimum splitting criterion for X-means clustering. Simulation results demonstrate that MNDL splitting criterion has the same computational complexity as BIC but, predicts the true number of clusters more often.

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.004
metaresearch head score (Gemma)0.012
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: Methods · Consensus signal: Methods
Teacher disagreement score0.009
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0020.004
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0010.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.020
GPT teacher head0.275
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
GenreMethods

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

Citations15
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207