A ranked linear assignment approach to Bayesian classification

DOI10.1016/J.AMC.2003.12.136zbMath1090.90118OpenAlexW2107595908MaRDI QIDQ1763274

Roy Danchick

Publication date: 22 February 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.12.136

zbMATH Keywords

Bayesian classificationProbabilityLinear assignment problemRanked assignments

Mathematics Subject Classification ID

Stochastic models in economics (91B70) Discrete location and assignment (90B80)

Related Items (1)

On determining the unknown band-parameter and truncated sinc series coefficients from a time sampled band-limited function

Cites Work

• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

This page was built for publication: A ranked linear assignment approach to Bayesian classification