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.

Locality sensitive hashing with bit selection

NeuronMotif: Deciphering cis-regulatory codes by layer-wise demixing of deep neural networks

A novel intelligent bearing fault diagnosis method based on signal process and multi-kernel joint distribution adaptation

CausalBank

Performance of two complementary machine-learned potentials in modelling chemically complex systems

Lensless inference camera: incoherent object recognition through a thin mask with LBP map generation

HYPERSPECTRAL IMAGERY CLASSIFICATION USING TECHNOLOGIES OF COMPUTATIONAL INTELLIGENCE

Deep learning applications in single-cell omics data analysis

Machine learning methods for sign language recognition: A critical review and analysis - ScienceDirect