Class ImprovedRiveretTheoryLearner
java.lang.Object
org.tweetyproject.arg.dung.learning.ImprovedRiveretTheoryLearner
Implementation of the algorithm for learning (grounded) labelings from with some improvements:
Riveret, RĂ©gis, and Guido Governatori. "On learning attacks in probabilistic abstract argumentation." 2016.
- improves result for argumentation frameworks with self-attacking arguments
- instead of stopping when no undecided attacks are left, we always use the full computational budget
- added additional parameter for pruning instead of pruning at 0. eg budget: 500 threshold: -10
- added fifth rule to capture self-attacking arguments
- extended rule 3
- adjusted weight updates per rule
- Author:
- Lars Bengel
-
Constructor Summary
ConstructorDescriptionImprovedRiveretTheoryLearner
(Collection<Argument> arguments, int max_cycles) initialize learner for the given set of arguments -
Method Summary
Modifier and TypeMethodDescriptionlearnLabelings
(ArrayList<Labeling> labelings) learn theory without pruning discarded attackslearnLabelings
(ArrayList<Labeling> labelings, boolean prune, int threshold) learn random labelings from the given List until no undecided attacks are left in the theoryvoid
show Weights
-
Constructor Details
-
ImprovedRiveretTheoryLearner
initialize learner for the given set of arguments- Parameters:
arguments
- a set of argumentsmax_cycles
- the maximal number of cycles
-
-
Method Details
-
showWeights
public void showWeights()show Weights -
learnLabelings
learn random labelings from the given List until no undecided attacks are left in the theory- Parameters:
labelings
- a list of labelingsprune
- if true, remove discarded attacks after each stepthreshold
- the treshold- Returns:
- the learned dung theory
-
learnLabelings
learn theory without pruning discarded attacks- Parameters:
labelings
- a list of labelings- Returns:
- the learned dung theory
-