Exclusive lasso-based k-nearest-neighbor classification

Lin Qiu, Yanpeng Qu*, Changjing Shang, Longzhi Yang, Fei Chao, Qiang Shen

*Awdur cyfatebol y gwaith hwn

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

500 Wedi eu Llwytho i Lawr (Pure)


Conventionally, the k nearest-neighbor (kNN) classification is implemented with the use of the Euclidean distance-based measures, which are mainly the one-to-one similarity relationships such as to lose the connections between different samples. As a strategy to alleviate this issue, the coefficients coded by sparse representation have played a role of similarity gauger for nearest-neighbor classification as well. Although SR coefficients enjoy remarkable discrimination nature as a one-to-many relationship, it carries out variable selection at the individual level so that possible inherent group structure is ignored. In order to make the most of information implied in the group structure, this paper employs the exclusive lasso strategy to perform the similarity evaluation in two novel nearest-neighbor classification methods. Experimental results on both benchmark data sets and the face recognition problem demonstrate that the EL-based kNN method outperforms certain state-of-the-art classification techniques and existing representation-based nearest-neighbor approaches, in terms of both the size of feature reduction and the classification accuracy.
Iaith wreiddiolSaesneg
Tudalennau (o-i)14247-14261
Nifer y tudalennau15
CyfnodolynNeural Computing and Applications
Rhif cyhoeddi21
Dyddiad ar-lein cynnar10 Mai 2021
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 01 Tach 2021

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Exclusive lasso-based k-nearest-neighbor classification'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn