slib.graph.algo.extraction.reduction.dag

Class GraphReduction_DAG_Ranwez_2011

java.lang.Object

slib.graph.algo.extraction.reduction.dag.GraphReduction_DAG_Ranwez_2011

public class GraphReduction_DAG_Ranwez_2011
extends Object

Algorithm used to extract a subgraph from a DAG (Directed Acyclic Graph)
Implementation of Ranwez et al. 2011 algorithm.
original paper:
Ranwez V, Ranwez S, Janaqi S: Sub-Ontology Extraction Using Hyponym and Hypernym Closure on is-a Directed Acyclic Graphs. IEEE Transactions on Knowledge and Data Engineering 2011, 99:1-14.

Author:

Sébastien Harispe

Constructor Summary

Constructors

Constructor and Description
GraphReduction_DAG_Ranwez_2011(G graph)
GraphReduction_DAG_Ranwez_2011(G graph, Set<org.openrdf.model.URI> predicatesTC, Set<org.openrdf.model.URI> predicateToAdd, boolean validateDAGproperty) Method used to perform the subGraph extraction of an acyclic graph based on top-down and bottom-up transitive closures.

Method Summary

Methods

Modifier and Type	Method and Description
void	exec(Set<org.openrdf.model.URI> selectedURIs, G g_reduction)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GraphReduction_DAG_Ranwez_2011

public GraphReduction_DAG_Ranwez_2011(G graph)
                               throws SLIB_Exception

Throws:

SLIB_Exception

GraphReduction_DAG_Ranwez_2011

public GraphReduction_DAG_Ranwez_2011(G graph,
                              Set<org.openrdf.model.URI> predicatesTC,
                              Set<org.openrdf.model.URI> predicateToAdd,
                              boolean validateDAGproperty)
                               throws SLIB_Exception

Method used to perform the subGraph extraction of an acyclic graph based on top-down and bottom-up transitive closures. The reduction is performed considering:

• A set of URIs corresponding to the vertices on which must be based the reduction.
• A collection of predicate (edge type). The reduction is based on the transitive closure considering a top-down and a bottom-up query extensions considering the given predicates to consider as taxonomic predicates.

All directed relationships between of other types of predicates can also be added between the nodes which compose the reduction (in a post-treatment).

Parameters:

graph - the graph

predicatesTC - set of predicates to consider as taxonomic predicate for the transitive closures

predicateToAdd - defines which predicate relationships must be considered in the post treatment. if nodes x and y compose the reduction and x,y are linked by a relationship of type p, p must be specified in the predicateToAdd set in order to specified that the relationship x,p,y must be expressed in the reduction.

validateDAGproperty - boolean if true DAG property of the graph induced by the given parameters is checked

Throws:

SLIB_Exception

Method Detail

exec

public void exec(Set<org.openrdf.model.URI> selectedURIs,
        G g_reduction)
          throws SLIB_Ex_Critic,
                 SLIB_Ex_Warning

Parameters:

selectedURIs -

g_reduction -

Throws:

SLIB_Ex_Critic

SLIB_Ex_Warning