Quantum Expectation-Maximization Algorithm

08/19/2019
by   Hideyuki Miyahara, et al.
0

Clustering algorithms are a cornerstone of machine learning applications. Recently, a quantum algorithm for clustering based on the k-means algorithm has been proposed by Kerenidis, Landman, Luongo and Prakash. Based on their work, we propose a quantum expectation-maximization (EM) algorithm for Gaussian mixture models (GMMs). The robustness and quantum speedup of the algorithm is demonstrated. We also show numerically the advantage of GMM over k-means for non-trivial cluster data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2017

Relaxation of the EM Algorithm via Quantum Annealing for Gaussian Mixture Models

We propose a modified expectation-maximization algorithm by introducing ...
research
07/28/2017

An Open Source C++ Implementation of Multi-Threaded Gaussian Mixture Models, k-Means and Expectation Maximisation

Modelling of multivariate densities is a core component in many signal p...
research
07/05/2021

UCSL : A Machine Learning Expectation-Maximization framework for Unsupervised Clustering driven by Supervised Learning

Subtype Discovery consists in finding interpretable and consistent sub-p...
research
03/30/2020

Spectral graph clustering via the Expectation-Solution algorithm

The stochastic blockmodel (SBM) models the connectivity within and betwe...
research
03/03/2019

Analysis of Gradient-Based Expectation-Maximization-Like Algorithms via Integral Quadratic Constraints

The Expectation-Maximization (EM) algorithm is one of the most popular m...
research
11/24/2014

Noise Benefits in Expectation-Maximization Algorithms

This dissertation shows that careful injection of noise into sample data...
research
08/29/2023

Bridging Distribution Learning and Image Clustering in High-dimensional Space

Distribution learning focuses on learning the probability density functi...

Please sign up or login with your details

Forgot password? Click here to reset