A penalized likelihood based pattern classification algorithm
From MaRDI portal
Publication:2270740
DOI10.1016/j.patcog.2009.04.016zbMath1175.68351OpenAlexW2128425293MaRDI QIDQ2270740
Publication date: 29 July 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10453/8935
pattern classificationposterior probabilitypenalized likelihood\(K\)-nearest neighborclass balancingweighted KNN
Related Items
Uses Software
Cites Work
- Measuring the Accuracy of Diagnostic Systems
- A Note on Distance-Weighted k-Nearest Neighbor Rules
- Local Regression and Likelihood
- Bayesian Smoothing and Regression Splines for Measurement Error Problems
- The Laplacian Classifier
- A Probabilistic Nearest Neighbour Method for Statistical Pattern Recognition
- Estimating the Posterior Probabilities Using the K-Nearest Neighbor Rule
- Penalized likelihood regression: General formulation and efficient approximation
- Soft and hard classification by reproducing kernel Hilbert space methods
- Robust classification for imprecise environments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A penalized likelihood based pattern classification algorithm