public class SimDagEdgeUtils extends Object
Constructor and Description |
---|
SimDagEdgeUtils() |
Modifier and Type | Method and Description |
---|---|
static org.openrdf.model.URI |
getMSA_pekar_staab(org.openrdf.model.URI root,
Map<org.openrdf.model.URI,Double> allSpA,
Map<org.openrdf.model.URI,Double> allSpB,
Set<org.openrdf.model.URI> ancestors_A,
Set<org.openrdf.model.URI> ancestors_B,
slib.sglib.algo.graph.shortest_path.Dijkstra dijkstra)
Compute the most specific ancestor considering Pekar and Staab 2002
formula to minimize i.e.
|
static org.openrdf.model.URI |
searchMSA(Set<org.openrdf.model.URI> interSecAncestors,
Map<org.openrdf.model.URI,Integer> maxDepths)
Search the Most specific ancestor considering the depth
|
public static org.openrdf.model.URI getMSA_pekar_staab(org.openrdf.model.URI root, Map<org.openrdf.model.URI,Double> allSpA, Map<org.openrdf.model.URI,Double> allSpB, Set<org.openrdf.model.URI> ancestors_A, Set<org.openrdf.model.URI> ancestors_B, slib.sglib.algo.graph.shortest_path.Dijkstra dijkstra)
root
- the root of the graphallSpA
- shortest path from A to all conceptsallSpB
- shortest path from B to all conceptsancestors_A
- inclusive ancestors of Aancestors_B
- inclusive ancestors of Bdijkstra
- public static org.openrdf.model.URI searchMSA(Set<org.openrdf.model.URI> interSecAncestors, Map<org.openrdf.model.URI,Integer> maxDepths) throws slib.utils.ex.SLIB_Exception
interSecAncestors
- the concept to evaluatemaxDepths
- the values which will be used to evaluate the conceptsslib.utils.ex.SLIB_Exception
Copyright © 2014. All rights reserved.