Maxima units search (MUS) algorithm: methodology and applications

DOI10.1007/978-3-319-73906-9_7MaRDI QIDQ1627893zbMATH OpenOpenAlexFDO

Authors Leonardo Egidi, Roberta Pappadà, Francesco Pauli, Nicola Torelli

Publication date 3 December 2018

Full work available at URL https://arxiv.org/abs/1611.01069

zbMATH Keywords

label switchingidentity matrixBayesian mixture modelspivotal unit

Mathematics Subject Classification ID

Bayesian inference (62F15) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Abstract: An algorithm for extracting identity submatrices of small rank and pivotal units from large and sparse matrices is proposed. The procedure has already been satisfactorily applied for solving the label switching problem in Bayesian mixture models. Here we introduce it on its own and explore possible applications in different contexts.

Recommendations

• scientific article; zbMATH DE number 1555941
• scientific article; zbMATH DE number 3277096
• The analytic hierarchy process, max algebra and multi-objective optimisation
• Memetic search for the max-bisection problem
• Optimum stable model search: algorithms and implementation
• The maximum feasible subset problem (maxFS) and applications
• scientific article; zbMATH DE number 1302198
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• An Efficient Memetic Algorithm for theMax-Bisection Problem

Cited in

(2)

• Relabelling in Bayesian mixture models by pivotal units
• Local-search extraction of mUSes

This page was built for publication: Maxima units search (MUS) algorithm: methodology and applications

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