Abstract: We introduce a new class of “maximization-expectation” (ME) algorithms where we maximize over hidden variables but marginalize over random parameters. This reverses the roles of expectation ...

Abstract: This paper gives an example of a novel simple implementation of the EM algorithm for clustering images. Here we use a simple gray scale color feature to describe an image. When compared to ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.

In this example, we use the IceCat-1 catalog with IceCube neutrino alert events and look for temporal clustering at predefined positions. The positions are identified with the multiplet search (see ...