An adaptive nearest neighbor classification algorithm for data Streams

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

This article is free to access.

Abstract

In this paper, we propose an incremental classification algorithm which uses a multi-resolution data representation to find adaptive nearest neighbors of a test point. The algorithm achieves excellent performance by using small classifier ensembles where approximation error bounds are guaranteed for each ensemble size. The very low update cost of our incremental classifier makes it highly suitable for data stream applications. Tests performed on both synthetic and real-life data indicate that our new classifier outperforms existing algorithms for data streams in terms of accuracy and computational costs. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Law, Y. N., & Zaniolo, C. (2005). An adaptive nearest neighbor classification algorithm for data Streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3721 LNAI, pp. 108–120). https://doi.org/10.1007/11564126_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