edu.columbia.cs.cg.prdualrank.graph.generator
Class GraphGenerator<T extends Matchable,D extends Document>
java.lang.Object
edu.columbia.cs.cg.prdualrank.graph.generator.GraphGenerator<T,D>
- Direct Known Subclasses:
- ExtractionGraphGenerator, SearchGraphGenerator
public abstract class GraphGenerator<T extends Matchable,D extends Document>
- extends java.lang.Object
This class is used for our implementation of:
"Searching Patterns for Relation Extraction over the Web: Rediscovering the Pattern-Relation Duality" . Y. Fang and K. C.-C. Chang. In WSDM, pages 825-834, 2011.
For further information, WSDM 2011 Conference Website .
Description
Defines the behavior of a graph generator.
Further implementations can be seen by looking at the subtypes of this class.
The difference in Graph Generators relies on the definition of frequency and matching. For instance, Search Patterns match Documents while Extraction Patterns match Context of tuples
For more information about Graphs, see Section 4 of the mentioned paper.
- Since:
- 2011-10-07
- Version:
- 0.1
- Author:
- Pablo Barrio, Goncalo Simoes
- See Also:
- WSDM 2011 Conference Website
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
GraphGenerator
public GraphGenerator()
generateGraph
public PRDualRankGraph<T,D> generateGraph(java.util.Set<Relationship> topTuples,
java.util.Set<Pattern<T,D>> patterns,
java.util.Set<D> documents)
- Generates the graph given the top tuples and the patterns that match them.
- Parameters:
topTuples
- the top tuplespatterns
- the patternsdocuments
- the documents processed during execution.
- Returns:
- the PrDualRank graph instance.