This paper introduces a new local asymmetric weighting scheme for the nearest neighbour classification algorithm. It is shown both with theoretical arguments and computer experiments that good compression rates can be achieved outperforming the accuracy of the standard nearest neighbour classification algorithm and obtaining almost the same accuracy as the k-NN algorithm with k optimised in each data set. Moreover, the learning procedure, based on reinforcement, is quite robust against suboptimal choices of the reinforcement, punishment and compression paramenters

Exact Learning and Data Compression with a Local Asymmetrically Weighted Metric

Ricci, Francesco;Avesani, Paolo
1996

Abstract

This paper introduces a new local asymmetric weighting scheme for the nearest neighbour classification algorithm. It is shown both with theoretical arguments and computer experiments that good compression rates can be achieved outperforming the accuracy of the standard nearest neighbour classification algorithm and obtaining almost the same accuracy as the k-NN algorithm with k optimised in each data set. Moreover, the learning procedure, based on reinforcement, is quite robust against suboptimal choices of the reinforcement, punishment and compression paramenters
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11582/1189
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
social impact