slib.sml.sm.core.measures.graph.pairwise.dag.node_based
Class Sim_pairwise_DAG_node_Jaccard_3W_IC
java.lang.Object
slib.sml.sm.core.measures.graph.pairwise.dag.node_based.Sim_pairwise_DAG_node_Jaccard_3W_IC
- All Implemented Interfaces:
- Sim_DAG_node_abstract, Sim_Pairwise_DAG, Sim_Pairwise
public class Sim_pairwise_DAG_node_Jaccard_3W_IC
- extends Object
- implements Sim_DAG_node_abstract
IC formulation of the Jaccard measure.
sim(a,b) = (3 * ic_mica) / (ic_a + ic_b + 2 * ic_mica)
- Author:
- Sebastien Harispe
Method Summary |
boolean |
isSymmetric()
|
double |
sim(double ic_a,
double ic_b,
double ic_mica)
Compute the semantic similarity considering the given parameters. |
double |
sim(org.openrdf.model.URI a,
org.openrdf.model.URI b,
SM_Engine c,
SMconf conf)
Compute the semantic similarity of the pair of concepts/classes. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Sim_pairwise_DAG_node_Jaccard_3W_IC
public Sim_pairwise_DAG_node_Jaccard_3W_IC()
sim
public double sim(org.openrdf.model.URI a,
org.openrdf.model.URI b,
SM_Engine c,
SMconf conf)
throws slib.utils.ex.SLIB_Exception
- Description copied from interface:
Sim_Pairwise
- Compute the semantic similarity of the pair of concepts/classes.
- Specified by:
sim
in interface Sim_Pairwise
- Parameters:
a
- the first concept/classb
- the second concept/classc
- the engine used to access information required by the measuresconf
- the configuration to consider
- Returns:
- the similarity between the pair of concept/class.
- Throws:
slib.utils.ex.SLIB_Exception
sim
public double sim(double ic_a,
double ic_b,
double ic_mica)
- Compute the semantic similarity considering the given parameters.
- Parameters:
ic_a
- the IC of the vertex Aic_b
- the IC of the vertex Bic_mica
- the IC of the Most Informative Common Ancestor of A and B
- Returns:
- the semantic similarity
isSymmetric
public boolean isSymmetric()
- Specified by:
isSymmetric
in interface Sim_Pairwise
Copyright © 2013. All Rights Reserved.