MétaCan
Menu
Back to cohort
Record W2383655229

A KNN Algorithm by Adopting Class Correlation to Optimize Distance

2010· article· en· W2383655229 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueMicrocomputer applications · 2010
Typearticle
Languageen
FieldEngineering
TopicAdvanced Algorithms and Applications
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceCorrelationk-nearest neighbors algorithmDistance correlationAlgorithmEntropy (arrow of time)Pearson product-moment correlation coefficientPattern recognition (psychology)Measure (data warehouse)Artificial intelligenceData miningMathematicsStatistics
DOInot available

Abstract

fetched live from OpenAlex

Definition of samples will directly impact on the accuracy and the efficiency of K-Nearest Neighbor algorithm(KNN).An algorithm adopting correlation to optimize distance is proposed,the algorithm takes the product between the Entropy of characteristic parameters and distribution probability of samples as the correlation for classification,and measure strength of impact on the classification for characteristic parameters according to correlation to calculate the distance between the samples.The contrast simulation experiment shows that compared with traditional KNN algorithm etc,the impacted algorithm adopting the degree of correlation to optimize distance raised the rate of accuracy enormously in classification,meanwhile it also maintains efficiency of classification.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.899
Threshold uncertainty score0.887

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.002
GPT teacher head0.200
Teacher spread0.197 · 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