Struct hpo::similarity::GroupSimilarity
source · pub struct GroupSimilarity<T, C> { /* private fields */ }
Expand description
calculate the Similarity score between two HpoSet
s
§Note
It is recommended to use the HpoSet::similarity
method instead of creating a GroupSimilarity
struct yourself.
§Examples
§Using the preferred way
use hpo::term::InformationContentKind;
use hpo::{Ontology, HpoSet};
use hpo::term::HpoGroup;
use hpo::similarity::{Builtins, StandardCombiner};
fn set1(ontology: &Ontology) -> HpoSet {
// ...
}
fn set2(ontology: &Ontology) -> HpoSet {
// ...
}
let ontology = Ontology::from_binary("tests/example.hpo").unwrap();
let set_1 = set1(&ontology);
let set_2 = set2(&ontology);
let similarity = set_1.similarity(
&set_2,
Builtins::GraphIc(InformationContentKind::Omim),
StandardCombiner::default()
);
assert_eq!(similarity, 0.8177036);
§Using GroupSimilarity
directly
use hpo::term::InformationContentKind;
use hpo::{Ontology, HpoSet};
use hpo::term::HpoGroup;
use hpo::similarity::{Builtins, GroupSimilarity, StandardCombiner};
fn set1(ontology: &Ontology) -> HpoSet {
// ...
}
fn set2(ontology: &Ontology) -> HpoSet {
// ...
}
let ontology = Ontology::from_binary("tests/example.hpo").unwrap();
let set_1 = set1(&ontology);
let set_2 = set2(&ontology);
let sim = GroupSimilarity::new(
StandardCombiner::FunSimAvg,
Builtins::GraphIc(InformationContentKind::Omim)
);
assert_eq!(sim.calculate(&set_1, &set_2), 0.8177036);
Implementations§
source§impl<T: Similarity, C: SimilarityCombiner> GroupSimilarity<T, C>
impl<T: Similarity, C: SimilarityCombiner> GroupSimilarity<T, C>
sourcepub fn new(combiner: C, similarity: T) -> Self
pub fn new(combiner: C, similarity: T) -> Self
§Examples
use hpo::similarity::GraphIc;
use hpo::term::InformationContentKind;
use hpo::similarity::{GroupSimilarity, StandardCombiner};
// use Omim-based InformationContent for similarity calculation
let graphic = GraphIc::new(InformationContentKind::Omim);
// use the funSimAvg algorithm to combine the similarity scores
let combiner = StandardCombiner::FunSimAvg;
let sim = GroupSimilarity::new(combiner, graphic);
Trait Implementations§
source§impl Default for GroupSimilarity<GraphIc, StandardCombiner>
impl Default for GroupSimilarity<GraphIc, StandardCombiner>
Auto Trait Implementations§
impl<T, C> Freeze for GroupSimilarity<T, C>
impl<T, C> RefUnwindSafe for GroupSimilarity<T, C>where
C: RefUnwindSafe,
T: RefUnwindSafe,
impl<T, C> Send for GroupSimilarity<T, C>
impl<T, C> Sync for GroupSimilarity<T, C>
impl<T, C> Unpin for GroupSimilarity<T, C>
impl<T, C> UnwindSafe for GroupSimilarity<T, C>where
C: UnwindSafe,
T: 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
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<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.