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.
Maxima Units Search (MUS) Algorithm: Methodology and Applications
Egidi, Leonardo;PAPPADA', ROBERTA;PAULI, FRANCESCO;TORELLI, Nicola
2018-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
MUSSpringer18EgidiEtal.pdf
Accesso chiuso
Tipologia:
Documento in Versione Editoriale
Licenza:
Copyright Editore
Dimensione
960.9 kB
Formato
Adobe PDF
|
960.9 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
