pub struct CompetitiveNeuralClusterer { /* private fields */ }Expand description
Bio-inspired competitive learning for spatial clustering
This clusterer uses winner-take-all dynamics with lateral inhibition to discover clusters in spatial data. Neurons compete for activation, with the winner (neuron with strongest response) being updated while others are inhibited.
§Features
- Winner-take-all competitive dynamics
- Lateral inhibition for neural competition
- Adaptive learning rates
- Neighborhood function for topological organization
- Distance-based neuron activation
§Example
use scirs2_core::ndarray::Array2;
use scirs2_spatial::neuromorphic::algorithms::CompetitiveNeuralClusterer;
let points = Array2::from_shape_vec((4, 2), vec![
0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 1.0, 1.0
]).unwrap();
let mut clusterer = CompetitiveNeuralClusterer::new(2, 2);
let assignments = clusterer.fit(&points.view(), 100).unwrap();
println!("Cluster assignments: {:?}", assignments);Implementations§
Source§impl CompetitiveNeuralClusterer
impl CompetitiveNeuralClusterer
Sourcepub fn with_competition_params(self, sigma: f64, wta_threshold: f64) -> Self
pub fn with_competition_params(self, sigma: f64, wta_threshold: f64) -> Self
Configure neighborhood parameters
§Arguments
sigma- Neighborhood function widthwta_threshold- Winner-take-all threshold
Sourcepub fn fit(
&mut self,
points: &ArrayView2<'_, f64>,
epochs: usize,
) -> SpatialResult<Array1<usize>>
pub fn fit( &mut self, points: &ArrayView2<'_, f64>, epochs: usize, ) -> SpatialResult<Array1<usize>>
Train competitive network on spatial data
Applies competitive learning dynamics where neurons compete for activation and the winner adapts towards the input pattern while inhibiting neighbors.
§Arguments
points- Input spatial points (n_points × n_dims)epochs- Number of training epochs
§Returns
Cluster assignments for each input point
Sourcepub fn get_cluster_centers(&self) -> Array2<f64>
pub fn get_cluster_centers(&self) -> Array2<f64>
Get cluster centers (neuron weights)
§Returns
Array containing the current neuron weight vectors as cluster centers
Sourcepub fn learning_rates(&self) -> &[f64]
pub fn learning_rates(&self) -> &[f64]
Get current learning rates
Sourcepub fn inhibition_strengths(&self) -> &Array2<f64>
pub fn inhibition_strengths(&self) -> &Array2<f64>
Get inhibition strength matrix
Sourcepub fn num_clusters(&self) -> usize
pub fn num_clusters(&self) -> usize
Get number of clusters
Trait Implementations§
Source§impl Clone for CompetitiveNeuralClusterer
impl Clone for CompetitiveNeuralClusterer
Source§fn clone(&self) -> CompetitiveNeuralClusterer
fn clone(&self) -> CompetitiveNeuralClusterer
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for CompetitiveNeuralClusterer
impl RefUnwindSafe for CompetitiveNeuralClusterer
impl Send for CompetitiveNeuralClusterer
impl Sync for CompetitiveNeuralClusterer
impl Unpin for CompetitiveNeuralClusterer
impl UnwindSafe for CompetitiveNeuralClusterer
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.