slib.sml.sm.core.measures.graph.framework.dag
Class Sim_Framework_DAG_Set_Bader_2003
java.lang.Object
slib.sml.sm.core.measures.graph.framework.dag.Sim_Framework_DAG_Set_abstract
slib.sml.sm.core.measures.graph.framework.dag.Sim_Framework_DAG_Set_Bader_2003
- All Implemented Interfaces:
- Sim_Pairwise_DAG, Sim_Groupwise, Sim_Groupwise_Direct, Sim_Pairwise
public class Sim_Framework_DAG_Set_Bader_2003
- extends Sim_Framework_DAG_Set_abstract
Bader G, Hogue C: An automated method for finding molecular complexes in
large protein interaction networks. BMC bioinformatics 2003, 4:2.
Cited by Lin C, Cho Y-rae, Hwang W-chang, Pei P, Zhang A: Clustering methods
in protein-protein interaction network. in Knowledge Discovery in
Bioinformatics: Techniques, Methods and Application 2006.
- Author:
- Sebastien Harispe
Method Summary |
boolean |
isSymmetric()
|
double |
sim(Set<org.openrdf.model.URI> setA,
Set<org.openrdf.model.URI> setB,
SMconf conf)
This provide a way to compare the two sets of concepts which have been
extended considering inference based on the taxonomic hierarchy. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Sim_Framework_DAG_Set_Bader_2003
public Sim_Framework_DAG_Set_Bader_2003()
sim
public double sim(Set<org.openrdf.model.URI> setA,
Set<org.openrdf.model.URI> setB,
SMconf conf)
throws slib.utils.ex.SLIB_Exception
- Description copied from class:
Sim_Framework_DAG_Set_abstract
- This provide a way to compare the two sets of concepts which have been
extended considering inference based on the taxonomic hierarchy. In other
words, each vertex of the set already contains all its ancestors in the
set.
- Specified by:
sim
in class Sim_Framework_DAG_Set_abstract
- Parameters:
setA
- the first setsetB
- the second setconf
- the configuration to apply to compute the semantic similarity
- Returns:
- the similarity of the two sets.
- Throws:
slib.utils.ex.SLIB_Exception
isSymmetric
public boolean isSymmetric()
Copyright © 2013. All Rights Reserved.