paper-with-me

Papers

Neighborhood density estimation using space-partitioning based hashing schemes

2025-12-02 · Aashi Jindal arxiv

This work introduces FiRE/FiRE.1, a novel sketching-based algorithm for anomaly detection to quickly identify rare cell sub-populations in large-scale single-cell RNA sequencing data. This method demonstrated superior performance against state-of-the-art techniques. Furthermore, the thesis proposes Enhash, a fast and resource-efficient ensemble learner that uses projection hashing to detect concept drift in streaming data, proving highly competitive in time and accuracy across various drift types.

📄 PDF Abstract BibTeX arXiv:2512.03187

Code (0)

등록된 구현이 없습니다.

Tasks

Density EstimationAnomaly Detection

Similar Papers 제목 키워드 기반

Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing

2015-12-01 · Ke Li, Jitendra Malik

Existing methods for retrieving k-nearest neighbours suffer from the curse of dimensionality. We argue this is caused in part by inherent deficiencies of space partitioning, which is the underlying strategy used by most …

Black-box density function estimation using recursive partitioning

2020-10-26 · Erik Bodin, Zhenwen Dai, Neill D. F. Campbell, Carl Henrik Ek

We present a novel approach to Bayesian inference and general Bayesian computation that is defined through a sequential decision loop. Our method defines a recursive partitioning of the sample space. It neither relies on…

Bayesian Inference

Unsupervised Data-Efficient Cross-Modal Retrieval with Global-Neighborhood Alignment Hashing

2026-06-30 · Runhao Li, Xiaoxu Ma, Zhenyu Weng, Yue Zhang 외 arxiv

Compared to supervised cross-modal hashing (CMH), unsupervised CMH reduces the reliance on manual labeling by learning binary codes from unlabeled image-text pairs. However, existing unsupervised CMH methods often rely o…

Cross-Modal RetrievalContrastive Learning

Discrete Graph Hashing

2014-12-01 · NeurIPS 2014 12 · Wei Liu, Cun Mu, Sanjiv Kumar, Shih-Fu Chang

Hashing has emerged as a popular technique for fast nearest neighbor search in gigantic databases. In particular, learning based hashing has received considerable attention due to its appealing storage and search efficie…

K-Nearest Neighbors Hashing

2019-06-01 · CVPR 2019 6 · Xiangyu He, Peisong Wang, Jian Cheng

Hashing based approximate nearest neighbor search embeds high dimensional data to compact binary codes, which enables efficient similarity search and storage. However, the non-isometry sign() function makes it hard to pr…