pub struct WeightedEnsembleModel { /* private fields */ }Expand description
Weighted Ensemble Model using weak supervision
Phase 6: Combines multiple noisy signals (SBFL, TDG, Churn, Complexity, RAG) to learn optimal weights for defect prediction.
Implementations§
Source§impl WeightedEnsembleModel
impl WeightedEnsembleModel
Sourcepub fn with_labeling_functions(lfs: Vec<Box<dyn LabelingFunction>>) -> Self
pub fn with_labeling_functions(lfs: Vec<Box<dyn LabelingFunction>>) -> Self
Create with custom labeling functions
Sourcepub fn with_iterations(self, n: usize) -> Self
pub fn with_iterations(self, n: usize) -> Self
Set number of EM iterations
Sourcepub fn fit(&mut self, files: &[FileFeatures]) -> Result<()>
pub fn fit(&mut self, files: &[FileFeatures]) -> Result<()>
Fit the model using EM algorithm on unlabeled data
This learns optimal weights for each labeling function by maximizing the likelihood of the observed label matrix.
Sourcepub fn predict(&self, features: &FileFeatures) -> f32
pub fn predict(&self, features: &FileFeatures) -> f32
Predict defect probability for a file
Sourcepub fn get_weights(&self) -> Option<&LabelModelWeights>
pub fn get_weights(&self) -> Option<&LabelModelWeights>
Get learned weights for interpretability
Trait Implementations§
Auto Trait Implementations§
impl Freeze for WeightedEnsembleModel
impl !RefUnwindSafe for WeightedEnsembleModel
impl Send for WeightedEnsembleModel
impl Sync for WeightedEnsembleModel
impl Unpin for WeightedEnsembleModel
impl !UnwindSafe for WeightedEnsembleModel
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> 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
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt 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.