pub struct GroupSimilarity<T, C> { /* private fields */ }
Expand description

calculate the Similarity score between two HpoSets

§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>

source

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);
source

pub fn calculate(&self, a: &HpoSet<'_>, b: &HpoSet<'_>) -> f32

calculates the similarity between two sets of terms

Trait Implementations§

source§

impl Default for GroupSimilarity<GraphIc, StandardCombiner>

source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl<T, C> Freeze for GroupSimilarity<T, C>
where C: Freeze, T: Freeze,

§

impl<T, C> RefUnwindSafe for GroupSimilarity<T, C>

§

impl<T, C> Send for GroupSimilarity<T, C>
where C: Send, T: Send,

§

impl<T, C> Sync for GroupSimilarity<T, C>
where C: Sync, T: Sync,

§

impl<T, C> Unpin for GroupSimilarity<T, C>
where C: Unpin, T: Unpin,

§

impl<T, C> UnwindSafe for GroupSimilarity<T, C>
where C: UnwindSafe, T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more