MétaCan
Menu
Back to cohort
Record W2112317819 · doi:10.1109/apccas.2008.4746001

Cluster validation for subspace clustering on high dimensional data

2008· article· en· W2112317819 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 institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsCluster analysisSubspace topologyComputer scienceClustering high-dimensional dataCluster (spacecraft)Data miningk-medians clusteringCorrelation clusteringSingle-linkage clusteringFuzzy clusteringCURE data clustering algorithmPattern recognition (psychology)Determining the number of clusters in a data setArtificial intelligence

Abstract

fetched live from OpenAlex

As an important issue in cluster analysis, cluster validation is the process of evaluating performance of clustering algorithms under varying input conditions. Many existing methods address clustering results of low-dimensional data. This paper presents new solution to the problem of cluster validation for subspace clustering on high dimensional data. We first propose two new measurements for the intra-cluster compactness and inter-cluster separation of subspace clusters. Based on these measurements and the conventional indices, three new cluster validity indices that can be applied to subspace clustering are presented. Combining with a soft subspace clustering algorithm, the new indices are used to determine the number of clusters in high dimensional data. The experimental results on synthetic and real world datasets have shown their effectiveness.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.463
Threshold uncertainty score0.535

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.002
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.110
GPT teacher head0.345
Teacher spread0.234 · 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
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207