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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.