Study on the Hungarian algorithm for the maximum likelihood data association problem
From MaRDI portal
Publication:3395375
DOI10.1016/S1004-4132(07)60045-0zbMATH Open1452.62176OpenAlexW1908058122MaRDI QIDQ3395375FDOQ3395375
Peikun He, Wei Coo, Jianguo Wang
Publication date: 1 September 2009
Published in: Journal of Systems Engineering and Electronics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1004-4132(07)60045-0
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear programming (90C05) Missing data (62D10)
This page was built for publication: Study on the Hungarian algorithm for the maximum likelihood data association problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395375)
