Evolutionary algorithm for large margin nearest neighbour regression

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The concept of a large margin is central to support vector machines and it has recently been adapted and applied for nearest neighbour classification. In this paper, we suggest a modification of this method in order to be used for regression problems. The learning of a distance metric is performed by means of an evolutionary algorithm. Our technique allows the use of a set of prototypes with different distance metrics, which can increase the flexibility of the method especially for problems with a large number of instances. The proposed method is tested on a real world problem – the prediction of the corrosion resistance of some alloys containing titanium and molybdenum – and provides very good results.

Cite

CITATION STYLE

APA

Leon, F., & Curteanu, S. (2015). Evolutionary algorithm for large margin nearest neighbour regression. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9329, pp. 305–315). Springer Verlag. https://doi.org/10.1007/978-3-319-24069-5_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free