slib.sml.sm.core.measures.graph.pairwise.dag.edge_based.utils
Class SimDagEdgeUtils

java.lang.Object
  extended by slib.sml.sm.core.measures.graph.pairwise.dag.edge_based.utils.SimDagEdgeUtils

public class SimDagEdgeUtils
extends Object

Utility class for edge-based measures.

Author:
Harispe Sébastien

Constructor Summary
SimDagEdgeUtils()
           
 
Method Summary
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
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

SimDagEdgeUtils

public SimDagEdgeUtils()
Method Detail

getMSA_pekar_staab

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)
Compute the most specific ancestor considering Pekar and Staab 2002 formula to minimize i.e. common ancestor minimizing score(c) = minDist_edge(A,c) + minDist_edge(B,c) + minDist_edge(ROOT,c)

Parameters:
root - the root of the graph
allSpA - shortest path from A to all concepts
allSpB - shortest path from B to all concepts
ancestors_A - inclusive ancestors of A
ancestors_B - inclusive ancestors of B
dijkstra -
Returns:
the vertex corresponding to the Most Specific Ancestors
See Also:
V, Staab S: Taxonomy learning: factoring the structure of a taxonomy into a semantic classification decision. In COLING ’02 Proceedings of the 19th international conference on Computational linguistics. Association for Computational Linguistics; 2002, 2:1-7.

searchMSA

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
Search the Most specific ancestor considering the depth

Parameters:
interSecAncestors - the concept to evaluate
maxDepths - the values which will be used to evaluate the concepts
Returns:
the concept maximizing the depth (the first one is retrieve if multiple exist). null is returned if the intersection is empty.
Throws:
slib.utils.ex.SLIB_Exception


Copyright © 2013. All Rights Reserved.