51 lines
1.3 KiB
C++
51 lines
1.3 KiB
C++
/*
|
|
----
|
|
This file is NOT part of SECONDO.
|
|
Authors: Greg Hamerly and Jonathan Drake
|
|
* Feedback: hamerly@cs.baylor.edu
|
|
* See: http://cs.baylor.edu/~hamerly/software/kmeans.php
|
|
* Copyright 2014
|
|
*
|
|
* HamerlyKmeans implements Hamerly's k-means algorithm that uses one lower
|
|
* bound per point.
|
|
----
|
|
|
|
//paragraph [1] Title: [{\Large \bf \begin{center}] [\end{center}}]
|
|
//[TOC] [\tableofcontents]
|
|
|
|
[1] Declarations for the Hamerly's k-means algorithm
|
|
|
|
1 Declarations for the gamerly's k-means algorithm
|
|
|
|
*/
|
|
|
|
#ifndef HAMERLY_KMEANS_H
|
|
#define HAMERLY_KMEANS_H
|
|
|
|
/* Authors: Greg Hamerly and Jonathan Drake
|
|
* Feedback: hamerly@cs.baylor.edu
|
|
* See: http://cs.baylor.edu/~hamerly/software/kmeans.php
|
|
* Copyright 2014
|
|
*
|
|
* HamerlyKmeans implements Hamerly's k-means algorithm that uses one lower
|
|
* bound per point.
|
|
*/
|
|
|
|
#include "triangle_inequality_base_kmeans.h"
|
|
|
|
class HamerlyKmeans : public TriangleInequalityBaseKmeans {
|
|
public:
|
|
HamerlyKmeans() { numLowerBounds = 1; }
|
|
virtual ~HamerlyKmeans() { free(); }
|
|
virtual std::string getName() const { return "hamerly"; }
|
|
|
|
protected:
|
|
// Update the upper and lower bounds for the given range of points.
|
|
void update_bounds(int startNdx, int endNdx);
|
|
|
|
virtual int runThread(int threadId, int maxIterations);
|
|
};
|
|
|
|
#endif
|
|
|