Package statechum.analysis.learning

Examples of statechum.analysis.learning.PairScore

845
846
847
848
849
850
851
852
853
854
855
856
857
858
  /** Tests comparison of a pair to other pairs. All values are equal. */
  @Test
  public void TestCreateComparePairs1()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),0,0),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),0,0),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),0,0);

    List<PairScore> pairs = Arrays.asList(new PairScore[]{pairB,pairC});
    testClassifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
    int [] buffer= new int[2];
    testClassifier.comparePairWithOthers(pairA, pairs,buffer,0);
View Full Code Here
862
863
864
865
866
867
868
869
870
871
872
873
874
875
  /** Tests comparison of a pair to other pairs. The case of domination. */
  @Test
  public void TestCreateComparePairs2()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),1,0),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),0,0),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),0,0);

    List<PairScore> pairs = Arrays.asList(new PairScore[]{pairB,pairC});
    testClassifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
    int [] buffer= new int[2];
    testClassifier.comparePairWithOthers(pairA, pairs,buffer,0);
View Full Code Here
879
880
881
882
883
884
885
886
887
888
889
890
891
892
  /** Tests comparison of a pair to other pairs. The case of dominates or equals and that of being dominated */
  @Test
  public void TestCreateComparePairs3()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),1,-1),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),1,0),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),0,0);

    List<PairScore> pairs = Arrays.asList(new PairScore[]{pairB,pairC});
    testClassifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
    int [] buffer= new int[2];
    testClassifier.comparePairWithOthers(pairA, pairs,buffer,0);
View Full Code Here
896
897
898
899
900
901
902
903
904
905
906
907
908
909
  /** Tests comparison of a pair to other pairs. The case of dominates or equals and that of being dominated. Checks that values can be recorded at an offset. */
  @Test
  public void TestCreateComparePairs3a()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),1,-1),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),1,0),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),0,0);

    List<PairScore> pairs = Arrays.asList(new PairScore[]{pairB,pairC});
    testClassifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
    int [] buffer= new int[]{9,8,7,6};
    testClassifier.comparePairWithOthers(pairA, pairs,buffer,1);
View Full Code Here
913
914
915
916
917
918
919
920
921
922
923
924
925
926
  /** Tests comparison of a pair to other pairs. Tests that contradictory responses are flagged. */
  @Test
  public void TestCreateComparePairs4()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),1,0),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),0,1),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),2,0);

    List<PairScore> pairs = Arrays.asList(new PairScore[]{pairB,pairC});
    testClassifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
    int [] buffer= new int[2];
    testClassifier.comparePairWithOthers(pairA, pairs,buffer,0);
View Full Code Here
930
931
932
933
934
935
936
937
938
939
940
941
942
943
  /** Tests comparison of a pair to other pairs. Tests that contradictory responses are flagged. */
  @Test
  public void TestCreateComparePairs5()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),1,0),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),0,1),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),2,0);

    List<PairScore> pairs = Arrays.asList(new PairScore[]{pairA,pairC});
    testClassifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
    int [] buffer= new int[2];
    testClassifier.comparePairWithOthers(pairB, pairs,buffer,0);
View Full Code Here
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
  /** Tests comparison of a pair to other pairs, taking into account if-then conditions. */
  @Test
  public void TestCreateComparePairs6()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),1,-1),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),0,0),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),0,1),
      pairD=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),1,0);

    WekaDataCollector dataCollector = new WekaDataCollector();
    List<PairRank> assessors = new ArrayList<PairRank>(20);
    assessors.add(dataCollector.new PairRank("statechum score")
    {// 1
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
139
            CmpVertex currentBlueState = BlueEntry.getValue();
           
            int numberOfCompatiblePairs = 0;
            for(CmpVertex oldRed:reds)
            {
              PairScore pair = obtainPair(currentBlueState,oldRed,decisionProcedure);
              if (pair.getScore() >= coregraph.config.getGeneralisationThreshold())
              {
                coregraph.pairsAndScores.add(pair);
                ++numberOfCompatiblePairs;
                if (GlobalConfiguration.getConfiguration().isAssertEnabled() && coregraph.config.getDebugMode()) PathRoutines.checkPTAConsistency(coregraph, currentBlueState);
              }
View Full Code Here
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
  /** Tests comparison of a pair to other pairs, taking into account if-then conditions. */
  @Test
  public void TestCreateComparePairs7()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    final PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),1,1),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),1,1),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),0,0),
      pairD=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),1,0);

    WekaDataCollector dataCollector = new WekaDataCollector();
    List<PairRank> assessors = new ArrayList<PairRank>(20);
    assessors.add(dataCollector.new PairRank("statechum score")
    {// 1
View Full Code Here
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
  /** Tests comparison of a pair to other pairs, taking into account if-then conditions. */
  @Test
  public void TestCreateComparePairs6_arrayTooSmall()
  {
    // Using test data from testSplitSetOfPairsIntoRightAndWrong3, pairs A and B are right and C is wrong.
    final PairScore
      pairA = new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("A2"),1,-1),
      pairB=new PairScore(tentativeGraph.findVertex("B1"), tentativeGraph.findVertex("B2"),0,0),
      pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),0,1),
      pairD=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),1,0);

    final WekaDataCollector dataCollector = new WekaDataCollector();
    List<PairRank> assessors = new ArrayList<PairRank>(20);
    assessors.add(dataCollector.new PairRank("statechum score")
    {// 1
View Full Code Here
TOP

Related Classes of statechum.analysis.learning.PairScore

  • statechum.analysis.learning.experiments.PairQualityLearner
  • statechum.analysis.learning.experiments.PairSelection.ASE2014$EDSM_MarkovLearner
  • statechum.analysis.learning.experiments.PairSelection.Cav2014$EDSMReferenceLearner
  • statechum.analysis.learning.experiments.PairSelection.Cav2014$KTailsReferenceLearner
  • statechum.analysis.learning.experiments.PairSelection.Cav2014$LearnerMarkovPassive
  • statechum.analysis.learning.experiments.PairSelection.Cav2014$ReferenceLearnerUsingSiccoScoring
  • statechum.analysis.learning.experiments.PairSelection.CVS$EDSM_MarkovLearner
  • statechum.analysis.learning.experiments.PairSelection.CVS_With_Random_traces_Generation$EDSM_MarkovLearner
  • statechum.analysis.learning.experiments.PairSelection.MarkovLearnerExperimentWithStatisticalAnalysis$EDSM_MarkovLearner
  • statechum.analysis.learning.experiments.PairSelection.MarkovPassivePairSelection
    • 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.