PDF] Locality-sensitive binary codes from shift-invariant kernels
Por um escritor misterioso
Descrição
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.
A robust receptive field code for optic flow detection and decomposition during self-motion - ScienceDirect
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
Frontiers BitBrain and Sparse Binary Coincidence (SBC) memories: Fast, robust learning and inference for neuromorphic architectures
HYPERSPECTRAL IMAGERY CLASSIFICATION USING TECHNOLOGIES OF COMPUTATIONAL INTELLIGENCE
PDF) Adaptive Hashing With Sparse Matrix Factorization
Hyperspectral video target tracking based on pixel-wise spectral matching reduction and deep spectral cascading texture features - ScienceDirect
Methods and tools for causal discovery and causal inference - Nogueira - 2022 - WIREs Data Mining and Knowledge Discovery - Wiley Online Library
Population codes enable learning from few examples by shaping inductive bias
AI, Free Full-Text
de
por adulto (o preço varia de acordo com o tamanho do grupo)