#include <PndMvaCluster.h>
Definition at line 33 of file PndMvaCluster.h.
PndMvaCluster::PndMvaCluster |
( |
DataPoints const & |
InputData, |
|
|
size_t |
nCluster |
|
) |
| |
|
explicit |
Constructor.
- Parameters
-
InputData | Input Data points. |
nCluster | Number of clusters to be created. |
PndMvaCluster::PndMvaCluster |
( |
DataPoints const & |
InputData, |
|
|
size_t |
nCluster, |
|
|
bool const |
prune, |
|
|
bool const |
forceLabels |
|
) |
| |
|
explicit |
Constructor.
- Parameters
-
InputData | Input Data points. |
nCluster | Number of clusters to be created. |
prune | Prune the created cluster. |
forceLabels | Force to label the undecided and unknown points. |
virtual PndMvaCluster::~PndMvaCluster |
( |
| ) |
|
|
virtual |
void PndMvaCluster::ClearStructures |
( |
| ) |
|
|
private |
Compute Cluster centers for the current input data.
- Parameters
-
ClType | Clustering algorithm. |
- Returns
- Vector containing the cluster centroids.
virtual DataPoints* PndMvaCluster::ClusterAndLabel |
( |
ClusteringType const |
ClType, |
|
|
std::vector< std::string > const & |
labels |
|
) |
| |
|
virtual |
Compute Cluster centers for the current input data. The label of the majority of their members determines the label of the center.
- Parameters
-
ClType | Clustering algorithm (default is KMEANS_HARD). |
labels | The labes of the currently available classes. |
- Returns
- Vector containing the cluster centroids.
void PndMvaCluster::ComputeCentroids |
( |
| ) |
|
|
private |
size_t PndMvaCluster::GetClusterDimension |
( |
| ) |
const |
|
inline |
Get the dimension of the input data points.
- Returns
- Dimension of the data points.
Definition at line 174 of file PndMvaCluster.h.
References m_dimension.
size_t m_dimension
input data points.
size_t PndMvaCluster::GetNumberOfClusters |
( |
| ) |
const |
|
inline |
void PndMvaCluster::InitCentroids |
( |
| ) |
|
|
private |
void PndMvaCluster::InitialPartition |
( |
| ) |
|
|
private |
void PndMvaCluster::ReInitEmptyCenter |
( |
size_t |
centerIdx | ) |
|
|
private |
void PndMvaCluster::ResetCenteroids |
( |
| ) |
|
|
private |
void PndMvaCluster::SetForceToLabel |
( |
bool const |
forceLabel = false | ) |
|
|
inline |
The centroids that do not have a label (unknown, undecided) will get the label of the nearest data point from the input data set.
- Parameters
-
forceLabel | Force the labeling even if the determined label is unknown or undecided. |
Definition at line 188 of file PndMvaCluster.h.
References m_forceToLabel.
void PndMvaCluster::SetNumberOfClusters |
( |
size_t |
val | ) |
|
|
inline |
void PndMvaCluster::Setprune |
( |
bool const |
prune = false | ) |
|
|
inline |
Set if the created cluster list needs to be pruned. Remove the unknown and undecided labels.
- Parameters
-
prune | If prune after clustering. |
Definition at line 184 of file PndMvaCluster.h.
References m_prune.
std::vector< std::set<size_t>* > PndMvaCluster::m_ClustersToPoints |
|
private |
size_t PndMvaCluster::m_dimension |
|
private |
bool PndMvaCluster::m_forceToLabel |
|
private |
size_t PndMvaCluster::m_num_Cluster |
|
private |
std::vector<size_t> PndMvaCluster::m_PointsToClusters |
|
private |
bool PndMvaCluster::m_prune |
|
private |
The documentation for this class was generated from the following file: