\section{/var/www/mlpack.ratml.\+org/mlpack.org/\+\_\+src/mlpack-\/3.3.0/src/mlpack/methods/lsh/lsh\+\_\+search.hpp File Reference}
\label{lsh__search_8hpp}\index{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+0/src/mlpack/methods/lsh/lsh\+\_\+search.\+hpp@{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+0/src/mlpack/methods/lsh/lsh\+\_\+search.\+hpp}}
Include dependency graph for lsh\+\_\+search.\+hpp\+:
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{lsh__search_8hpp__incl}
\end{center}
\end{figure}
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \textbf{ L\+S\+H\+Search$<$ Sort\+Policy $>$}
\begin{DoxyCompactList}\small\item\em The \doxyref{L\+S\+H\+Search}{p.}{classmlpack_1_1neighbor_1_1LSHSearch} class; this class builds a hash on the reference set and uses this hash to compute the distance-\/approximate nearest-\/neighbors of the given queries. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \textbf{ mlpack}
\begin{DoxyCompactList}\small\item\em strip\+\_\+type.\+hpp \end{DoxyCompactList}\item 
 \textbf{ mlpack\+::neighbor}
\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
\textbf{ B\+O\+O\+S\+T\+\_\+\+T\+E\+M\+P\+L\+A\+T\+E\+\_\+\+C\+L\+A\+S\+S\+\_\+\+V\+E\+R\+S\+I\+ON} (template$<$ typename Sort\+Policy $>$, \textbf{ mlpack\+::neighbor\+::\+L\+S\+H\+Search}$<$ Sort\+Policy $>$, 1)
\begin{DoxyCompactList}\small\item\em Set the serialization version of the L\+S\+H\+Search class. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\begin{DoxyAuthor}{Author}
Parikshit Ram
\end{DoxyAuthor}
Defines the L\+S\+H\+Search class, which performs an approximate nearest neighbor search for a queries in a query set over a given dataset using Locality-\/sensitive hashing with 2-\/stable distributions.

The details of this method can be found in the following paper\+:

\{datar2004locality, title=\{Locality-\/sensitive hashing scheme based on p-\/stable distributions\}, author=\{Datar, M. and Immorlica, N. and Indyk, P. and Mirrokni, V.\+S.\}, booktitle= \{Proceedings of the 12th Annual Symposium on Computational Geometry\}, pages=\{253--262\}, year=\{2004\}, organization=\{A\+CM\} \}

Additionally, the class implements Multiprobe L\+SH, which improves approximation results during the search for approximate nearest neighbors. The Multiprobe L\+SH algorithm was presented in the paper\+:

\{Lv2007multiprobe, tile=\{Multi-\/probe L\+SH\+: efficient indexing for high-\/dimensional similarity search\}, author=\{Lv, Qin and Josephson, William and Wang, Zhe and Charikar, Moses and Li, Kai\}, booktitle=\{Proceedings of the 33rd international conference on Very large data bases\}, year=\{2007\}, pages=\{950--961\} \}

mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-\/clause B\+SD license. You should have received a copy of the 3-\/clause B\+SD license along with mlpack. If not, see {\tt http\+://www.\+opensource.\+org/licenses/\+B\+S\+D-\/3-\/\+Clause} for more information. 

\subsection{Function Documentation}
\mbox{\label{lsh__search_8hpp_a7ad0a77d33d6f9bd16ad91f55439fd3c}} 
\index{lsh\+\_\+search.\+hpp@{lsh\+\_\+search.\+hpp}!B\+O\+O\+S\+T\+\_\+\+T\+E\+M\+P\+L\+A\+T\+E\+\_\+\+C\+L\+A\+S\+S\+\_\+\+V\+E\+R\+S\+I\+ON@{B\+O\+O\+S\+T\+\_\+\+T\+E\+M\+P\+L\+A\+T\+E\+\_\+\+C\+L\+A\+S\+S\+\_\+\+V\+E\+R\+S\+I\+ON}}
\index{B\+O\+O\+S\+T\+\_\+\+T\+E\+M\+P\+L\+A\+T\+E\+\_\+\+C\+L\+A\+S\+S\+\_\+\+V\+E\+R\+S\+I\+ON@{B\+O\+O\+S\+T\+\_\+\+T\+E\+M\+P\+L\+A\+T\+E\+\_\+\+C\+L\+A\+S\+S\+\_\+\+V\+E\+R\+S\+I\+ON}!lsh\+\_\+search.\+hpp@{lsh\+\_\+search.\+hpp}}
\subsubsection{B\+O\+O\+S\+T\+\_\+\+T\+E\+M\+P\+L\+A\+T\+E\+\_\+\+C\+L\+A\+S\+S\+\_\+\+V\+E\+R\+S\+I\+O\+N()}
{\footnotesize\ttfamily B\+O\+O\+S\+T\+\_\+\+T\+E\+M\+P\+L\+A\+T\+E\+\_\+\+C\+L\+A\+S\+S\+\_\+\+V\+E\+R\+S\+I\+ON (\begin{DoxyParamCaption}\item[{template$<$ typename Sort\+Policy $>$}]{,  }\item[{\textbf{ mlpack\+::neighbor\+::\+L\+S\+H\+Search}$<$ Sort\+Policy $>$}]{,  }\item[{1}]{ }\end{DoxyParamCaption})}



Set the serialization version of the L\+S\+H\+Search class. 



Referenced by L\+S\+H\+Search$<$ Sort\+Policy $>$\+::\+Projections().