Discriminant analysis and density estimation on the finite d-dimensional grid
From MaRDI portal
Publication:1351087
DOI10.1016/0167-9473(95)00039-9zbMath0900.62315OpenAlexW2064937573MaRDI QIDQ1351087
Publication date: 27 February 1997
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-9473(95)00039-9
EM algorithmMarkov random fieldNearest neighboursGibbs potentialPenalized likelihoodAdaptive bandwidthKernel density estimatesLeaving-one-outSparse consistency
Random fields; image analysis (62M40) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic methods, stochastic differential equations (65C99)
Cites Work
- A penalty function approach to smoothing large sparse contingency tables
- Bayesian filtering and supervised classification in image remote sensing
- Density estimation on a finite regular lattice
- Parameter estimation for hidden Gibbs chains
- On a class of nonparametric density and regression estimators
- Probability estimation via smoothing in sparse contingency tables with ordered categories
- Nonparametric probability density estimation by discrete maximum penalized-likelihood criteria
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
- Clustering, classification and image segmentation on the grid
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Spatial classification using fuzzy membership models
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item