Package statechum.analysis.learning.observers

Examples of statechum.analysis.learning.observers.Test_LearnerComparator

252
253
254
255
256
257
258
259
260
    //
    // It is worth noting that since the above was written GD has been modified to generate
    // an identical graph by relabelling states. If this one is utilised, the outcomes
    // of learning should be identical.
   
    new Test_LearnerComparator(learner2,simulator,!evalData.config.isIgnoreVertexAttributesInLogReplay()).learnMachine(initial.plus, initial.minus);
    if (logFileName.contains(Configuration.LEARNER.LEARNER_BLUEFRINGE_DEC2007.name()))
      VertexID.comparisonKind = ComparisonKind.COMPARISON_NORM;// reset this one if needed.
  }
View Full Code Here
78
79
80
81
82
83
84
      e.printStackTrace();
    }
    //WMethod.checkM(initial.graph, learner2.getLearner().init(initial.plus, initial.minus));
    
     */
    new Test_LearnerComparator(learner2.getLearner(),simulator).learnMachine(initial.plus, initial.minus);
  }
View Full Code Here
268
269
270
271
272
273
274
275
276
277
    //
    // It is worth noting that since the above was written GD has been modified to generate
    // an identical graph by relabelling states. If this one is utilised, the outcomes
    // of learning should be identical.
   
    new Test_LearnerComparator(learner2,simulator,!evalData.config.isIgnoreVertexAttributesInLogReplay()).learnMachine(initial.plus, initial.minus);
    if (logFileName.contains(Configuration.LEARNER.LEARNER_BLUEFRINGE_DEC2007.name()))
      VertexID.comparisonKind = ComparisonKind.COMPARISON_NORM;// reset this one if needed.
    inputStream.close();
  }
View Full Code Here
232
233
234
235
236
237
238
239
240
    // where A and C respectively are winners.
    // GD comparison of the two graphs determines that we need to remove the part
    // of the first graph starting with a19 transition and just loop a19 around B.
    // This way, states B and D are preserved and the outcome of reconstruction is  B-a19->B-a5->D
    // which is bisimular to the expected graph but state names are different.
    new Test_LearnerComparator(learner2,simulator,!evalData.config.isIgnoreVertexAttributesInLogReplay()).learnMachine(initial.plus, initial.minus);
    if (logFileName.contains(Configuration.LEARNER.LEARNER_BLUEFRINGE_DEC2007.name()))
      VertexID.comparisonKind = ComparisonKind.COMPARISON_NORM;// reset this one if needed.
  }
View Full Code Here
255
256
257
258
259
260
261
262
263
    //
    // It is worth noting that since the above was written GD has been modified to generate
    // an identical graph by relabelling states. If this one is utilised, the outcomes
    // of learning should be identical.
   
    new Test_LearnerComparator(learner2,simulator,!evalData.config.isIgnoreVertexAttributesInLogReplay()).learnMachine(initial.plus, initial.minus);
    if (logFileName.contains(Configuration.LEARNER.LEARNER_BLUEFRINGE_DEC2007.name()))
      VertexID.comparisonKind = ComparisonKind.COMPARISON_NORM;// reset this one if needed.
  }
View Full Code Here
266
267
268
269
270
271
272
273
274
275
    //
    // It is worth noting that since the above was written GD has been modified to generate
    // an identical graph by relabelling states. If this one is utilised, the outcomes
    // of learning should be identical.
   
    new Test_LearnerComparator(learner2,simulator,!evalData.config.isIgnoreVertexAttributesInLogReplay()).learnMachine(initial.plus, initial.minus);
    if (logFileName.contains(Configuration.LEARNER.LEARNER_BLUEFRINGE_DEC2007.name()))
      VertexID.comparisonKind = ComparisonKind.COMPARISON_NORM;// reset this one if needed.
    inputStream.close();
  }
View Full Code Here
267
268
269
270
271
272
273
274
275
276
    //
    // It is worth noting that since the above was written GD has been modified to generate
    // an identical graph by relabelling states. If this one is utilised, the outcomes
    // of learning should be identical.
   
    new Test_LearnerComparator(learner2,simulator,!evalData.config.isIgnoreVertexAttributesInLogReplay()).learnMachine(initial.plus, initial.minus);
    if (logFileName.contains(Configuration.LEARNER.LEARNER_BLUEFRINGE_DEC2007.name()))
      VertexID.comparisonKind = ComparisonKind.COMPARISON_NORM;// reset this one if needed.
    inputStream.close();
  }
View Full Code Here
TOP

Related Classes of statechum.analysis.learning.observers.Test_LearnerComparator

  • edu.uci.ics.jung.graph.impl.DirectedSparseGraph
  • statechum.analysis.learning.computeStateScores
  • statechum.analysis.learning.computeStateScores.PairScore
  • statechum.analysis.learning.experiments.Test_CheckLearnerAgainstLog
  • statechum.analysis.learning.observers.ProgressDecorator.AugmentPTAData
  • statechum.analysis.learning.PairScore
  • statechum.analysis.learning.rpnicore.LearnerGraph
  • statechum.analysis.learning.Test_CheckLearnerAgainstLog
  • statechum.analysis.learning.TestFSMAlgo.FSMStructure
  • statechum.analysis.learning.rpnicore.WMethod.DifferentFSMException
    • 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.