MétaCan
Menu
Back to cohort
Record W4411799602 · doi:10.1109/lsp.2025.3584670

A Novel Evaluation Criterion for Density Clustering via Circular Information Granules

2025· article· en· W4411799602 on OpenAlexaff
Sheng Du, Cheng Huang, Zixin Huang, Witold Pedrycz

Bibliographic record

VenueIEEE Signal Processing Letters · 2025
Typearticle
Languageen
FieldComputer Science
TopicText and Document Classification Technologies
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsCluster analysisMathematicsComputer sciencePattern recognition (psychology)Probability density functionData miningArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Density clustering is a pivotal algorithm for data clustering and analysis, finding extensive and significant industrial application. There are two key adjustable parameters in density clustering: cluster radius and minimum number of cluster points. At present, the selection of more suitable parameters predominantly depends on statistical methods and analysis, which lacks a precise and effective evaluation criterion. In this paper, a novel evaluation criterion for density clustering via circular information granules is proposed. It constructs circular information granules based on the density clustering results through the principle of justifiable granularity, and then finds the largest sum of volumes of circular information granules. Consequently, it determines the optimal clustering radius and the minimum number of clustering points. Experimental results show that the proposed method provides a more comprehensive evaluation of density clustering results compared to the existing evaluation criterion.

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.013
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.013
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0050.003
Science and technology studies0.0010.002
Scholarly communication0.0030.004
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.027
GPT teacher head0.281
Teacher spread0.254 · 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 designTheoretical or conceptual
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

Citations2
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Signal Processing LettersSame topicText and Document Classification TechnologiesFrench-language works237,207