PDF] Locality-sensitive binary codes from shift-invariant kernels

This paper introduces a simple distribution-free encoding scheme based on random projections, such that the expected Hamming distance between the binary codes of two vectors is related to the value of a shift-invariant kernel between the vectors. This paper addresses the problem of designing binary codes for high-dimensional data such that vectors that are similar in the original space map to similar binary strings. We introduce a simple distribution-free encoding scheme based on random projections, such that the expected Hamming distance between the binary codes of two vectors is related to the value of a shift-invariant kernel (e.g., a Gaussian kernel) between the vectors. We present a full theoretical analysis of the convergence properties of the proposed scheme, and report favorable experimental performance as compared to a recent state-of-the-art method, spectral hashing.

ICIP2011-ProgramGuide.pdf

Mathematics, Free Full-Text

Resolving Transition Metal Chemical Space: Feature Selection for Machine Learning and Structure–Property Relationships

Population codes enable learning from few examples by shaping inductive bias

Deep learning applications in single-cell omics data analysis

Methods and tools for causal discovery and causal inference - Nogueira - 2022 - WIREs Data Mining and Knowledge Discovery - Wiley Online Library

ASE 2023 - Tutorials - ASE 2023

Locality-sensitive binary codes from shift-invariant kernels

Remote Sensing, Free Full-Text