A Quantum Annealing-Based Approach to Extreme Clustering

03/19/2019
by   Tim Jaschek, et al.
0

In this age of data abundance, there is a growing need for algorithms and techniques for clustering big data in an accurate and efficient manner. Well-known clustering methods of the past are computationally expensive, especially when employed to cluster massive datasets into a relatively large number of groups. The particular task of clustering millions (billions) of data points into thousands (millions) of clusters is referred to as extreme clustering. We have devised a distributed method, capable of being powered by a quantum processor, to tackle this clustering problem.

READ FULL TEXT
research
04/06/2017

An Online Hierarchical Algorithm for Extreme Clustering

Many modern clustering methods scale well to a large number of data item...
research
11/18/2019

Basic Principles of Clustering Methods

Clustering methods group a set of data points into a few coherent groups...
research
12/29/2021

A sampling-based approach for efficient clustering in large datasets

We propose a simple and efficient clustering method for high-dimensional...
research
12/04/2014

Iterative Subsampling in Solution Path Clustering of Noisy Big Data

We develop an iterative subsampling approach to improve the computationa...
research
04/19/2020

Robust and Scalable Entity Alignment in Big Data

Entity alignment has always had significant uses within a multitude of d...
research
05/07/2014

Representative Selection for Big Data via Sparse Graph and Geodesic Grassmann Manifold Distance

This paper addresses the problem of identifying a very small subset of d...
research
04/16/2023

Data-OOB: Out-of-bag Estimate as a Simple and Efficient Data Value

Data valuation is a powerful framework for providing statistical insight...

Please sign up or login with your details

Forgot password? Click here to reset