pub struct LinkPredictor<M: EmbeddingModel> { /* private fields */ }Expand description
Link predictor for knowledge graph completion
Implementations§
Source§impl<M: EmbeddingModel> LinkPredictor<M>
impl<M: EmbeddingModel> LinkPredictor<M>
Sourcepub fn new(config: LinkPredictionConfig, model: M) -> Self
pub fn new(config: LinkPredictionConfig, model: M) -> Self
Create new link predictor
Sourcepub fn add_known_triples(&mut self, triples: &[Triple])
pub fn add_known_triples(&mut self, triples: &[Triple])
Add known triples for filtering
Sourcepub fn predict_tail(
&self,
subject: &str,
predicate: &str,
candidate_entities: &[String],
) -> Result<Vec<LinkPrediction>>
pub fn predict_tail( &self, subject: &str, predicate: &str, candidate_entities: &[String], ) -> Result<Vec<LinkPrediction>>
Predict tail entities given head and relation
Sourcepub fn predict_head(
&self,
predicate: &str,
object: &str,
candidate_entities: &[String],
) -> Result<Vec<LinkPrediction>>
pub fn predict_head( &self, predicate: &str, object: &str, candidate_entities: &[String], ) -> Result<Vec<LinkPrediction>>
Predict head entities given relation and tail
Sourcepub fn predict_relation(
&self,
subject: &str,
object: &str,
candidate_relations: &[String],
) -> Result<Vec<LinkPrediction>>
pub fn predict_relation( &self, subject: &str, object: &str, candidate_relations: &[String], ) -> Result<Vec<LinkPrediction>>
Predict relations given head and tail
Sourcepub fn predict_tails_batch(
&self,
queries: &[(String, String)],
candidate_entities: &[String],
) -> Result<Vec<Vec<LinkPrediction>>>
pub fn predict_tails_batch( &self, queries: &[(String, String)], candidate_entities: &[String], ) -> Result<Vec<Vec<LinkPrediction>>>
Batch prediction of tails
Auto Trait Implementations§
impl<M> Freeze for LinkPredictor<M>where
M: Freeze,
impl<M> RefUnwindSafe for LinkPredictor<M>where
M: RefUnwindSafe,
impl<M> Send for LinkPredictor<M>
impl<M> Sync for LinkPredictor<M>
impl<M> Unpin for LinkPredictor<M>where
M: Unpin,
impl<M> UnsafeUnpin for LinkPredictor<M>where
M: UnsafeUnpin,
impl<M> UnwindSafe for LinkPredictor<M>where
M: 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<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.