A ranked linear assignment approach to Bayesian classification

DOI10.1016/J.AMC.2003.12.136MaRDI QIDQ1763274zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Publication:4733228
• scientific article; zbMATH DE number 2079781
• scientific article; zbMATH DE number 1759563
• A new probabilistic approach in rank regression with optimal Bayesian partitioning
• A Bayesian decision theory approach to classification problems
• Bayesian rank penalization
• Bayesian procedure in a class of classification problems

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

Cited in

(4)

• On determining the unknown band-parameter and truncated sinc series coefficients from a time sampled band-limited function
• scientific article; zbMATH DE number 4022343 (Why is no real title available?)
• Bayesian object matching
• Statistical applications of linear assignment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763274)