pub enum MiType {
UnNormed,
Normed,
Linfoot,
Voi,
Jaccard,
Iqr,
Pearson,
}
Expand description
Mutual Information Type
Variants§
UnNormed
The Standard, un-normalized variant
Normed
Normalized by the max MI, which is min(H(A), H(B))
Linfoot
Linfoot information Quantity. Derived by computing the mutual information between the two components of a bivariate Normal with covariance rho, and solving for rho.
Voi
Variation of Information. A version of mutual information that satisfies the triangle inequality.
Jaccard
Jaccard distance between X an Y. Jaccard(X, Y) is in [0, 1].
Iqr
Information Quality Ratio: the amount of information of a variable based on another variable against total uncertainty.
Pearson
Mutual Information normed the with square root of the product of the components entropies. Akin to the Pearson correlation coefficient.
Trait Implementations§
source§impl<'de> Deserialize<'de> for MiType
impl<'de> Deserialize<'de> for MiType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Ord for MiType
impl Ord for MiType
source§impl PartialEq for MiType
impl PartialEq for MiType
source§impl PartialOrd for MiType
impl PartialOrd for MiType
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Copy for MiType
impl Eq for MiType
impl StructuralPartialEq for MiType
Auto Trait Implementations§
impl RefUnwindSafe for MiType
impl Send for MiType
impl Sync for MiType
impl Unpin for MiType
impl UnwindSafe for MiType
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<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.