MétaCan
Menu
Back to cohort
Record W2827016266 · doi:10.1109/cibcb.2018.8404974

Data driven point packing for fast clustering

2018· article· en· W2827016266 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
FieldEngineering
TopicOptimization and Packing Problems
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsCluster analysisComputer scienceMetric (unit)Data miningHierarchical clusteringCrossoverEuclidean distanceData fieldTheoretical computer scienceMetric spaceRepresentation (politics)Data pointAlgorithmSet (abstract data type)MathematicsArtificial intelligenceDiscrete mathematics

Abstract

fetched live from OpenAlex

Modern data acquisition has forced the field of large data on the scientific community. This papers gives a rapid technique for clustering data. The technique is based on an off-line process for packing points chosen from a data space. Once the off-line process has been run, the clustering may be re-run on different data sets of the same type in linear time. The clustering takes the form of a Voronoi tiling of the data space with the tile centres being the elements of the point packing. The data items within each tile form the clusters. The evolutionary algorithm is an adaptation of one, based on the Conway crossover operator, that has been used to create error correcting codes over the Levenstein metric; the tile centres are a form of code, but over the Euclidean metric. The technique generalizes smoothly to other metric spaces and may be used on any type of data for which a distance metric can be devised. The data set used in this study captures information about codon usage bias in human genes. The clustering is validated by looking for GO term over- representation in the clusters, with significant results.

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: none
Teacher disagreement score0.843
Threshold uncertainty score0.283

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.000
Open science0.0000.000
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.051
GPT teacher head0.276
Teacher spread0.225 · 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

Citations5
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicOptimization and Packing ProblemsFrench-language works237,207