edu.columbia.cs.cg.prdualrank.inference.quest
Interface QuestCalculator<T extends Matchable,D extends Document>

All Known Implementing Classes:
MapBasedQuestCalculator, MatricesBasedQuestCalculator

public interface QuestCalculator<T extends Matchable,D extends Document>

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 the QUEST functions defined in PRDualRank.
For more information, please read the Inference formulas in Figure 4 of the mentioned paper.

Since:
2011-10-07
Version:
0.1
Author:
Pablo Barrio, Goncalo Simoes
See Also:
WSDM 2011 Conference Website

Method Summary
 java.util.Map<Pattern<T,D>,java.lang.Double> getPatternPrecisionMap()
          Gets the Pattern-Precision map (containing the calculated precisions by QuestP)
 java.util.Map<Pattern<T,D>,java.lang.Double> getPatternRecallMap()
          Gets the Pattern-Recall map (containing the calculated recalls by QuestR).
 java.util.Map<Relationship,java.lang.Double> getTuplePrecisionMap()
          Gets the Tuple-Precision map (containing the calculated precisions by QuestP).
 java.util.Map<Relationship,java.lang.Double> getTupleRecallMap()
          Gets the Tuple-Recall map (containing the calculated recalls by QuestR).
 void runQuestP(PRDualRankGraph<T,D> gs)
          Run QuestP (precision) as stated in PRDualRank paper.
 void runQuestR(PRDualRankGraph<T,D> gs)
          Run QuestR (recall) as stated in PRDualRank paper.
 void setSeeds(java.util.Set<Relationship> seeds)
          Sets the initial seeds.
 

Method Detail

runQuestP

void runQuestP(PRDualRankGraph<T,D> gs)
Run QuestP (precision) as stated in PRDualRank paper.

Parameters:
gs - the graph containing related elements (patterns and tuples, for instance).

runQuestR

void runQuestR(PRDualRankGraph<T,D> gs)
Run QuestR (recall) as stated in PRDualRank paper.

Parameters:
gs - the graph containing related elements (patterns and tuples, for instance).

getPatternPrecisionMap

java.util.Map<Pattern<T,D>,java.lang.Double> getPatternPrecisionMap()
Gets the Pattern-Precision map (containing the calculated precisions by QuestP)

Returns:
the Pattern-Precision map

getTuplePrecisionMap

java.util.Map<Relationship,java.lang.Double> getTuplePrecisionMap()
Gets the Tuple-Precision map (containing the calculated precisions by QuestP).

Returns:
the Tuple-Precision map

getPatternRecallMap

java.util.Map<Pattern<T,D>,java.lang.Double> getPatternRecallMap()
Gets the Pattern-Recall map (containing the calculated recalls by QuestR).

Returns:
the Pattern-Recall map

getTupleRecallMap

java.util.Map<Relationship,java.lang.Double> getTupleRecallMap()
Gets the Tuple-Recall map (containing the calculated recalls by QuestR).

Returns:
the Tuple-Recall map

setSeeds

void setSeeds(java.util.Set<Relationship> seeds)
Sets the initial seeds.

Parameters:
seeds - the initial seeds