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.

PDF] Iterative quantization: A procrustean approach to learning binary codes

PDF] Iterative quantization: A procrustean approach to learning binary codes

Application-Driven Near-Data Processing for Similarity Search – arXiv Vanity

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

Group sparse based locality – sensitive dictionary learning for video semantic analysis

CausalBank

PDF) Unsupervised Ensemble Hashing: Boosting Minimum Hamming Distance

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

Artificial neural network - Wikipedia

Convolution neural network with batch normalization and inception-residual modules for Android malware classification

A spatiotemporal mechanism of visual attention: Superdiffusive motion and theta oscillations of neural population activity patterns