pub struct GaussianProcessRegressor<K: Kernel> { /* private fields */ }Expand description
Gaussian Process Regressor with scikit-learn compatible API
§Examples
use scirs2_stats::gaussian_process::{GaussianProcessRegressor, SquaredExponential};
use scirs2_core::ndarray::{array, Array2};
let kernel = SquaredExponential::default();
let mut gpr = GaussianProcessRegressor::new(kernel);
let x_train = Array2::from_shape_vec((3, 1), vec![0.0, 1.0, 2.0]).expect("Operation failed");
let y_train = array![0.0, 1.0, 0.5];
gpr.fit(&x_train, &y_train).expect("Operation failed");
let x_test = Array2::from_shape_vec((1, 1), vec![1.5]).expect("Operation failed");
let predictions = gpr.predict(&x_test).expect("Operation failed");Implementations§
Source§impl<K: Kernel> GaussianProcessRegressor<K>
impl<K: Kernel> GaussianProcessRegressor<K>
Sourcepub fn with_options(kernel: K, alpha: f64, normalize_y: bool) -> Self
pub fn with_options(kernel: K, alpha: f64, normalize_y: bool) -> Self
Create a new GP Regressor with custom options
§Arguments
kernel- The covariance kernelalpha- Noise level / regularization parameternormalize_y- Whether to normalize target values
Sourcepub fn predict_with_std(
&self,
x: &Array2<f64>,
) -> StatsResult<(Array1<f64>, Array1<f64>)>
pub fn predict_with_std( &self, x: &Array2<f64>, ) -> StatsResult<(Array1<f64>, Array1<f64>)>
Sourcepub fn kernel_mut(&mut self) -> &mut K
pub fn kernel_mut(&mut self) -> &mut K
Get the kernel (mutable)
Sourcepub fn log_marginal_likelihood(&self) -> StatsResult<f64>
pub fn log_marginal_likelihood(&self) -> StatsResult<f64>
Compute log marginal likelihood
Sourcepub fn n_train_samples(&self) -> usize
pub fn n_train_samples(&self) -> usize
Get number of training samples
Auto Trait Implementations§
impl<K> Freeze for GaussianProcessRegressor<K>where
K: Freeze,
impl<K> RefUnwindSafe for GaussianProcessRegressor<K>where
K: RefUnwindSafe,
impl<K> Send for GaussianProcessRegressor<K>
impl<K> Sync for GaussianProcessRegressor<K>
impl<K> Unpin for GaussianProcessRegressor<K>where
K: Unpin,
impl<K> UnsafeUnpin for GaussianProcessRegressor<K>where
K: UnsafeUnpin,
impl<K> UnwindSafe for GaussianProcessRegressor<K>where
K: UnwindSafe,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.