Open Access
Multiple Resolution Nonparametric Classifiers
David Laurence Beck
- 01 Jan 2006
TL;DR: This work presents the Multiple Resolution Nonparametric (MRN) classifier as a new approach for significantly reducing the computational cost of using Parzen-window density estimates without sacrificing the virtues of Bayesian discriminant functions.
read more
Abstract: Bayesian discriminant functions provide optimal classification decision boundaries in the sense of minimizing the average error rate. An operational assumption is that the probability density functions for the individual classes are either known a priori or can be estimated from the data through the use of estimating techniques. The use of Parzen- windows is a popular and theoretically sound choice for such estimation. However, while the minimal average error rate can be achieved when combining Bayes Rule with Parzen-window density estimation, the latter is computationally costly to the point where it may lead to unacceptable run-time performance. We present the Multiple Resolution Nonparametric (MRN) classifier as a new approach for significantly reducing the computational cost of using Parzen-window density estimates without sacrificing the virtues of Bayesian discriminant functions. Performance is evaluated against a standard Parzen-window classifier on several common datasets.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Proceedings Article
The Relevance Vector Machine
Michael E. Tipping
- 29 Nov 1999
TL;DR: The Relevance Vector Machine is introduced, a Bayesian treatment of a generalised linear model of identical functional form to the SVM, and examples demonstrate that for comparable generalisation performance, the RVM requires dramatically fewer kernel functions.
Learning mixtures of Gaussians
Sanjoy Dasgupta
- 17 Oct 1999
TL;DR: This work presents the first provably correct algorithm for learning a mixture of Gaussians, which returns the true centers of the Gaussian to within the precision specified by the user with high probability.
Probability density estimation from optimally condensed data samples
Mark Girolami,Chao He +1 more
TL;DR: The Reduced Set Density Estimator is presented, which provides a kernel-based density estimator which employs a small percentage of the available data sample and is optimal in the L/sub 2/ sense.
Density-based multiscale data condensation
TL;DR: A nonparametric data reduction scheme that selects representative points in a multiscale fashion which is novel from existing density-based approaches and is empirically found that the algorithm is efficient in terms of sample complexity.
Weighted Parzen windows for pattern classification
G.A. Babich,Octavia Camps +1 more
TL;DR: The weighted-Parzen-window classifier requires less computation and storage than the full Parzen- window classifier, and Experimental results showed that significant savings could be achieved with only minimal, if any, error rate degradation for synthetic and real data sets.
129