Vertex finding by sparse model-based clustering
The application of sparse model-based clustering to the problem of primary vertex finding is discussed. The observed z-positions of the charged primary tracks in a bunch crossing are modeled by a Gaussian mixture. The mixture parameters are estimated via Markov Chain Monte Carlo (MCMC). Sparsity is...
| Main Authors: | , , |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
IOP Publishing
2016
|
| Online Access: | http://epub.wu.ac.at/6173/1/jop.pdf http://dx.doi.org/10.1088/1742-6596/762/1/012055 |