# ForestDSH: A Universal Hash Design for Discrete Probability Distributions

11 May 2019Arash Gholami DavoodiSean ChangHyun Gon YooAnubhav BawejaMihir MongiaHosein Mohimani

In this paper, we consider the problem of classification of $M$ high dimensional queries $y^1,\cdots,y^M\in B^S$ to $N$ high dimensional classes $x^1,\cdots,x^N\in A^S$ where $A$ and $B$ are discrete alphabets and the probabilistic model that relates data to the classes $P(x,y)$ is known. This problem has applications in various fields including the database search problem in mass spectrometry... (read more)

PDF Abstract

No code implementations yet. Submit your code now