Improving the performance of the k rare class nearest neighbor classifier by the ranking of point patterns

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

Abstract

In most real life applications of classification, samples are imbalanced. Usually, this is due to the difficulty of data collection. Large margin, or instance based classifiers suffer a lot from sparsity of samples close to the dichotomy. In this work, we propose an improvement to a recent technique developed for rare class classification. The experimental results show a definite performance gain.

Cite

CITATION STYLE

APA

László, Z., Török, L., & Kovács, G. (2018). Improving the performance of the k rare class nearest neighbor classifier by the ranking of point patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10833 LNCS, pp. 265–283). Springer Verlag. https://doi.org/10.1007/978-3-319-90050-6_15

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