MétaCan
Menu
Back to cohort
Record W2155874464 · doi:10.1109/icpr.2008.4761242

A novel validity measure for clusters of arbitrary shapes and densities

2008· article· en· W2155874464 on OpenAlexaff
Noha A. Yousri, Mohamed S. Kamel, Mohamed A. Ismail

Bibliographic record

VenueProceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · 2008
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Clustering Algorithms Research
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsMeasure (data warehouse)Cluster analysisComputer scienceCluster (spacecraft)Neighbourhood (mathematics)MathematicsAlgorithmData miningStatistical physicsArtificial intelligencePhysicsMathematical analysis

Abstract

fetched live from OpenAlex

Several validity indices have been designed to evaluate solutions obtained by clustering algorithms. Traditional indices are generally designed to evaluate center-based clustering, where clusters are assumed to be of globular shapes with defined centers or representatives. Therefore they are not suitable to evaluate clusters of arbitrary shapes and densities, where clusters have no defined centers or representatives, but formed based on the connectivity of patterns to their neighbours. In this work, a novel validity measure based on a density-based criterion is proposed. It is based on the concept that densities of clusters can be distinguished by the neighbourhood distances between patterns. It is suitable for clusters of any shapes and of different densities. The main concepts of the proposed measure are explained and experimental results that support the proposed measure are given.

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.014
metaresearch head score (Gemma)0.081
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.014
Threshold uncertainty score0.076

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0140.081
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0130.006
Science and technology studies0.0020.004
Scholarly communication0.0060.009
Open science0.0030.004
Research integrity0.0030.002
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.196
GPT teacher head0.328
Teacher spread0.132 · 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

Citations17
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueProceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern RecognitionSame topicAdvanced Clustering Algorithms ResearchFrench-language works237,207