sklears_cross_decomposition::graph_regularization

Struct GraphRegularizedCCA

pub struct GraphRegularizedCCA { /* private fields */ }

Expand description

Graph-regularized CCA implementation

Implementations§

Source §

impl GraphRegularizedCCA

Source

pub fn new(config: GraphRegularizationConfig) -> Self

Create new graph-regularized CCA

Source

pub fn with_regularization(reg_type: RegularizationType, lambda: f64) -> Self

Create with default configuration and specified regularization

Source

pub fn fit( &self, x: &Array2<f64>, y: &Array2<f64>, ) -> GraphResult<GraphRegularizationResults>

Fit graph-regularized CCA model

Auto Trait Implementations§

§

impl UnwindSafe for GraphRegularizedCCA

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

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 more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more

Source §