\section{/var/www/mlpack.ratml.\+org/mlpack.org/\+\_\+src/mlpack-\/git/src/mlpack/methods/kmeans/pelleg\+\_\+moore\+\_\+kmeans\+\_\+rules.hpp File Reference}
\label{pelleg__moore__kmeans__rules_8hpp}\index{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/git/src/mlpack/methods/kmeans/pelleg\+\_\+moore\+\_\+kmeans\+\_\+rules.\+hpp@{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/git/src/mlpack/methods/kmeans/pelleg\+\_\+moore\+\_\+kmeans\+\_\+rules.\+hpp}}
Include dependency graph for pelleg\+\_\+moore\+\_\+kmeans\+\_\+rules.\+hpp\+:
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=199pt]{pelleg__moore__kmeans__rules_8hpp__incl}
\end{center}
\end{figure}
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \textbf{ Pelleg\+Moore\+K\+Means\+Rules$<$ Metric\+Type, Tree\+Type $>$}
\begin{DoxyCompactList}\small\item\em The rules class for the single-\/tree Pelleg-\/\+Moore kd-\/tree traversal for k-\/means clustering. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \textbf{ mlpack}
\begin{DoxyCompactList}\small\item\em Linear algebra utility functions, generally performed on matrices or vectors. \end{DoxyCompactList}\item 
 \textbf{ mlpack\+::kmeans}
\begin{DoxyCompactList}\small\item\em K-\/\+Means clustering. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\begin{DoxyAuthor}{Author}
Ryan Curtin
\end{DoxyAuthor}
Defines the pruning rules and base cases rules necessary to perform single-\/tree k-\/means clustering using the Pelleg-\/\+Moore fast k-\/means algorithm, which has been shoehorned to fit into the mlpack tree abstractions.

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.