Struct linfa_hierarchical::HierarchicalCluster[][src]

pub struct HierarchicalCluster<T: Float>(_);
Expand description

Agglomerative hierarchical clustering

In this clustering algorithm, each point is first considered as a separate cluster. During each step, two points are merged into new clusters, until a stopping criterion is reached. The distance between the points is computed as the negative-log transform of the similarity kernel.

Implementations

Select a merging method

Stop merging when a certain number of clusters are reached

In the fitting process points are merged until a certain criterion is reached. With this option the merging process will stop, when the number of clusters drops below this value.

Stop merging when a certain distance is reached

In the fitting process points are merged until a certain criterion is reached. With this option the merging process will stop, then the distance exceeds this value.

Trait Implementations

Returns the “default value” for a type. Read more

The checked hyperparameters

Error type resulting from failed hyperparameter checking

Checks the hyperparameters and returns a reference to the checked hyperparameters if successful Read more

Checks the hyperparameters and returns the checked hyperparameters if successful

Calls check() and unwraps the result

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Performs the conversion.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.