k-Nearest Neighbor Classification Algorithm Based on Hubness and Class Weighting

Aiming at the problem of dimensionality curse and unbalance distribution in high dimensional unbalance data,an improved k-Nearest Neighbor(kNN) classification algorithm named HWNN is proposed.The k-occur of samples are regarded as the support for each class at the time of prediction,on this way,the...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autor: LI Jinmeng,LIN Yaping,ZHU Tuanfei
Médium: Artigo
Jazyk:Inglês
Vydáno: Editorial Office of Computer Engineering 2018-04-01
Edice:Jisuanji gongcheng
Témata:
hubness phenomenon|high-dimensional and unbalanced data|dimensionality curse|data classification|k-occur|k-nearest neighbor(knn) classification
On-line přístup:https://www.ecice06.com/fileup/1000-3428/PDF/201804040.pdf
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!

Podobné jednotky