AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

UEQMS: UMAP Embedded Quick Mean Shift Algorithm for High Dimensional Clustering

AAAI 2023 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Combine UMAP dimensionality reduction with QMSQMS · MNISTNMI: 0.83 -> 0.89Helped
Avoid duplicate updates by clustering unique shifted positions with repetition countsMS++ · Phone AccelerometerRT (seconds): 1599.34s -> 37.49sHelped
Use QMS instead of MS++MS++ · Phone AccelerometerARI: 0.0897 -> 0.0897No clear effect
Use the modified MS++ update to handle non-smooth boundary casesMS++ · Clustering; theoretical convergenceconvergence guaranteeHelped
Use UMAP followed by QMS rather than the evaluated automated clustering baselinesHigh-dimensional real datasets · ALLAML, arcene, GLIOMA, leukemia, orlraws10P, TOX 171, lymphoma, cacmcisi, dermatology, iono, segment, vehicle, vowel, wdbc, and warpAR10PAMI and ARIMixed
Use UMAP followed by QMS rather than deep clustering methodsHigh-dimensional image clustering · MNIST, USPS, Fashion, and pendigitACCMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy