Classification based on multiple-resolution data view

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

Abstract

We examine efficacy of a classifier based on average of kernel density estimators; each estimator corresponds to a different data " resolution". Parameters of the estimators are adjusted to minimize the classification error. We propose properties of the data for which our algorithm should yield better results than the basic version of the method. Next, we generate data with postulated properties and conduct numerical experiments. Analysis of the results shows potential advantage of the new algorithm when compared with the baseline classifier. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kobos, M., & Mańdziuk, J. (2010). Classification based on multiple-resolution data view. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6354 LNCS, pp. 124–129). https://doi.org/10.1007/978-3-642-15825-4_16

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