Trading off distance metrics vs accuracy in incremental learning algorithms

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the growth and development of data, the empirical evidence supporting a link between the distance metrics that are used in the instance-based algorithms and generalization has been mounting. In this paper, we look at distinct similarity measures to study its impact on the performance accuracy of incremental instance-based algorithms in pattern recognition problems. An in-depth analysis of the results of the proposed study for a variety of classification tasks (binary and multiway) from various different domains shines light on the trade off between the distance metrics and yielded accuracy.

Cite

CITATION STYLE

APA

Lopes, N., & Ribeiro, B. (2017). Trading off distance metrics vs accuracy in incremental learning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10125 LNCS, pp. 530–538). Springer Verlag. https://doi.org/10.1007/978-3-319-52277-7_64

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