pub struct AISelectionPlot {
pub algorithm_scores: HashMap<String, f64>,
pub selection_timeline: Vec<(f64, f64)>,
pub meta_learning_timeline: Vec<(f64, f64)>,
pub data_characteristics: DataCharacteristicsVisualization,
pub selected_algorithm: String,
}Expand description
AI algorithm selection visualization
Fields§
§algorithm_scores: HashMap<String, f64>Algorithm performance scores
selection_timeline: Vec<(f64, f64)>Selection confidence timeline
meta_learning_timeline: Vec<(f64, f64)>Meta-learning improvement timeline
data_characteristics: DataCharacteristicsVisualizationData characteristics analysis
selected_algorithm: StringFinally selected algorithm
Trait Implementations§
Auto Trait Implementations§
impl Freeze for AISelectionPlot
impl RefUnwindSafe for AISelectionPlot
impl Send for AISelectionPlot
impl Sync for AISelectionPlot
impl Unpin for AISelectionPlot
impl UnwindSafe for AISelectionPlot
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> 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.