Package statechum.analysis.learning

Examples of statechum.analysis.learning.PairScore

151
152
153
154
155
156
157
158
159
160
161
162
 
  @Test
  public void testSplitSetOfPairsIntoRightAndWrong6()
  {
    Collection<PairScore> correctPairs = new LinkedList<PairScore>(), wrongPairs = new LinkedList<PairScore>();
    PairScore pairA = new PairScore(tentativeGraph.findVertex("C1"), tentativeGraph.findVertex("A2"),0,0),pairB=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("C2"),0,0),
        pairC=new PairScore(tentativeGraph.findVertex("A1"), tentativeGraph.findVertex("B2"),0,0);
   
    int outcome = PairQualityLearner.SplitSetOfPairsIntoRightAndWrong(tentativeGraph, correctGraph, Arrays.asList(new PairScore[]{
        pairC,pairB,pairB,pairA
    }), correctPairs, wrongPairs);
    Assert.assertEquals(JUConstants.intUNKNOWN, outcome);
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
 
  @Test
  public void testBuildSetsForComparators2()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("A1")),1,0);
    List<PairScore> pairs = Arrays.asList(new PairScore[]{
        pairA
    });
    classifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
View Full Code Here
226
227
228
229
230
231
232
233
234
235
236
 
  @Test
  public void testBuildSetsForComparators3()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0)
        ;
    List<PairScore> pairs = Arrays.asList(new PairScore[]{
        pairA
    });
    classifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
View Full Code Here
244
245
246
247
248
249
250
251
252
253
254
255
 
  @Test
  public void testBuildSetsForComparators4()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairB = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A2")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0)
        ;
    List<PairScore> pairs = Arrays.asList(new PairScore[]{
        pairA,pairB
    });
    classifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
277
278
 
  @Test
  public void testBuildSetsForComparators5()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairB = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A2")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairC = new PairScore(tentativeGraph.findVertex(VertexID.parseID("C1")),tentativeGraph.findVertex(VertexID.parseID("C2")),2,0) // the score of 2 ensures it will be at the end of the keySet
        ;
    List<PairScore> pairs = Arrays.asList(new PairScore[]{
        pairA,pairB,pairC
    });
    classifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
View Full Code Here
292
293
294
295
296
297
298
299
300
301
302
303
304
 
  @Test
  public void testBuildSetsForComparators6()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairB = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A2")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairC = new PairScore(tentativeGraph.findVertex(VertexID.parseID("C1")),tentativeGraph.findVertex(VertexID.parseID("C2")),2,0) // the score of 2 ensures it will be at the end of the keySet
        ;
    List<PairScore> pairs = Arrays.asList(new PairScore[]{
        pairA,pairB,pairC,pairC,pairC,pairC // we add the same pair a few times and it then seems to buildSetsForComparators that it has a few alternatives
    });
    classifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
View Full Code Here
318
319
320
321
322
323
324
325
326
327
328
329
 
  /** Adjacency in Blue rather than in Red should not be considered */
  public void testBuildSetsForComparators7()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairB = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B2")),2,0) // the score of 2 ensures it will be at the end of the keySet
        ;
    List<PairScore> pairs = Arrays.asList(new PairScore[]{
        pairA,pairB
    });
    classifier.buildSetsForComparatorsThatDoNotDependOnFiltering(pairs, tentativeGraph);
View Full Code Here
707
708
709
710
711
712
713
714
715
716
717
 
  @Test
  public void testComputeAverageAndSD0()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0);
    List<PairRank> assessors = new ArrayList<PairRank>(20);
    assessors.add(classifier.new PairRank("conventional score")
    {
      @Override
      public long getValue(PairScore pair) {
View Full Code Here
738
739
740
741
742
743
744
745
746
747
748
749
750
 
  @Test
  public void testComputeAverageAndSD1()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairB = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A2")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairC = new PairScore(tentativeGraph.findVertex(VertexID.parseID("C1")),tentativeGraph.findVertex(VertexID.parseID("C2")),2,0) // the score of 2 ensures it will be at the end of the keySet
        ;
    List<PairRank> assessors = new ArrayList<PairRank>(20);
    assessors.add(classifier.new PairRank("conventional score")
    {
      @Override
View Full Code Here
772
773
774
775
776
777
778
779
780
781
782
783
784
  @Test
  public void testComputeAverageAndSD1_absolute()
  {
    WekaDataCollector classifier = new WekaDataCollector();
    PairScore pairA = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A1")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairB = new PairScore(tentativeGraph.findVertex(VertexID.parseID("A2")),tentativeGraph.findVertex(VertexID.parseID("B1")),1,0),
        pairC = new PairScore(tentativeGraph.findVertex(VertexID.parseID("C1")),tentativeGraph.findVertex(VertexID.parseID("C2")),2,0) // the score of 2 ensures it will be at the end of the keySet
        ;
    List<PairRank> assessors = new ArrayList<PairRank>(20);
    assessors.add(classifier.new PairRank("conventional score")
    {
      @Override
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.