Package statechum.analysis.learning.MarkovModel

Examples of statechum.analysis.learning.MarkovModel.MarkovOutcome

727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
    long scoreCurrentFanout = 0, score = 0;
    Map<Label,MarkovOutcome> outgoing_red_probabilities=cl.predictTransitionsFromState(red,pathLenBeyondCurrentState,cl.model.getChunkLen(),null);
    Map<Label,MarkovOutcome> outgoing_blue_probabilities=cl.predictTransitionsFromState(blue,pathLenBeyondCurrentState,cl.model.getChunkLen(),null);
    for(Entry<Label,MarkovOutcome> entry:outgoing_red_probabilities.entrySet())
    {
      MarkovOutcome outcomeBlue = outgoing_blue_probabilities.get(entry.getKey());
      if (outcomeBlue == null && entry.getValue() == MarkovOutcome.negative)
        ++scoreCurrentFanout; // red negative, blue absent, hence the two are consistent
      if (outcomeBlue == entry.getValue()) // or if the two are consistent
      {
        if (stepNumber > 1)
        {
          LinkedList<Label> pathBeyond = new LinkedList<Label>(pathLenBeyondCurrentState);pathBeyond.add(entry.getKey());
          score+=comparePredictedFanouts(cl,red,blue,pathBeyond,stepNumber-1);
        }
        ++scoreCurrentFanout;
      }
    }
     
    for(Entry<Label,MarkovOutcome> entry:outgoing_blue_probabilities.entrySet())
    {
      MarkovOutcome outcomeRed = outgoing_red_probabilities.get(entry.getKey());
      if (outcomeRed == null && entry.getValue() == MarkovOutcome.negative)
        ++scoreCurrentFanout; // blue negative, red absent, hence the two are consistent
      if (outcomeRed == entry.getValue()) // or if the two are consistent
      {
        if (stepNumber > 1)
View Full Code Here
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
        for(Label label:graph.getCache().getAlphabet())
        {
          if (!failureLabels.contains(label))
          {// if the labels is not already recorded as being inconsistently predicted
            MarkovOutcome predictedFromEalierTrace = outgoing_labels_probabilities.get(label);
             
              PredictionForSequence prediction = MarkovMatrixEngine.getPredictionIfExists(lastElementToPrediction, label);
              MarkovOutcome predicted_from_Markov= prediction!=null?prediction.prediction:null;
            MarkovOutcome outcome = MarkovOutcome.reconcileOpinions_PosNeg_Overrides_Null(predictedFromEalierTrace, predicted_from_Markov);
            if (outcome != predictedFromEalierTrace)
            {// we learnt something new, be it a new value (or a non-null value) or a failure, record it
              if (outcome == MarkovOutcome.failure)
              {
                failureLabels.add(label);outgoing_labels_probabilities.remove(label);
View Full Code Here
900
901
902
903
904
905
906
907
908
909
910
            pathToUpdateInMarkov.addAll(pathToUseWithMarkovToPredictOutgoing);
          }
         
          pathToUpdateInMarkov.add(lbl);
         
          MarkovOutcome newValue = null;
          PredictionForSequence prediction = model.markovMatrix.getPredictionAndCreateNewOneIfNecessary(pathToUpdateInMarkov);
         
          boolean foundAccept = false, foundReject = false;
          for(Object vObj:graphToCheckForConsistency.getTargets(targets))
          {
View Full Code Here
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
       
        //System.out.println(vert.toString()+" : "+encounteredPartOfTrace+" outgoing: "+outgoingLabels);
        if (checker.considerPathsWithPrefixMissingInMarkov() || mapFromLastLabelToNodes != null) // we skip everything where a path was not seen in PTA unless we are asked to consider all such paths.
            for(Label label:outgoingLabels)
            {
            MarkovOutcome labels_occurrence= outgoing_labels_value.get(label);
            if (labels_occurrence != MarkovOutcome.failure)
            {
                PredictionForSequence prediction = MarkovMatrixEngine.getPredictionIfExists(mapFromLastLabelToNodes, label);
                MarkovOutcome predicted_from_Markov=prediction == null?null:prediction.prediction;
                if (predicted_from_Markov != MarkovOutcome.failure)
                {// if training data does not lead to a consistent outcome for this label because chunk length is too small, not much we can do, but otherwise we are here and can make use of the data
                  if (!checker.consistent(labels_occurrence, predicted_from_Markov))
                  {
                    inconsistencies.addAndGet(1);// record inconsistency
View Full Code Here
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
        }
       
       
        for(Entry<Label,CmpVertex> existing:entry.getValue().entrySet())
        {
          MarkovOutcome predictedTarget = predictions.get(existing.getKey());
         
          if (existing.getValue().isAccept() && predictedTarget == MarkovOutcome.positive)
            ++numberOfExistingPredicted;
          if (!existing.getValue().isAccept() && predictedTarget == MarkovOutcome.negative)
            ++numberOfExistingPredicted;
View Full Code Here
TOP

Related Classes of statechum.analysis.learning.MarkovModel.MarkovOutcome

  • statechum.analysis.learning.experiments.PairSelection.MarkovPassivePairSelection
  • statechum.analysis.learning.experiments.PairSelection.MarkovScoreComputation
  • statechum.analysis.learning.MarkovClassifier
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.