Nearest feature line classifier based on collaborative representation with nearest neighbour search algorithm
Abstract Nearest feature line is an effective classification algorithm. However, if a test sample cannot be linear represented by the training samples, the algorithm may not work very well. Moreover, another problem is that it will have a large computation complexity. Therefore, the authors propose...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Wiley
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/5ac79b9207124319a05bb0c70d971274 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Abstract Nearest feature line is an effective classification algorithm. However, if a test sample cannot be linear represented by the training samples, the algorithm may not work very well. Moreover, another problem is that it will have a large computation complexity. Therefore, the authors propose a novel algorithm. To begin with, the test sample is linear represented by all the training samples, and the errors between the test sample and every training sample are calculated. The authors only keep the training samples with small errors. In this way, on the one hand, training samples are not suitable for the test sample will be ignored, on the other hand, running time can be reduced. To further reduce the computing time of the algorithm, nearest neighbour search technique is applied to the algorithm. Experiments on numerical and image database show the algorithm cannot only improve the classification accuracy, but also reduce runtime. |
|---|