Nearest Neighbor Median Shift Clustering for Binary Data

02/11/2019
by   Gaël Beck, et al.
0

We describe in this paper the theory and practice behind a new modal clustering method for binary data. Our approach (BinNNMS) is based on the nearest neighbor median shift. The median shift is an extension of the well-known mean shift, which was designed for continuous data, to handle binary data. We demonstrate that BinNNMS can discover accurately the location of clusters in binary data with theoretical and experimental analyses.

READ FULL TEXT
research
05/15/2021

Mean Shift for Self-Supervised Learning

Most recent self-supervised learning (SSL) algorithms learn features by ...
research
08/16/2023

Continuous Sweep: an improved, binary quantifier

Quantification is a supervised machine learning task, focused on estimat...
research
02/03/2021

Nearest Neighbor-based Importance Weighting

Importance weighting is widely applicable in machine learning in general...
research
04/22/2022

A Generalization of Ripley's K Function for the Detection of Spatial Clustering in Areal Data

Spatial clustering detection has a variety of applications in diverse fi...
research
05/13/2014

An Intelligent Pixel Replication Technique by Binary Decomposition for Digital Image Zooming

Image zooming is the process of enlarging the spatial resolution of a gi...
research
08/18/2021

Contrastive Identification of Covariate Shift in Image Data

Identifying covariate shift is crucial for making machine learning syste...
research
09/09/2015

Clustering by Hierarchical Nearest Neighbor Descent (H-NND)

Previously in 2014, we proposed the Nearest Descent (ND) method, capable...

Please sign up or login with your details

Forgot password? Click here to reset