#include <PndMvaCluster.h>
Definition at line 33 of file PndMvaCluster.h.
◆ PndMvaCluster() [1/2]
PndMvaCluster::PndMvaCluster |
( |
DataPoints const & |
InputData, |
|
|
size_t |
nCluster |
|
) |
| |
|
explicit |
Constructor.
- Parameters
-
InputData | Input Data points. |
nCluster | Number of clusters to be created. |
◆ PndMvaCluster() [2/2]
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. |
◆ ~PndMvaCluster()
virtual PndMvaCluster::~PndMvaCluster |
( |
| ) |
|
|
virtual |
◆ Cluster()
Compute Cluster centers for the current input data.
- Parameters
-
ClType | Clustering algorithm. |
- Returns
- Vector containing the cluster centroids.
◆ ClusterAndLabel()
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.
◆ GetClusterDimension()
size_t PndMvaCluster::GetClusterDimension |
( |
| ) |
const |
|
inline |
Get the dimension of the input data points.
- Returns
- Dimension of the data points.
Definition at line 171 of file PndMvaCluster.h.
◆ GetNumberOfClusters()
size_t PndMvaCluster::GetNumberOfClusters |
( |
| ) |
const |
|
inline |
Get the number of cluster centeroids.
- Returns
- Number of cluster centeroids.
Definition at line 166 of file PndMvaCluster.h.
168 return m_num_Cluster;
◆ SetForceToLabel()
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 185 of file PndMvaCluster.h.
187 m_forceToLabel = label;
◆ SetNumberOfClusters()
void PndMvaCluster::SetNumberOfClusters |
( |
size_t |
val | ) |
|
|
inline |
◆ Setprune()
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 181 of file PndMvaCluster.h.
The documentation for this class was generated from the following file: