MétaCan
Menu
Back to cohort
Record W2383655229

A KNN Algorithm by Adopting Class Correlation to Optimize Distance

2010· article· en· W2383655229 on OpenAlexvenueno aff
Jinsheng Liu

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.

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.003
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.011
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.004
Science and technology studies0.0020.001
Scholarly communication0.0020.003
Open science0.0020.001
Research integrity0.0020.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.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

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 designBench or experimental
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

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicAdvanced Algorithms and ApplicationsFrench-language works237,207