research
∙
09/06/2023
Improved Outlier Robust Seeding for k-means
The k-means is a popular clustering objective, although it is inherently...
share
research
∙
08/22/2023
Minwise-Independent Permutations with Insertion and Deletion of Features
In their seminal work, Broder et. al. <cit.> introduces the minHash algo...
research
∙
04/26/2022
One-pass additive-error subset selection for ℓ_p subspace approximation
We consider the problem of subset selection for ℓ_p subspace approximati...
research
∙
03/04/2022
Improving Tug-of-War sketch using Control-Variates method
Computing space-efficient summary, or a.k.a. sketches, of large data, is...
research
∙
12/01/2021
Dimensionality Reduction for Categorical Data
Categorical attributes are those that can take a discrete set of values,...
research
∙
11/13/2021
Efficient Binary Embedding of Categorical Data using BinSketch
In this work, we present a dimensionality reduction algorithm, aka. sket...
research
∙
03/20/2021
On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling
We consider the problem of subset selection for ℓ_p subspace approximati...
research
∙
12/07/2020
IHashNet: Iris Hashing Network based on efficient multi-index hashing
Massive biometric deployments are pervasive in today's world. But despit...
research
∙
06/30/2020
Subspace approximation with outliers
The subspace approximation problem with outliers, for given n points in ...
research
∙
10/10/2019
