REVIEW
Fast Identification of Transients: Applying Expectation Maximization to Neutrino Data
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Fast Identification of Transients: Applying Expectation Maximization to Neutrino Data
read the original abstract
We present a novel method for identifying transients suitable for both strong signal-dominated and background-dominated objects. By employing the unsupervised machine learning algorithm known as Expectation Maximization, we achieve computing time reductions of over $10^4$ on a single CPU compared to conventional brute-force methods. Furthermore, this approach can be readily extended to analyze multiple flares. We illustrate the algorithm's application by fitting the IceCube neutrino flare of TXS 0506+056.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.