MétaCan
Menu
Back to cohort
Record W2100405508 · doi:10.1109/nafips.2008.4531218

Discovering structure in labeled data

2008· article· en· W2100405508 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Clustering Algorithms Research
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCluster analysisComputer scienceHierarchical clusteringClass (philosophy)Similarity (geometry)Data miningMeasure (data warehouse)Cluster (spacecraft)Artificial intelligenceSimilarity measureData structurePattern recognition (psychology)Mathematics

Abstract

fetched live from OpenAlex

A novel approach based on supervised hierarchical clustering is developed with the purpose of discovering structure in data where labels are provided. Labels can come in the form of discrete-valued class labels or continuous-valued output variables to aid hierarchical clustering in discovering the structure and the number of clusters, in particular. In the proposed method, Clusters are linked together if their discrete-valued labels are the same or in the case of continuous output variables if their outputs are similar. Similarity within a cluster in the continuous case is expressed by a measure of internal cluster dispersion. Several experiments on synthetic data with discrete-valued class labels are conducted to demonstrate the algorithm's ability to discover class or data structure.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.902
Threshold uncertainty score0.360

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.083
GPT teacher head0.329
Teacher spread0.246 · 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

Citations0
Published2008
Admission routes2
Has abstractyes

Explore more

Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207