Links: A High-Dimensional Online Clustering Method

01/30/2018
by   Philip Andrew Mansfield, et al.
0

We present a novel algorithm, called Links, designed to perform online clustering on unit vectors in a high-dimensional Euclidean space. The algorithm is appropriate when it is necessary to cluster data efficiently as it streams in, and is to be contrasted with traditional batch clustering algorithms that have access to all data at once. For example, Links has been successfully applied to embedding vectors generated from face images or voice recordings for the purpose of recognizing people, thereby providing real-time identification during video or audio capture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2018

A Fast Algorithm for Clustering High Dimensional Feature Vectors

We propose an algorithm for clustering high dimensional data. If P featu...
research
07/01/2022

Enhancing cluster analysis via topological manifold learning

We discuss topological aspects of cluster analysis and show that inferri...
research
12/10/2019

Adaptive Manifold Clustering

We extend the theoretical study of a recently proposed nonparametric clu...
research
11/30/2022

High-Dimensional Wide Gap k-Means Versus Clustering Axioms

Kleinberg's axioms for distance based clustering proved to be contradict...
research
09/09/2021

Online Search for a Hyperplane in High-Dimensional Euclidean Space

We consider the online search problem in which a server starting at the ...
research
05/08/2018

Finding Frequent Entities in Continuous Data

In many applications that involve processing high-dimensional data, it i...
research
08/05/2022

An Efficient Person Clustering Algorithm for Open Checkout-free Groceries

Open checkout-free grocery is the grocery store where the customers neve...

Please sign up or login with your details

Forgot password? Click here to reset