Scroll to navigation

src/mlpack/methods/kmeans/refined_start.hpp(3) MLPACK src/mlpack/methods/kmeans/refined_start.hpp(3)

NAME

src/mlpack/methods/kmeans/refined_start.hpp -

SYNOPSIS

Classes


class mlpack::kmeans::RefinedStart
 
A refined approach for choosing initial points for k-means clustering.

Namespaces


mlpack
 
Linear algebra utility functions, generally performed on matrices or vectors. mlpack::kmeans
 
K-Means clustering.

Detailed Description

Author:
Ryan Curtin
An implementation of Bradley and Fayyad's 'Refining Initial Points for K-Means clustering'. This class is meant to provide better initial points for the k-means algorithm.
This file is part of MLPACK 1.0.10.
MLPACK is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
MLPACK is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details (LICENSE.txt).
You should have received a copy of the GNU General Public License along with MLPACK. If not, see http://www.gnu.org/licenses/.
Definition in file refined_start.hpp.

Author

Generated automatically by Doxygen for MLPACK from the source code.
Tue Sep 9 2014 Version 1.0.10