slib.sml.sm.core.metrics.ic.utils
Class IcUtils

java.lang.Object
  extended by slib.sml.sm.core.metrics.ic.utils.IcUtils

public class IcUtils
extends Object

Class used to defined static methods utility.

Author:
Harispe Sébastien

Constructor Summary
IcUtils()
           
 
Method Summary
static Double searchMax_IC_MICA(org.openrdf.model.URI a, org.openrdf.model.URI b, Set<org.openrdf.model.URI> setA, Set<org.openrdf.model.URI> setB, Map<org.openrdf.model.URI,Double> icScores)
          Search the IC of Most Informative Concept Shared between two sets, regarding the given metric.
static org.openrdf.model.URI searchMICA(org.openrdf.model.URI a, org.openrdf.model.URI b, Set<org.openrdf.model.URI> setA, Set<org.openrdf.model.URI> setB, Map<org.openrdf.model.URI,Double> icScores)
          Search the Most Informative Concept Shared between two sets, regarding the given metric.
static Double searchMin_pOc_MICA(Set<org.openrdf.model.URI> setA, Set<org.openrdf.model.URI> setB, Map<org.openrdf.model.URI,Double> icScores)
          Search the IC of Less Informative Concept Shared between two sets, regarding the given metric.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

IcUtils

public IcUtils()
Method Detail

searchMICA

public static org.openrdf.model.URI searchMICA(org.openrdf.model.URI a,
                                               org.openrdf.model.URI b,
                                               Set<org.openrdf.model.URI> setA,
                                               Set<org.openrdf.model.URI> setB,
                                               Map<org.openrdf.model.URI,Double> icScores)
                                        throws slib.utils.ex.SLIB_Exception
Search the Most Informative Concept Shared between two sets, regarding the given metric. This method is particularly suited to the search of the Most Informative Common Ancestor, considering the input sets as the inclusive ancestors of the concepts for which we search the MICAS.

Parameters:
setA - the first set
setB - the second set
icScores - the metric result to consider to evaluate the specificity of a concept
Returns:
the Most Informative concept regarding the given metric results, null if none is found
Throws:
slib.utils.ex.SLIB_Exception

searchMax_IC_MICA

public static Double searchMax_IC_MICA(org.openrdf.model.URI a,
                                       org.openrdf.model.URI b,
                                       Set<org.openrdf.model.URI> setA,
                                       Set<org.openrdf.model.URI> setB,
                                       Map<org.openrdf.model.URI,Double> icScores)
                                throws slib.utils.ex.SLIB_Exception
Search the IC of Most Informative Concept Shared between two sets, regarding the given metric. This method is particularly suited to the search of IC of the Most Informative Common Ancestor, considering the input sets as the inclusive ancestors of the concepts for which we search the MICAS.

Parameters:
setA - the first set
setB - the second set
icScores - the metric result to consider to evaluate the specificity of a concept
Returns:
the IC of the Most Informative concept regarding the given metric results, null if none is found
Throws:
slib.utils.ex.SLIB_Exception

searchMin_pOc_MICA

public static Double searchMin_pOc_MICA(Set<org.openrdf.model.URI> setA,
                                        Set<org.openrdf.model.URI> setB,
                                        Map<org.openrdf.model.URI,Double> icScores)
                                 throws slib.utils.ex.SLIB_Exception
Search the IC of Less Informative Concept Shared between two sets, regarding the given metric.

Parameters:
setA - the first set
setB - the second set
icScores - the metric result to consider to evaluate the specificity of a concept
Returns:
the IC of the Less Informative concept regarding the given metric results, null if none is found
Throws:
slib.utils.ex.SLIB_Exception


Copyright © 2013. All Rights Reserved.