Published on Sun Dec 07 2008

A Novel Clustering Algorithm Based on Quantum Random Walk

Qiang Li, Yan He, Jing-ping Jiang

Quantum random walk (QRW) and the problem of data clustering. We develop two clustering algorithms based on the one dimensional QRW. The probability distributions on the positions induced by QRW are investigated.

0
0
0
Abstract

The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one dimensional QRW. Then, the probability distributions on the positions induced by QRW in these algorithms are investigated, which also indicates the possibility of obtaining better results. Consequently, the experimental results have demonstrated that data points in datasets are clustered reasonably and efficiently, and the clustering algorithms are of fast rates of convergence. Moreover, the comparison with other algorithms also provides an indication of the effectiveness of the proposed approach.

Thu Feb 14 2019
Machine Learning
A Probabilistic framework for Quantum Clustering
Quantum Clustering is a powerful method to detect clusters in data with mixed density. It is very sensitive to a length parameter that is inherentto the Schr\"odinger equation. We propose a probabilistic framework that provides an objective function for the goodness-of-fit to data.
0
0
0
Tue Mar 19 2019
Machine Learning
A Quantum Annealing-Based Approach to Extreme Clustering
Clustering, or grouping, dataset elements based on similarity can be used not only to classify a dataset into a few categories, but also to approximate it by a relatively large number of representative elements. In the latter scenario, often referred to as extreme clustering, datasets are enormous and the
0
0
0
Sat Aug 09 2014
Artificial Intelligence
Quantum Annealing for Clustering
This paper studies quantum annealing (QA) for clustering. We derive a QA algorithm for clustering and propose a schedule. Experiments show the proposed algorithm finds better clustering assignments than SA.
0
0
0
Thu May 21 2009
Machine Learning
Quantum Annealing for Clustering
This paper studies quantum annealing (QA) for clustering. We derive a QA algorithm for clustering and propose a schedule. Experiments show the proposed algorithm finds better clustering assignments than SA.
0
0
0
Thu Oct 30 2008
Artificial Intelligence
A Novel Clustering Algorithm Based on a Modified Model of Random Walk
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space. As they move in space, some separating parts emerge among them.
0
0
0
Wed Feb 08 2017
Machine Learning
Clustering For Point Pattern Data
Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. The first is a non-parametric method based on novel distances for sets. The second is a model-based approach, formulated via random finite set theory.
0
0
0