|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.columbia.cs.cg.prdualrank.inference.quest.impl.MapBasedQuestCalculator<T,D>
public class MapBasedQuestCalculator<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
QuestCalculator based on Maps. This implementation matched the one described in the PRDualRank paper. Performs well for sparse graphs. For fully-connected graphs see MatricesBasedQuestCalculator
For more information, please read the Inference formulas in Figure 4 of the mentioned paper.
MatricesBasedQuestCalculator
Constructor Summary | |
---|---|
MapBasedQuestCalculator(ConvergenceFinder convergence)
Instantiates a new map based quest calculator. |
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. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public MapBasedQuestCalculator(ConvergenceFinder convergence)
convergence
- the convergence method used to stop the execution.Method Detail |
---|
public void runQuestP(PRDualRankGraph<T,D> gs)
QuestCalculator
runQuestP
in interface QuestCalculator<T extends Matchable,D extends Document>
gs
- the graph containing related elements (patterns and tuples, for instance).public void runQuestR(PRDualRankGraph<T,D> gs)
QuestCalculator
runQuestR
in interface QuestCalculator<T extends Matchable,D extends Document>
gs
- the graph containing related elements (patterns and tuples, for instance).public java.util.Map<Pattern<T,D>,java.lang.Double> getPatternPrecisionMap()
QuestCalculator
getPatternPrecisionMap
in interface QuestCalculator<T extends Matchable,D extends Document>
public java.util.Map<Relationship,java.lang.Double> getTuplePrecisionMap()
QuestCalculator
getTuplePrecisionMap
in interface QuestCalculator<T extends Matchable,D extends Document>
public java.util.Map<Pattern<T,D>,java.lang.Double> getPatternRecallMap()
QuestCalculator
getPatternRecallMap
in interface QuestCalculator<T extends Matchable,D extends Document>
public java.util.Map<Relationship,java.lang.Double> getTupleRecallMap()
QuestCalculator
getTupleRecallMap
in interface QuestCalculator<T extends Matchable,D extends Document>
public void setSeeds(java.util.Set<Relationship> seeds)
QuestCalculator
setSeeds
in interface QuestCalculator<T extends Matchable,D extends Document>
seeds
- the initial seeds
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |